./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:52:36,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:52:36,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:52:37,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:52:37,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:52:37,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:52:37,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:52:37,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:52:37,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:52:37,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:52:37,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:52:37,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:52:37,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:52:37,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:52:37,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:52:37,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:52:37,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:52:37,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:52:37,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:52:37,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:52:37,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:52:37,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:52:37,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:52:37,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:52:37,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:52:37,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:52:37,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:52:37,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:52:37,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:52:37,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:52:37,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:52:37,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:52:37,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:52:37,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:52:37,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:52:37,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:52:37,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:52:37,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:52:37,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:52:37,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:52:37,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:52:37,090 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-03 01:52:37,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:52:37,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:52:37,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:52:37,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:52:37,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:52:37,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:52:37,122 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:52:37,122 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:52:37,123 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:52:37,123 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:52:37,123 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:52:37,124 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:52:37,124 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:52:37,124 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:52:37,125 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:52:37,125 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:52:37,125 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:52:37,126 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:52:37,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:52:37,127 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:52:37,127 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:52:37,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:52:37,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:52:37,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:52:37,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:52:37,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:52:37,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:52:37,130 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-03 01:52:37,130 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:52:37,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:52:37,130 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:52:37,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:52:37,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:52:37,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:52:37,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:52:37,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:52:37,132 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:52:37,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:52:37,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:52:37,133 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:52:37,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:52:37,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:52:37,134 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:52:37,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/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_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2022-11-03 01:52:37,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:52:37,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:52:37,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:52:37,476 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:52:37,477 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:52:37,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-11-03 01:52:37,570 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/data/d3e328132/d960eaee0fd54007917cd521bcd0df4a/FLAGd898fa9a1 [2022-11-03 01:52:38,219 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:52:38,220 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-11-03 01:52:38,257 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/data/d3e328132/d960eaee0fd54007917cd521bcd0df4a/FLAGd898fa9a1 [2022-11-03 01:52:38,449 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/data/d3e328132/d960eaee0fd54007917cd521bcd0df4a [2022-11-03 01:52:38,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:52:38,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:52:38,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:52:38,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:52:38,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:52:38,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:52:38" (1/1) ... [2022-11-03 01:52:38,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c33cf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:38, skipping insertion in model container [2022-11-03 01:52:38,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:52:38" (1/1) ... [2022-11-03 01:52:38,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:52:38,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:52:39,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:52:39,265 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:52:39,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:52:39,411 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:52:39,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39 WrapperNode [2022-11-03 01:52:39,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:52:39,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:52:39,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:52:39,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:52:39,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,513 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-11-03 01:52:39,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:52:39,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:52:39,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:52:39,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:52:39,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,593 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:52:39,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:52:39,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:52:39,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:52:39,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (1/1) ... [2022-11-03 01:52:39,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:52:39,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:39,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:52:39,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:52:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:52:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:52:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:52:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:52:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 01:52:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:52:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-03 01:52:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-03 01:52:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:52:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:52:39,712 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 01:52:39,841 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:52:39,844 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:52:40,172 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:52:40,179 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:52:40,180 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 01:52:40,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:40 BoogieIcfgContainer [2022-11-03 01:52:40,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:52:40,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:52:40,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:52:40,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:52:40,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:52:38" (1/3) ... [2022-11-03 01:52:40,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a0bede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:40, skipping insertion in model container [2022-11-03 01:52:40,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:39" (2/3) ... [2022-11-03 01:52:40,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a0bede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:40, skipping insertion in model container [2022-11-03 01:52:40,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:40" (3/3) ... [2022-11-03 01:52:40,200 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-11-03 01:52:40,209 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 01:52:40,220 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:52:40,220 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-03 01:52:40,220 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 01:52:40,331 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 01:52:40,385 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 01:52:40,402 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 106 transitions, 217 flow [2022-11-03 01:52:40,411 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 106 transitions, 217 flow [2022-11-03 01:52:40,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 106 transitions, 217 flow [2022-11-03 01:52:40,477 INFO L130 PetriNetUnfolder]: 6/105 cut-off events. [2022-11-03 01:52:40,479 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 01:52:40,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 105 events. 6/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 133 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-03 01:52:40,489 INFO L118 LiptonReduction]: Number of co-enabled transitions 3192 [2022-11-03 01:52:43,264 INFO L133 LiptonReduction]: Checked pairs total: 7916 [2022-11-03 01:52:43,266 INFO L135 LiptonReduction]: Total number of compositions: 68 [2022-11-03 01:52:43,282 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 41 transitions, 87 flow [2022-11-03 01:52:43,347 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:43,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:52:43,381 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1770ec18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:52:43,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-03 01:52:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:52:43,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:43,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:43,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1265998072, now seen corresponding path program 1 times [2022-11-03 01:52:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:43,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28830684] [2022-11-03 01:52:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:43,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:43,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28830684] [2022-11-03 01:52:43,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28830684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:43,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:43,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:52:43,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165874051] [2022-11-03 01:52:43,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:43,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:52:43,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:52:43,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:52:43,834 INFO L87 Difference]: Start difference. First operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:43,955 INFO L93 Difference]: Finished difference Result 327 states and 651 transitions. [2022-11-03 01:52:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:52:43,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 01:52:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:43,987 INFO L225 Difference]: With dead ends: 327 [2022-11-03 01:52:43,987 INFO L226 Difference]: Without dead ends: 327 [2022-11-03 01:52:43,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:52:43,996 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:44,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-03 01:52:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2022-11-03 01:52:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 319 states have (on average 2.040752351097179) internal successors, (651), 326 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 651 transitions. [2022-11-03 01:52:44,107 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 651 transitions. Word has length 11 [2022-11-03 01:52:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:44,107 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 651 transitions. [2022-11-03 01:52:44,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 651 transitions. [2022-11-03 01:52:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:52:44,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:44,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:44,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:52:44,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash 677451657, now seen corresponding path program 1 times [2022-11-03 01:52:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:44,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658224169] [2022-11-03 01:52:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:44,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:44,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:44,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658224169] [2022-11-03 01:52:44,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658224169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:44,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864107649] [2022-11-03 01:52:44,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:44,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:44,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:44,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:44,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:52:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:44,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:52:44,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:44,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:44,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864107649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:52:44,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [117751766] [2022-11-03 01:52:44,544 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:52:44,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:52:44,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-03 01:52:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828906783] [2022-11-03 01:52:44,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:52:44,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:52:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:52:44,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:52:44,561 INFO L87 Difference]: Start difference. First operand 327 states and 651 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:44,653 INFO L93 Difference]: Finished difference Result 330 states and 654 transitions. [2022-11-03 01:52:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:52:44,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 12 [2022-11-03 01:52:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:44,658 INFO L225 Difference]: With dead ends: 330 [2022-11-03 01:52:44,658 INFO L226 Difference]: Without dead ends: 330 [2022-11-03 01:52:44,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:52:44,659 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:44,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-03 01:52:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2022-11-03 01:52:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 322 states have (on average 2.031055900621118) internal successors, (654), 329 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 654 transitions. [2022-11-03 01:52:44,681 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 654 transitions. Word has length 12 [2022-11-03 01:52:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:44,682 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 654 transitions. [2022-11-03 01:52:44,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 654 transitions. [2022-11-03 01:52:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:52:44,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:44,684 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:44,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:44,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:44,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1290993480, now seen corresponding path program 2 times [2022-11-03 01:52:44,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:44,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129026533] [2022-11-03 01:52:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:45,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:45,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129026533] [2022-11-03 01:52:45,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129026533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:45,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787242126] [2022-11-03 01:52:45,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:52:45,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:45,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:45,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:45,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:52:45,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:52:45,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:52:45,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 01:52:45,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:45,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:52:45,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:45,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:52:45,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:45,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:45,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:45,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:52:45,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:45,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:45,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:45,661 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:45,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 01:52:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:52:45,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:45,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787242126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:45,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:45,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2022-11-03 01:52:45,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003430345] [2022-11-03 01:52:45,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:45,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:52:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:52:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:52:45,721 INFO L87 Difference]: Start difference. First operand 330 states and 654 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:46,323 INFO L93 Difference]: Finished difference Result 754 states and 1502 transitions. [2022-11-03 01:52:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:52:46,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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 [2022-11-03 01:52:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:46,328 INFO L225 Difference]: With dead ends: 754 [2022-11-03 01:52:46,328 INFO L226 Difference]: Without dead ends: 754 [2022-11-03 01:52:46,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-03 01:52:46,330 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 184 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:46,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 109 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:52:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-03 01:52:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 456. [2022-11-03 01:52:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 448 states have (on average 2.0223214285714284) internal successors, (906), 455 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 906 transitions. [2022-11-03 01:52:46,363 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 906 transitions. Word has length 15 [2022-11-03 01:52:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:46,364 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 906 transitions. [2022-11-03 01:52:46,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 906 transitions. [2022-11-03 01:52:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:52:46,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:46,368 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:46,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 01:52:46,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:46,594 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1780366603, now seen corresponding path program 1 times [2022-11-03 01:52:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:46,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344968647] [2022-11-03 01:52:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:46,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:46,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344968647] [2022-11-03 01:52:46,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344968647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:46,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828062411] [2022-11-03 01:52:46,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:46,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:46,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:46,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:52:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:46,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:52:46,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:46,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:47,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828062411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:52:47,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690432772] [2022-11-03 01:52:47,072 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:52:47,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:52:47,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-03 01:52:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748704725] [2022-11-03 01:52:47,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:52:47,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:52:47,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:47,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:52:47,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:52:47,078 INFO L87 Difference]: Start difference. First operand 456 states and 906 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:47,153 INFO L93 Difference]: Finished difference Result 462 states and 912 transitions. [2022-11-03 01:52:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:52:47,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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 [2022-11-03 01:52:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:47,158 INFO L225 Difference]: With dead ends: 462 [2022-11-03 01:52:47,158 INFO L226 Difference]: Without dead ends: 462 [2022-11-03 01:52:47,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:52:47,162 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:47,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-11-03 01:52:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2022-11-03 01:52:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 454 states have (on average 2.0088105726872247) internal successors, (912), 461 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 912 transitions. [2022-11-03 01:52:47,189 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 912 transitions. Word has length 15 [2022-11-03 01:52:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:47,191 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 912 transitions. [2022-11-03 01:52:47,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 912 transitions. [2022-11-03 01:52:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 01:52:47,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:47,197 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:47,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:47,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:47,422 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:47,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash 72656235, now seen corresponding path program 2 times [2022-11-03 01:52:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:47,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358203674] [2022-11-03 01:52:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:47,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:47,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358203674] [2022-11-03 01:52:47,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358203674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:47,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:47,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:52:47,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811060069] [2022-11-03 01:52:47,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:47,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:47,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:47,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:47,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:52:47,809 INFO L87 Difference]: Start difference. First operand 462 states and 912 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:48,217 INFO L93 Difference]: Finished difference Result 556 states and 1100 transitions. [2022-11-03 01:52:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:52:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 21 [2022-11-03 01:52:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:48,222 INFO L225 Difference]: With dead ends: 556 [2022-11-03 01:52:48,222 INFO L226 Difference]: Without dead ends: 556 [2022-11-03 01:52:48,222 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 [2022-11-03 01:52:48,223 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 46 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:48,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 26 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:52:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-11-03 01:52:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 522. [2022-11-03 01:52:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 514 states have (on average 2.007782101167315) internal successors, (1032), 521 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1032 transitions. [2022-11-03 01:52:48,262 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1032 transitions. Word has length 21 [2022-11-03 01:52:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:48,262 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 1032 transitions. [2022-11-03 01:52:48,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1032 transitions. [2022-11-03 01:52:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 01:52:48,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:48,277 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:48,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:52:48,279 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash 388555034, now seen corresponding path program 1 times [2022-11-03 01:52:48,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:48,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319069125] [2022-11-03 01:52:48,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:48,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:48,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:48,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319069125] [2022-11-03 01:52:48,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319069125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:48,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:48,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:52:48,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21591549] [2022-11-03 01:52:48,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:48,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:48,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:52:48,776 INFO L87 Difference]: Start difference. First operand 522 states and 1032 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:49,059 INFO L93 Difference]: Finished difference Result 588 states and 1164 transitions. [2022-11-03 01:52:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:52:49,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-03 01:52:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:49,062 INFO L225 Difference]: With dead ends: 588 [2022-11-03 01:52:49,063 INFO L226 Difference]: Without dead ends: 588 [2022-11-03 01:52:49,063 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 [2022-11-03 01:52:49,063 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:49,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 36 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:52:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-11-03 01:52:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2022-11-03 01:52:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 580 states have (on average 2.0068965517241377) internal successors, (1164), 587 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1164 transitions. [2022-11-03 01:52:49,082 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1164 transitions. Word has length 27 [2022-11-03 01:52:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:49,083 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 1164 transitions. [2022-11-03 01:52:49,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1164 transitions. [2022-11-03 01:52:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 01:52:49,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:49,088 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:49,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:52:49,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:49,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1222329439, now seen corresponding path program 1 times [2022-11-03 01:52:49,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:49,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56068014] [2022-11-03 01:52:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:49,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:49,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:49,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56068014] [2022-11-03 01:52:49,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56068014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:49,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:49,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:52:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789105298] [2022-11-03 01:52:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:49,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:49,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:52:49,473 INFO L87 Difference]: Start difference. First operand 588 states and 1164 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:49,758 INFO L93 Difference]: Finished difference Result 651 states and 1290 transitions. [2022-11-03 01:52:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:52:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-03 01:52:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:49,762 INFO L225 Difference]: With dead ends: 651 [2022-11-03 01:52:49,762 INFO L226 Difference]: Without dead ends: 636 [2022-11-03 01:52:49,762 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 [2022-11-03 01:52:49,763 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:49,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 28 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:52:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-11-03 01:52:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2022-11-03 01:52:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 628 states have (on average 2.0031847133757963) internal successors, (1258), 635 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1258 transitions. [2022-11-03 01:52:49,781 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1258 transitions. Word has length 27 [2022-11-03 01:52:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:49,782 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 1258 transitions. [2022-11-03 01:52:49,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1258 transitions. [2022-11-03 01:52:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:52:49,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:49,783 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:49,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:52:49,784 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:49,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1367734960, now seen corresponding path program 1 times [2022-11-03 01:52:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:49,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479051994] [2022-11-03 01:52:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 01:52:50,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:50,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479051994] [2022-11-03 01:52:50,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479051994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:50,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091091656] [2022-11-03 01:52:50,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:50,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:50,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:50,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:50,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:52:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:50,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 01:52:50,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:50,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:52:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:51,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:51,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091091656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:51,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:51,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-03 01:52:51,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537068865] [2022-11-03 01:52:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:51,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:51,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:51,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:52:51,038 INFO L87 Difference]: Start difference. First operand 636 states and 1258 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:51,153 INFO L93 Difference]: Finished difference Result 1390 states and 2753 transitions. [2022-11-03 01:52:51,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:52:51,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 01:52:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:51,160 INFO L225 Difference]: With dead ends: 1390 [2022-11-03 01:52:51,160 INFO L226 Difference]: Without dead ends: 1390 [2022-11-03 01:52:51,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:52:51,162 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 116 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:51,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 130 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2022-11-03 01:52:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 656. [2022-11-03 01:52:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 648 states have (on average 1.9830246913580247) internal successors, (1285), 655 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1285 transitions. [2022-11-03 01:52:51,187 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1285 transitions. Word has length 31 [2022-11-03 01:52:51,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:51,187 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1285 transitions. [2022-11-03 01:52:51,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1285 transitions. [2022-11-03 01:52:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:52:51,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:51,189 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:51,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:51,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 01:52:51,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:51,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:51,414 INFO L85 PathProgramCache]: Analyzing trace with hash 16291562, now seen corresponding path program 1 times [2022-11-03 01:52:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:51,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456340633] [2022-11-03 01:52:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 01:52:51,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:51,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456340633] [2022-11-03 01:52:51,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456340633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:51,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375073747] [2022-11-03 01:52:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:51,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:51,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:51,976 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:51,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:52:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:52,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 01:52:52,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:52,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:52:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:52,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:52,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375073747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:52,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:52,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-03 01:52:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183603442] [2022-11-03 01:52:52,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:52,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:52:52,240 INFO L87 Difference]: Start difference. First operand 656 states and 1285 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:52,364 INFO L93 Difference]: Finished difference Result 1417 states and 2781 transitions. [2022-11-03 01:52:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:52:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 01:52:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:52,372 INFO L225 Difference]: With dead ends: 1417 [2022-11-03 01:52:52,373 INFO L226 Difference]: Without dead ends: 1417 [2022-11-03 01:52:52,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:52:52,375 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 154 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:52,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 139 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2022-11-03 01:52:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 670. [2022-11-03 01:52:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 662 states have (on average 1.9637462235649548) internal successors, (1300), 669 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1300 transitions. [2022-11-03 01:52:52,400 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1300 transitions. Word has length 31 [2022-11-03 01:52:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:52,401 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 1300 transitions. [2022-11-03 01:52:52,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1300 transitions. [2022-11-03 01:52:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:52:52,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:52,402 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:52,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:52,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:52,625 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1928293684, now seen corresponding path program 2 times [2022-11-03 01:52:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:52,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435699297] [2022-11-03 01:52:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 01:52:53,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435699297] [2022-11-03 01:52:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435699297] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271984988] [2022-11-03 01:52:53,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:52:53,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:53,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:53,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:53,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:52:53,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:52:53,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:52:53,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 01:52:53,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:53,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:52:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:53,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:53,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271984988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:53,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:53,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-03 01:52:53,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905375866] [2022-11-03 01:52:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:53,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:53,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:52:53,413 INFO L87 Difference]: Start difference. First operand 670 states and 1300 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:53,535 INFO L93 Difference]: Finished difference Result 1518 states and 2968 transitions. [2022-11-03 01:52:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:52:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 01:52:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:53,543 INFO L225 Difference]: With dead ends: 1518 [2022-11-03 01:52:53,543 INFO L226 Difference]: Without dead ends: 1518 [2022-11-03 01:52:53,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:52:53,544 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 143 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:53,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 128 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2022-11-03 01:52:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 686. [2022-11-03 01:52:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 678 states have (on average 1.9646017699115044) internal successors, (1332), 685 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1332 transitions. [2022-11-03 01:52:53,570 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1332 transitions. Word has length 31 [2022-11-03 01:52:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:53,571 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 1332 transitions. [2022-11-03 01:52:53,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1332 transitions. [2022-11-03 01:52:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:52:53,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:53,572 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:53,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:53,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 01:52:53,789 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:53,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 97555420, now seen corresponding path program 3 times [2022-11-03 01:52:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:53,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979124528] [2022-11-03 01:52:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 01:52:54,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:54,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979124528] [2022-11-03 01:52:54,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979124528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:54,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934895300] [2022-11-03 01:52:54,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:52:54,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:54,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:54,327 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:54,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:52:54,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:52:54,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:52:54,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 01:52:54,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:54,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:52:54,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:52:54,547 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:52:54,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2022-11-03 01:52:54,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:52:54,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:54,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:52:54,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:54,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:54,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:52:54,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:54,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:54,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:54,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 01:52:54,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-03 01:52:54,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-03 01:52:54,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-03 01:52:54,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-03 01:52:54,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-03 01:52:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:54,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:54,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934895300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:54,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:54,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2022-11-03 01:52:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121288691] [2022-11-03 01:52:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:54,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:52:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:52:54,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:52:54,942 INFO L87 Difference]: Start difference. First operand 686 states and 1332 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:56,000 INFO L93 Difference]: Finished difference Result 1998 states and 3952 transitions. [2022-11-03 01:52:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 01:52:56,001 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 01:52:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:56,009 INFO L225 Difference]: With dead ends: 1998 [2022-11-03 01:52:56,009 INFO L226 Difference]: Without dead ends: 1998 [2022-11-03 01:52:56,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2022-11-03 01:52:56,010 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 259 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:56,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 88 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:52:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2022-11-03 01:52:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 799. [2022-11-03 01:52:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 791 states have (on average 1.97724399494311) internal successors, (1564), 798 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1564 transitions. [2022-11-03 01:52:56,042 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1564 transitions. Word has length 31 [2022-11-03 01:52:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:56,043 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1564 transitions. [2022-11-03 01:52:56,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1564 transitions. [2022-11-03 01:52:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:52:56,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:56,044 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:56,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:56,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:56,265 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash 96876733, now seen corresponding path program 1 times [2022-11-03 01:52:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:56,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702830295] [2022-11-03 01:52:56,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 01:52:56,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:56,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702830295] [2022-11-03 01:52:56,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702830295] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:56,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211837259] [2022-11-03 01:52:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:56,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:56,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:56,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:52:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:57,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 01:52:57,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:57,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:52:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:57,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:57,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211837259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:57,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:57,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-03 01:52:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625882537] [2022-11-03 01:52:57,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:57,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:52:57,207 INFO L87 Difference]: Start difference. First operand 799 states and 1564 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:57,344 INFO L93 Difference]: Finished difference Result 1489 states and 2923 transitions. [2022-11-03 01:52:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:52:57,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 01:52:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:57,351 INFO L225 Difference]: With dead ends: 1489 [2022-11-03 01:52:57,352 INFO L226 Difference]: Without dead ends: 1489 [2022-11-03 01:52:57,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:52:57,353 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 142 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:57,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 150 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2022-11-03 01:52:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 699. [2022-11-03 01:52:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 691 states have (on average 1.9652677279305355) internal successors, (1358), 698 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1358 transitions. [2022-11-03 01:52:57,383 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1358 transitions. Word has length 31 [2022-11-03 01:52:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:57,383 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 1358 transitions. [2022-11-03 01:52:57,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1358 transitions. [2022-11-03 01:52:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 01:52:57,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:57,385 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:57,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:57,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 01:52:57,605 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1509683667, now seen corresponding path program 1 times [2022-11-03 01:52:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:57,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841929465] [2022-11-03 01:52:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-03 01:52:57,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:57,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841929465] [2022-11-03 01:52:57,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841929465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:57,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:57,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:52:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552863252] [2022-11-03 01:52:57,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:57,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:57,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:57,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:57,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:52:57,914 INFO L87 Difference]: Start difference. First operand 699 states and 1358 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:58,165 INFO L93 Difference]: Finished difference Result 793 states and 1546 transitions. [2022-11-03 01:52:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:52:58,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 35 [2022-11-03 01:52:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:58,168 INFO L225 Difference]: With dead ends: 793 [2022-11-03 01:52:58,168 INFO L226 Difference]: Without dead ends: 769 [2022-11-03 01:52:58,169 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 [2022-11-03 01:52:58,169 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:58,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:52:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-11-03 01:52:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 617. [2022-11-03 01:52:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 610 states have (on average 1.9540983606557376) internal successors, (1192), 616 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1192 transitions. [2022-11-03 01:52:58,189 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1192 transitions. Word has length 35 [2022-11-03 01:52:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:58,190 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 1192 transitions. [2022-11-03 01:52:58,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:52:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1192 transitions. [2022-11-03 01:52:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:52:58,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:58,191 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:58,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 01:52:58,192 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:52:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash -879883883, now seen corresponding path program 1 times [2022-11-03 01:52:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:58,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439835413] [2022-11-03 01:52:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:59,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:59,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439835413] [2022-11-03 01:52:59,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439835413] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:59,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103444940] [2022-11-03 01:52:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:59,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:59,031 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:59,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:52:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:59,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:52:59,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:59,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:52:59,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:52:59,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:52:59,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 01:52:59,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:59,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:59,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:59,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:59,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 01:52:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:52:59,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:08,012 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|))))) is different from false [2022-11-03 01:53:09,590 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))))) is different from false [2022-11-03 01:53:24,909 WARN L234 SmtUtils]: Spent 11.84s on a formula simplification. DAG size of input: 40 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:53:40,018 WARN L234 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 37 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:53:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-11-03 01:53:42,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103444940] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:42,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [985037225] [2022-11-03 01:53:42,120 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:53:42,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:42,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 01:53:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998852585] [2022-11-03 01:53:42,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:42,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:53:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:42,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:53:42,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=636, Unknown=11, NotChecked=110, Total=930 [2022-11-03 01:53:42,123 INFO L87 Difference]: Start difference. First operand 617 states and 1192 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:43,739 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse3)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse2)))))) is different from false [2022-11-03 01:53:45,311 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse2 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (= |c_~#cache~0.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse2 .cse4)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| Int) (v_ArrVal_996 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344| v_ArrVal_996)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_344|))) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse2 .cse1)))) is different from false [2022-11-03 01:53:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:45,834 INFO L93 Difference]: Finished difference Result 2217 states and 4391 transitions. [2022-11-03 01:53:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:53:45,835 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 45 [2022-11-03 01:53:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:45,845 INFO L225 Difference]: With dead ends: 2217 [2022-11-03 01:53:45,845 INFO L226 Difference]: Without dead ends: 2217 [2022-11-03 01:53:45,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 45.2s TimeCoverageRelationStatistics Valid=271, Invalid=922, Unknown=13, NotChecked=276, Total=1482 [2022-11-03 01:53:45,846 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 397 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1175 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:45,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 311 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 849 Invalid, 0 Unknown, 1175 Unchecked, 0.8s Time] [2022-11-03 01:53:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2022-11-03 01:53:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 621. [2022-11-03 01:53:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 614 states have (on average 1.9543973941368078) internal successors, (1200), 620 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1200 transitions. [2022-11-03 01:53:45,878 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1200 transitions. Word has length 45 [2022-11-03 01:53:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:45,879 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 1200 transitions. [2022-11-03 01:53:45,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1200 transitions. [2022-11-03 01:53:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:53:45,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:45,881 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:45,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:46,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:53:46,097 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:53:46,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2073893767, now seen corresponding path program 2 times [2022-11-03 01:53:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:46,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400650198] [2022-11-03 01:53:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:53:46,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:46,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400650198] [2022-11-03 01:53:46,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400650198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:46,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575901485] [2022-11-03 01:53:46,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:53:46,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:46,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:46,922 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:46,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:53:47,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:53:47,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:47,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:53:47,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:47,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:53:47,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:53:47,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:47,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:53:47,563 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:53:47,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 01:53:47,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 01:53:47,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:47,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:47,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:47,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:47,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-03 01:53:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:53:47,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:49,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 01:53:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:53:49,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575901485] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:49,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:53:49,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2022-11-03 01:53:49,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334313520] [2022-11-03 01:53:49,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:49,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:53:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:49,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:53:49,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:53:49,206 INFO L87 Difference]: Start difference. First operand 621 states and 1200 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:49,814 INFO L93 Difference]: Finished difference Result 928 states and 1805 transitions. [2022-11-03 01:53:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:53:49,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 45 [2022-11-03 01:53:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:49,819 INFO L225 Difference]: With dead ends: 928 [2022-11-03 01:53:49,819 INFO L226 Difference]: Without dead ends: 928 [2022-11-03 01:53:49,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:53:49,820 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:49,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 66 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 275 Unchecked, 0.2s Time] [2022-11-03 01:53:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-11-03 01:53:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 623. [2022-11-03 01:53:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 616 states have (on average 1.9545454545454546) internal successors, (1204), 622 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1204 transitions. [2022-11-03 01:53:49,838 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1204 transitions. Word has length 45 [2022-11-03 01:53:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:49,839 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 1204 transitions. [2022-11-03 01:53:49,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1204 transitions. [2022-11-03 01:53:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:53:49,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:49,840 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:49,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:50,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:50,054 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:53:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2074579177, now seen corresponding path program 3 times [2022-11-03 01:53:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:50,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051399246] [2022-11-03 01:53:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:50,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:53:50,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:50,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051399246] [2022-11-03 01:53:50,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051399246] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:50,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690722155] [2022-11-03 01:53:50,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:53:50,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:50,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:50,778 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:50,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:53:51,095 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:53:51,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:51,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:53:51,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:51,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:53:51,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:51,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:53:51,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:51,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:51,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:51,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 42 [2022-11-03 01:53:51,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:53:51,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 01:53:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:53:51,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:53,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| Int)) (or (forall ((v_ArrVal_1300 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| v_ArrVal_1300)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| Int)) (or (forall ((v_ArrVal_1300 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| v_ArrVal_1300)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| Int)) (or (forall ((v_ArrVal_1300 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| v_ArrVal_1300)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346|))))) is different from false [2022-11-03 01:54:22,801 WARN L234 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:54:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:54:24,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690722155] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:24,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1620605854] [2022-11-03 01:54:24,613 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:54:24,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:24,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-03 01:54:24,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578342344] [2022-11-03 01:54:24,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:24,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:54:24,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:24,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:54:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=648, Unknown=11, NotChecked=54, Total=870 [2022-11-03 01:54:24,616 INFO L87 Difference]: Start difference. First operand 623 states and 1204 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:26,328 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse3 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| Int)) (or (forall ((v_ArrVal_1300 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| v_ArrVal_1300)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 .cse4)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| Int)) (or (forall ((v_ArrVal_1300 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| v_ArrVal_1300)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| Int)) (or (forall ((v_ArrVal_1300 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| v_ArrVal_1300)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 .cse1)))) is different from false [2022-11-03 01:54:27,526 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse3 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| Int)) (or (forall ((v_ArrVal_1300 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| v_ArrVal_1300)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 .cse4)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| Int)) (or (forall ((v_ArrVal_1300 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| v_ArrVal_1300)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| Int)) (or (forall ((v_ArrVal_1300 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346| v_ArrVal_1300)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_346|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 .cse1)))) is different from false [2022-11-03 01:54:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:28,354 INFO L93 Difference]: Finished difference Result 1748 states and 3443 transitions. [2022-11-03 01:54:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 01:54:28,355 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 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 45 [2022-11-03 01:54:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:28,372 INFO L225 Difference]: With dead ends: 1748 [2022-11-03 01:54:28,372 INFO L226 Difference]: Without dead ends: 1746 [2022-11-03 01:54:28,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=279, Invalid=1052, Unknown=13, NotChecked=216, Total=1560 [2022-11-03 01:54:28,374 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 403 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:28,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 242 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1185 Invalid, 0 Unknown, 315 Unchecked, 1.1s Time] [2022-11-03 01:54:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2022-11-03 01:54:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 653. [2022-11-03 01:54:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 646 states have (on average 1.958204334365325) internal successors, (1265), 652 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1265 transitions. [2022-11-03 01:54:28,397 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1265 transitions. Word has length 45 [2022-11-03 01:54:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:28,397 INFO L495 AbstractCegarLoop]: Abstraction has 653 states and 1265 transitions. [2022-11-03 01:54:28,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1265 transitions. [2022-11-03 01:54:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:54:28,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:28,399 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:28,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:28,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 01:54:28,626 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:54:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1973796007, now seen corresponding path program 4 times [2022-11-03 01:54:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:28,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088298171] [2022-11-03 01:54:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:54:29,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:29,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088298171] [2022-11-03 01:54:29,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088298171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:29,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472817220] [2022-11-03 01:54:29,355 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:54:29,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:29,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:29,356 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:29,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 01:54:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:29,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:54:29,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:29,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:54:29,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:54:29,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:54:29,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 01:54:30,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:30,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:30,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:30,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:30,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 01:54:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:54:30,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:46,476 WARN L234 SmtUtils]: Spent 7.96s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:54:48,440 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse2 (select .cse1 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (forall ((v_ArrVal_1454 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (forall ((v_ArrVal_1454 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (forall ((v_ArrVal_1454 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (forall ((v_ArrVal_1454 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))))))) is different from false [2022-11-03 01:54:50,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|))))))) is different from false [2022-11-03 01:55:12,472 WARN L234 SmtUtils]: Spent 12.85s on a formula simplification. DAG size of input: 40 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:55:14,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))))) is different from false [2022-11-03 01:55:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2022-11-03 01:55:18,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472817220] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:18,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1434004840] [2022-11-03 01:55:18,671 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:55:18,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:18,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 01:55:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418783715] [2022-11-03 01:55:18,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:18,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:55:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:55:18,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=601, Unknown=12, NotChecked=162, Total=930 [2022-11-03 01:55:18,674 INFO L87 Difference]: Start difference. First operand 653 states and 1265 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:19,827 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store .cse4 .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 01:55:21,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (= |c_~#cache~0.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 .cse2)) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (forall ((v_ArrVal_1454 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 .cse5)))))) is different from false [2022-11-03 01:55:22,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (forall ((v_ArrVal_1454 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))))) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse5)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (forall ((v_ArrVal_1454 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (forall ((v_ArrVal_1454 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|) (forall ((v_ArrVal_1454 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| v_ArrVal_1454)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse6)))))) is different from false [2022-11-03 01:55:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:23,072 INFO L93 Difference]: Finished difference Result 2274 states and 4505 transitions. [2022-11-03 01:55:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:55:23,072 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 45 [2022-11-03 01:55:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:23,089 INFO L225 Difference]: With dead ends: 2274 [2022-11-03 01:55:23,089 INFO L226 Difference]: Without dead ends: 2274 [2022-11-03 01:55:23,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=244, Invalid=887, Unknown=15, NotChecked=414, Total=1560 [2022-11-03 01:55:23,091 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 354 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 734 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:23,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 291 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 549 Invalid, 0 Unknown, 734 Unchecked, 0.5s Time] [2022-11-03 01:55:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-11-03 01:55:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 653. [2022-11-03 01:55:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 646 states have (on average 1.958204334365325) internal successors, (1265), 652 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1265 transitions. [2022-11-03 01:55:23,124 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1265 transitions. Word has length 45 [2022-11-03 01:55:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:23,124 INFO L495 AbstractCegarLoop]: Abstraction has 653 states and 1265 transitions. [2022-11-03 01:55:23,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1265 transitions. [2022-11-03 01:55:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:55:23,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:23,126 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:23,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:23,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 01:55:23,350 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:55:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:23,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1377065149, now seen corresponding path program 5 times [2022-11-03 01:55:23,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:23,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984224360] [2022-11-03 01:55:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:55:24,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:24,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984224360] [2022-11-03 01:55:24,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984224360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:24,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481972683] [2022-11-03 01:55:24,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:55:24,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:24,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:24,097 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:24,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 01:55:24,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:55:24,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:55:24,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:55:24,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:24,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:55:24,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:24,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:24,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:55:24,749 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:55:24,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 01:55:24,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 01:55:24,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:24,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:24,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:24,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:24,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-03 01:55:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:55:25,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:26,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 01:55:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:55:26,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481972683] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:26,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:55:26,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2022-11-03 01:55:26,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386378217] [2022-11-03 01:55:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:26,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:55:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:26,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:55:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:55:26,288 INFO L87 Difference]: Start difference. First operand 653 states and 1265 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:26,623 INFO L93 Difference]: Finished difference Result 923 states and 1797 transitions. [2022-11-03 01:55:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:55:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 45 [2022-11-03 01:55:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:26,627 INFO L225 Difference]: With dead ends: 923 [2022-11-03 01:55:26,628 INFO L226 Difference]: Without dead ends: 923 [2022-11-03 01:55:26,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-11-03 01:55:26,629 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:26,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 65 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 265 Unchecked, 0.2s Time] [2022-11-03 01:55:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-11-03 01:55:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 656. [2022-11-03 01:55:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 649 states have (on average 1.958397534668721) internal successors, (1271), 655 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1271 transitions. [2022-11-03 01:55:26,648 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1271 transitions. Word has length 45 [2022-11-03 01:55:26,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:26,649 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1271 transitions. [2022-11-03 01:55:26,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1271 transitions. [2022-11-03 01:55:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:55:26,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:26,650 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:26,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:26,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:55:26,870 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:55:26,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:26,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1376379739, now seen corresponding path program 6 times [2022-11-03 01:55:26,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:26,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790065234] [2022-11-03 01:55:26,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:26,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:55:27,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:27,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790065234] [2022-11-03 01:55:27,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790065234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:27,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962446452] [2022-11-03 01:55:27,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:55:27,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:27,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:27,606 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:27,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 01:55:28,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:55:28,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:55:28,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:55:28,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:28,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:28,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:28,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:55:28,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:28,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:28,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:28,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 42 [2022-11-03 01:55:28,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:28,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 01:55:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:55:28,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:53,334 WARN L234 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:56:16,972 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349| Int) (v_ArrVal_1757 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349| v_ArrVal_1757)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349| Int) (v_ArrVal_1757 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349| v_ArrVal_1757)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))))))) is different from false [2022-11-03 01:56:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-11-03 01:56:22,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962446452] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:22,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [594046513] [2022-11-03 01:56:22,682 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:56:22,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:22,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-03 01:56:22,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638077916] [2022-11-03 01:56:22,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:22,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:56:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:22,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:56:22,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=652, Unknown=23, NotChecked=54, Total=870 [2022-11-03 01:56:22,686 INFO L87 Difference]: Start difference. First operand 656 states and 1271 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:23,681 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse3 .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349| Int) (v_ArrVal_1757 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349| v_ArrVal_1757)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349| Int) (v_ArrVal_1757 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_349| v_ArrVal_1757)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 01:56:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:24,641 INFO L93 Difference]: Finished difference Result 1660 states and 3270 transitions. [2022-11-03 01:56:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 01:56:24,642 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 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 45 [2022-11-03 01:56:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:24,646 INFO L225 Difference]: With dead ends: 1660 [2022-11-03 01:56:24,647 INFO L226 Difference]: Without dead ends: 1660 [2022-11-03 01:56:24,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=354, Invalid=1190, Unknown=24, NotChecked=154, Total=1722 [2022-11-03 01:56:24,648 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 378 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 818 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:24,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 307 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1015 Invalid, 0 Unknown, 818 Unchecked, 0.8s Time] [2022-11-03 01:56:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2022-11-03 01:56:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 658. [2022-11-03 01:56:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 651 states have (on average 1.9585253456221199) internal successors, (1275), 657 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1275 transitions. [2022-11-03 01:56:24,672 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1275 transitions. Word has length 45 [2022-11-03 01:56:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:24,672 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1275 transitions. [2022-11-03 01:56:24,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1275 transitions. [2022-11-03 01:56:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:56:24,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:24,674 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:24,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:24,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:24,897 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:56:24,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1931772395, now seen corresponding path program 7 times [2022-11-03 01:56:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:24,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770038893] [2022-11-03 01:56:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:56:25,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:25,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770038893] [2022-11-03 01:56:25,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770038893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:25,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061205651] [2022-11-03 01:56:25,632 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:56:25,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:25,634 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:25,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 01:56:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:25,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:56:25,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:26,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:26,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:26,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:56:26,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 01:56:26,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 01:56:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:56:26,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:52,751 WARN L234 SmtUtils]: Spent 13.88s on a formula simplification. DAG size of input: 48 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:57:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:57:28,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061205651] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:28,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1624883853] [2022-11-03 01:57:28,682 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:57:28,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:28,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 01:57:28,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640960536] [2022-11-03 01:57:28,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:28,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:57:28,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:28,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:57:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=766, Unknown=19, NotChecked=0, Total=930 [2022-11-03 01:57:28,688 INFO L87 Difference]: Start difference. First operand 658 states and 1275 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:30,396 INFO L93 Difference]: Finished difference Result 1280 states and 2512 transitions. [2022-11-03 01:57:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:57:30,397 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 45 [2022-11-03 01:57:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:30,401 INFO L225 Difference]: With dead ends: 1280 [2022-11-03 01:57:30,401 INFO L226 Difference]: Without dead ends: 1277 [2022-11-03 01:57:30,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 63.0s TimeCoverageRelationStatistics Valid=416, Invalid=1371, Unknown=19, NotChecked=0, Total=1806 [2022-11-03 01:57:30,402 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 330 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 569 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:30,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 235 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1391 Invalid, 0 Unknown, 569 Unchecked, 1.2s Time] [2022-11-03 01:57:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2022-11-03 01:57:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 694. [2022-11-03 01:57:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 687 states have (on average 1.9636098981077148) internal successors, (1349), 693 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1349 transitions. [2022-11-03 01:57:30,424 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1349 transitions. Word has length 45 [2022-11-03 01:57:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:30,425 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 1349 transitions. [2022-11-03 01:57:30,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1349 transitions. [2022-11-03 01:57:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:57:30,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:30,426 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:30,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:30,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:30,642 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:57:30,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash 506795851, now seen corresponding path program 8 times [2022-11-03 01:57:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:30,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136815928] [2022-11-03 01:57:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:57:31,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:31,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136815928] [2022-11-03 01:57:31,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136815928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:31,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264504759] [2022-11-03 01:57:31,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:57:31,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:31,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:31,320 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:31,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 01:57:31,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:57:31,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:57:31,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:57:31,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:31,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:57:31,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:31,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:31,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:57:31,967 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:31,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 01:57:32,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 01:57:32,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:32,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:32,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:32,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:32,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-03 01:57:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:57:32,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:33,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 01:57:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:57:33,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264504759] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:33,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:57:33,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2022-11-03 01:57:33,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367704443] [2022-11-03 01:57:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:33,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:57:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:33,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:57:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:57:33,498 INFO L87 Difference]: Start difference. First operand 694 states and 1349 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:33,786 INFO L93 Difference]: Finished difference Result 921 states and 1798 transitions. [2022-11-03 01:57:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:57:33,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 45 [2022-11-03 01:57:33,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:33,793 INFO L225 Difference]: With dead ends: 921 [2022-11-03 01:57:33,793 INFO L226 Difference]: Without dead ends: 921 [2022-11-03 01:57:33,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-11-03 01:57:33,794 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:33,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 56 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 217 Unchecked, 0.1s Time] [2022-11-03 01:57:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-11-03 01:57:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 698. [2022-11-03 01:57:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 691 states have (on average 1.963820549927641) internal successors, (1357), 697 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1357 transitions. [2022-11-03 01:57:33,813 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1357 transitions. Word has length 45 [2022-11-03 01:57:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:33,815 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1357 transitions. [2022-11-03 01:57:33,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1357 transitions. [2022-11-03 01:57:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:57:33,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:33,816 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:33,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:34,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:34,041 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:57:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash 507481261, now seen corresponding path program 9 times [2022-11-03 01:57:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:34,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728840408] [2022-11-03 01:57:34,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:34,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:57:34,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:34,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728840408] [2022-11-03 01:57:34,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728840408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:34,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368147815] [2022-11-03 01:57:34,689 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:57:34,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:34,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:34,690 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:34,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 01:57:35,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:57:35,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:57:35,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:57:35,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:35,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:35,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:35,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:57:35,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 42 [2022-11-03 01:57:35,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:35,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 01:57:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:57:35,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:43,024 WARN L234 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:57:56,797 WARN L234 SmtUtils]: Spent 8.78s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:57:58,712 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int)) (or (forall ((v_ArrVal_2216 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_2216)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int)) (or (forall ((v_ArrVal_2216 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_2216)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|))))))) is different from false [2022-11-03 01:57:59,650 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int) (v_ArrVal_2216 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_2216)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int) (v_ArrVal_2216 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_2216)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))))))) is different from false [2022-11-03 01:58:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-11-03 01:58:03,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368147815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:03,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1553657384] [2022-11-03 01:58:03,278 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:58:03,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:03,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-03 01:58:03,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749859622] [2022-11-03 01:58:03,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:03,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:58:03,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:03,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:58:03,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=8, NotChecked=106, Total=870 [2022-11-03 01:58:03,281 INFO L87 Difference]: Start difference. First operand 698 states and 1357 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:04,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse3 .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int) (v_ArrVal_2216 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_2216)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int) (v_ArrVal_2216 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_2216)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 01:58:05,182 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse3 .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int)) (or (forall ((v_ArrVal_2216 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_2216)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int)) (or (forall ((v_ArrVal_2216 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_2216)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|))) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 01:58:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:05,902 INFO L93 Difference]: Finished difference Result 2358 states and 4675 transitions. [2022-11-03 01:58:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:58:05,902 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 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 45 [2022-11-03 01:58:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:05,907 INFO L225 Difference]: With dead ends: 2358 [2022-11-03 01:58:05,907 INFO L226 Difference]: Without dead ends: 2356 [2022-11-03 01:58:05,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=288, Invalid=1124, Unknown=10, NotChecked=300, Total=1722 [2022-11-03 01:58:05,908 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 351 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:05,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 290 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 706 Invalid, 0 Unknown, 485 Unchecked, 0.6s Time] [2022-11-03 01:58:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-11-03 01:58:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 698. [2022-11-03 01:58:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 691 states have (on average 1.963820549927641) internal successors, (1357), 697 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1357 transitions. [2022-11-03 01:58:05,936 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1357 transitions. Word has length 45 [2022-11-03 01:58:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:05,937 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1357 transitions. [2022-11-03 01:58:05,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1357 transitions. [2022-11-03 01:58:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:58:05,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:05,938 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:05,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:06,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:06,153 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:58:06,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:06,154 INFO L85 PathProgramCache]: Analyzing trace with hash -47911395, now seen corresponding path program 10 times [2022-11-03 01:58:06,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:06,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099837104] [2022-11-03 01:58:06,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:06,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:58:06,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:06,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099837104] [2022-11-03 01:58:06,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099837104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:06,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869623208] [2022-11-03 01:58:06,831 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:58:06,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:06,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:06,833 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:06,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 01:58:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:07,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:58:07,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:07,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:07,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:07,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:58:07,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 01:58:07,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:07,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:07,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:07,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:07,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 01:58:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:58:07,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:22,871 WARN L234 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 48 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:58:24,746 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| Int)) (or (forall ((v_ArrVal_2369 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| v_ArrVal_2369)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| Int)) (or (forall ((v_ArrVal_2369 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| v_ArrVal_2369)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|))))))) is different from false [2022-11-03 01:58:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-11-03 01:58:47,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869623208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:47,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1490603065] [2022-11-03 01:58:47,569 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:58:47,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:47,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 01:58:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713029541] [2022-11-03 01:58:47,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:47,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:58:47,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:47,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:58:47,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=722, Unknown=14, NotChecked=56, Total=930 [2022-11-03 01:58:47,573 INFO L87 Difference]: Start difference. First operand 698 states and 1357 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:48,709 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store .cse3 .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| Int)) (or (forall ((v_ArrVal_2369 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| v_ArrVal_2369)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| Int)) (or (forall ((v_ArrVal_2369 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| v_ArrVal_2369)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 01:58:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:49,501 INFO L93 Difference]: Finished difference Result 1926 states and 3803 transitions. [2022-11-03 01:58:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:58:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 45 [2022-11-03 01:58:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:49,506 INFO L225 Difference]: With dead ends: 1926 [2022-11-03 01:58:49,506 INFO L226 Difference]: Without dead ends: 1923 [2022-11-03 01:58:49,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=293, Invalid=1260, Unknown=15, NotChecked=154, Total=1722 [2022-11-03 01:58:49,507 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 385 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 877 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:49,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 287 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 797 Invalid, 0 Unknown, 877 Unchecked, 0.7s Time] [2022-11-03 01:58:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2022-11-03 01:58:49,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 698. [2022-11-03 01:58:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 691 states have (on average 1.963820549927641) internal successors, (1357), 697 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1357 transitions. [2022-11-03 01:58:49,532 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1357 transitions. Word has length 45 [2022-11-03 01:58:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:49,532 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1357 transitions. [2022-11-03 01:58:49,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1357 transitions. [2022-11-03 01:58:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:58:49,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:49,534 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:49,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:49,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 01:58:49,760 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:58:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1646646471, now seen corresponding path program 11 times [2022-11-03 01:58:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:49,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565043096] [2022-11-03 01:58:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:58:50,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:50,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565043096] [2022-11-03 01:58:50,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565043096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:50,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785205415] [2022-11-03 01:58:50,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:58:50,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:50,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:50,472 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:50,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 01:58:50,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:58:50,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:58:50,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:58:50,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:50,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:50,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:50,993 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:58:50,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 01:58:51,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:51,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:58:51,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 01:58:51,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:51,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:51,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:51,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:51,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-03 01:58:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:58:51,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:52,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 01:58:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:58:52,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785205415] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:52,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:58:52,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2022-11-03 01:58:52,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175087040] [2022-11-03 01:58:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:52,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:58:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:52,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:58:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:58:52,666 INFO L87 Difference]: Start difference. First operand 698 states and 1357 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:53,402 INFO L93 Difference]: Finished difference Result 920 states and 1800 transitions. [2022-11-03 01:58:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:58:53,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 45 [2022-11-03 01:58:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:53,404 INFO L225 Difference]: With dead ends: 920 [2022-11-03 01:58:53,404 INFO L226 Difference]: Without dead ends: 920 [2022-11-03 01:58:53,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:58:53,405 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:53,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 49 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 417 Unchecked, 0.1s Time] [2022-11-03 01:58:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-11-03 01:58:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 704. [2022-11-03 01:58:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 697 states have (on average 1.964131994261119) internal successors, (1369), 703 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1369 transitions. [2022-11-03 01:58:53,422 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1369 transitions. Word has length 45 [2022-11-03 01:58:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:53,423 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 1369 transitions. [2022-11-03 01:58:53,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1369 transitions. [2022-11-03 01:58:53,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:58:53,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:53,424 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:53,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:53,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 01:58:53,637 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:58:53,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:53,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1647331881, now seen corresponding path program 12 times [2022-11-03 01:58:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:53,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245781800] [2022-11-03 01:58:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:58:54,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:54,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245781800] [2022-11-03 01:58:54,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245781800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:54,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393645005] [2022-11-03 01:58:54,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:58:54,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:54,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:54,278 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:54,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 01:58:54,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:58:54,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:58:54,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 01:58:54,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:54,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:55,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:55,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:58:55,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:55,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:55,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:55,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 42 [2022-11-03 01:58:55,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 01:58:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:58:55,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:58:56,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393645005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:56,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [449569345] [2022-11-03 01:58:56,112 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:58:56,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:56,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-03 01:58:56,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617213143] [2022-11-03 01:58:56,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:56,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:58:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:56,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:58:56,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:58:56,116 INFO L87 Difference]: Start difference. First operand 704 states and 1369 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:57,768 INFO L93 Difference]: Finished difference Result 1351 states and 2654 transitions. [2022-11-03 01:58:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 01:58:57,769 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 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 45 [2022-11-03 01:58:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:57,772 INFO L225 Difference]: With dead ends: 1351 [2022-11-03 01:58:57,772 INFO L226 Difference]: Without dead ends: 1347 [2022-11-03 01:58:57,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2022-11-03 01:58:57,773 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 307 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:57,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 238 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1265 Invalid, 0 Unknown, 345 Unchecked, 1.1s Time] [2022-11-03 01:58:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2022-11-03 01:58:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 741. [2022-11-03 01:58:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 734 states have (on average 1.9700272479564032) internal successors, (1446), 740 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1446 transitions. [2022-11-03 01:58:57,793 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1446 transitions. Word has length 45 [2022-11-03 01:58:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:57,794 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 1446 transitions. [2022-11-03 01:58:57,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1446 transitions. [2022-11-03 01:58:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:58:57,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:57,795 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:57,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:58,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 01:58:58,022 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:58:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash -341330107, now seen corresponding path program 13 times [2022-11-03 01:58:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:58,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269600526] [2022-11-03 01:58:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:58:58,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:58,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269600526] [2022-11-03 01:58:58,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269600526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:58,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502748092] [2022-11-03 01:58:58,671 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:58:58,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:58,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:58,672 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:58,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 01:58:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:58,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:58:58,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:59,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:59,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:59,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:58:59,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 01:58:59,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:59,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:59,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:59,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:59,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 01:58:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:58:59,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:01,693 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (forall ((v_ArrVal_2827 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| v_ArrVal_2827)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) (forall ((v_ArrVal_2827 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| v_ArrVal_2827)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) (forall ((v_ArrVal_2827 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| v_ArrVal_2827)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) (forall ((v_ArrVal_2827 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| v_ArrVal_2827)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))))))))) is different from false [2022-11-03 01:59:19,789 WARN L234 SmtUtils]: Spent 11.85s on a formula simplification. DAG size of input: 48 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:59:36,435 WARN L234 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:59:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:59:43,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502748092] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:59:43,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1197300586] [2022-11-03 01:59:43,547 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 01:59:43,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:59:43,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 01:59:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385217310] [2022-11-03 01:59:43,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:59:43,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:59:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:43,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:59:43,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=718, Unknown=13, NotChecked=56, Total=930 [2022-11-03 01:59:43,551 INFO L87 Difference]: Start difference. First operand 741 states and 1446 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:45,685 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (forall ((v_ArrVal_2827 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| v_ArrVal_2827)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) (forall ((v_ArrVal_2827 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| v_ArrVal_2827)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse3)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) (forall ((v_ArrVal_2827 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| v_ArrVal_2827)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) (forall ((v_ArrVal_2827 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| v_ArrVal_2827)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse5)))))) is different from false [2022-11-03 01:59:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:46,041 INFO L93 Difference]: Finished difference Result 2279 states and 4507 transitions. [2022-11-03 01:59:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:59:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 45 [2022-11-03 01:59:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:46,047 INFO L225 Difference]: With dead ends: 2279 [2022-11-03 01:59:46,047 INFO L226 Difference]: Without dead ends: 2279 [2022-11-03 01:59:46,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=215, Invalid=969, Unknown=14, NotChecked=134, Total=1332 [2022-11-03 01:59:46,049 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 380 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:46,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 351 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1024 Invalid, 0 Unknown, 481 Unchecked, 0.7s Time] [2022-11-03 01:59:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2022-11-03 01:59:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 757. [2022-11-03 01:59:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 750 states have (on average 1.9706666666666666) internal successors, (1478), 756 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1478 transitions. [2022-11-03 01:59:46,075 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1478 transitions. Word has length 45 [2022-11-03 01:59:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:46,076 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 1478 transitions. [2022-11-03 01:59:46,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1478 transitions. [2022-11-03 01:59:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:59:46,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:46,077 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:46,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 01:59:46,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:46,297 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:59:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash -340644697, now seen corresponding path program 14 times [2022-11-03 01:59:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:46,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386235861] [2022-11-03 01:59:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:59:46,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:46,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386235861] [2022-11-03 01:59:46,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386235861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:46,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142505] [2022-11-03 01:59:46,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:59:46,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:46,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:59:46,913 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:59:46,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 01:59:47,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:59:47,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:59:47,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 01:59:47,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:47,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:59:47,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:47,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:59:47,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:59:47,601 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:59:47,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 01:59:47,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:47,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:47,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 42 [2022-11-03 01:59:47,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 01:59:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:59:47,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:48,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 01:59:48,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-03 01:59:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 01:59:48,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142505] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:48,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:59:48,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 26 [2022-11-03 01:59:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080368692] [2022-11-03 01:59:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:48,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:59:48,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:48,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:59:48,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2022-11-03 01:59:48,553 INFO L87 Difference]: Start difference. First operand 757 states and 1478 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:49,242 INFO L93 Difference]: Finished difference Result 1159 states and 2269 transitions. [2022-11-03 01:59:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:59:49,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 45 [2022-11-03 01:59:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:49,245 INFO L225 Difference]: With dead ends: 1159 [2022-11-03 01:59:49,245 INFO L226 Difference]: Without dead ends: 1159 [2022-11-03 01:59:49,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2022-11-03 01:59:49,246 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 65 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:49,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 88 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 133 Unchecked, 0.3s Time] [2022-11-03 01:59:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-11-03 01:59:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 768. [2022-11-03 01:59:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 761 states have (on average 1.971090670170828) internal successors, (1500), 767 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1500 transitions. [2022-11-03 01:59:49,265 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1500 transitions. Word has length 45 [2022-11-03 01:59:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:49,266 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1500 transitions. [2022-11-03 01:59:49,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1500 transitions. [2022-11-03 01:59:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:59:49,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:49,267 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:49,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-03 01:59:49,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 01:59:49,493 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 01:59:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash -441427867, now seen corresponding path program 15 times [2022-11-03 01:59:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:49,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964067814] [2022-11-03 01:59:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:59:50,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:50,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964067814] [2022-11-03 01:59:50,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964067814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:50,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938926122] [2022-11-03 01:59:50,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:59:50,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:50,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:59:50,130 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:59:50,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 01:59:50,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:59:50,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:59:50,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:59:50,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:50,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:50,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:59:50,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:59:50,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 01:59:51,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 01:59:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 01:59:51,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:53,304 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| Int)) (or (forall ((v_ArrVal_3134 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| v_ArrVal_3134)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| Int)) (or (forall ((v_ArrVal_3134 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| v_ArrVal_3134)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| Int)) (or (forall ((v_ArrVal_3134 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| v_ArrVal_3134)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| Int)) (or (forall ((v_ArrVal_3134 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| v_ArrVal_3134)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358|))))) is different from false [2022-11-03 02:00:11,543 WARN L234 SmtUtils]: Spent 16.08s on a formula simplification. DAG size of input: 47 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:00:32,838 WARN L234 SmtUtils]: Spent 13.12s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:00:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:00:57,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938926122] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:00:57,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [81760249] [2022-11-03 02:00:57,980 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:00:57,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:00:57,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 02:00:57,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268471256] [2022-11-03 02:00:57,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:00:57,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 02:00:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:00:57,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 02:00:57,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=695, Unknown=15, NotChecked=56, Total=930 [2022-11-03 02:00:57,982 INFO L87 Difference]: Start difference. First operand 768 states and 1500 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:00,311 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse3 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| Int)) (or (forall ((v_ArrVal_3134 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| v_ArrVal_3134)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| Int)) (or (forall ((v_ArrVal_3134 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| v_ArrVal_3134)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358|))) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 .cse4)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 .cse2)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| Int)) (or (forall ((v_ArrVal_3134 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| v_ArrVal_3134)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| Int)) (or (forall ((v_ArrVal_3134 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358| v_ArrVal_3134)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_358|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse3 .cse5)))) is different from false [2022-11-03 02:01:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:00,778 INFO L93 Difference]: Finished difference Result 2280 states and 4510 transitions. [2022-11-03 02:01:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:01:00,778 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 45 [2022-11-03 02:01:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:00,784 INFO L225 Difference]: With dead ends: 2280 [2022-11-03 02:01:00,784 INFO L226 Difference]: Without dead ends: 2280 [2022-11-03 02:01:00,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 68.8s TimeCoverageRelationStatistics Valid=262, Invalid=990, Unknown=16, NotChecked=138, Total=1406 [2022-11-03 02:01:00,785 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 379 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 964 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:00,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 392 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1348 Invalid, 0 Unknown, 964 Unchecked, 1.0s Time] [2022-11-03 02:01:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2022-11-03 02:01:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 769. [2022-11-03 02:01:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 762 states have (on average 1.9711286089238844) internal successors, (1502), 768 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1502 transitions. [2022-11-03 02:01:00,811 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1502 transitions. Word has length 45 [2022-11-03 02:01:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:00,812 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 1502 transitions. [2022-11-03 02:01:00,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1502 transitions. [2022-11-03 02:01:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:01:00,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:00,814 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:00,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-03 02:01:01,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 02:01:01,037 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:01:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash -896037353, now seen corresponding path program 16 times [2022-11-03 02:01:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:01,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560276760] [2022-11-03 02:01:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:01:01,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:01,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560276760] [2022-11-03 02:01:01,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560276760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:01,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763150049] [2022-11-03 02:01:01,607 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:01:01,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:01,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:01,613 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:01,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 02:01:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:01,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:01:01,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:02,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:02,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:02,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:01:02,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:01:02,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:02,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:02,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:02,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:02,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:01:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:01:02,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:22,692 WARN L234 SmtUtils]: Spent 11.58s on a formula simplification. DAG size of input: 48 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:01:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:01:48,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763150049] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:48,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690395185] [2022-11-03 02:01:48,138 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:01:48,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:48,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 02:01:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991605349] [2022-11-03 02:01:48,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:48,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 02:01:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 02:01:48,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=777, Unknown=13, NotChecked=0, Total=930 [2022-11-03 02:01:48,141 INFO L87 Difference]: Start difference. First operand 769 states and 1502 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:49,205 INFO L93 Difference]: Finished difference Result 1769 states and 3491 transitions. [2022-11-03 02:01:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:01:49,205 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 45 [2022-11-03 02:01:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:49,209 INFO L225 Difference]: With dead ends: 1769 [2022-11-03 02:01:49,209 INFO L226 Difference]: Without dead ends: 1768 [2022-11-03 02:01:49,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 46.4s TimeCoverageRelationStatistics Valid=340, Invalid=1287, Unknown=13, NotChecked=0, Total=1640 [2022-11-03 02:01:49,210 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 388 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:49,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 258 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 754 Invalid, 0 Unknown, 389 Unchecked, 0.6s Time] [2022-11-03 02:01:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2022-11-03 02:01:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 787. [2022-11-03 02:01:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 780 states have (on average 1.971794871794872) internal successors, (1538), 786 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1538 transitions. [2022-11-03 02:01:49,233 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1538 transitions. Word has length 45 [2022-11-03 02:01:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:49,233 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1538 transitions. [2022-11-03 02:01:49,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1538 transitions. [2022-11-03 02:01:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:01:49,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:49,235 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:49,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:49,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 02:01:49,449 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:01:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash -895351943, now seen corresponding path program 17 times [2022-11-03 02:01:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:49,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97479488] [2022-11-03 02:01:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:01:49,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:49,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97479488] [2022-11-03 02:01:49,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97479488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:49,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243098780] [2022-11-03 02:01:49,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:01:49,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:49,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:49,987 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:50,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 02:01:50,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:01:50,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:01:50,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:01:50,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:50,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:01:50,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:50,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:50,710 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:01:50,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 02:01:50,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:01:50,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:50,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:50,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 42 [2022-11-03 02:01:50,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 02:01:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:01:50,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:51,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 02:01:51,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-03 02:01:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:01:51,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243098780] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:51,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:01:51,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 26 [2022-11-03 02:01:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296212471] [2022-11-03 02:01:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:51,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:01:51,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:51,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:01:51,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:01:51,734 INFO L87 Difference]: Start difference. First operand 787 states and 1538 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:52,611 INFO L93 Difference]: Finished difference Result 1176 states and 2301 transitions. [2022-11-03 02:01:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:01:52,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 45 [2022-11-03 02:01:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:52,613 INFO L225 Difference]: With dead ends: 1176 [2022-11-03 02:01:52,613 INFO L226 Difference]: Without dead ends: 1176 [2022-11-03 02:01:52,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 02:01:52,615 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:52,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 46 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 211 Unchecked, 0.2s Time] [2022-11-03 02:01:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2022-11-03 02:01:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 793. [2022-11-03 02:01:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 786 states have (on average 1.9720101781170483) internal successors, (1550), 792 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1550 transitions. [2022-11-03 02:01:52,632 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1550 transitions. Word has length 45 [2022-11-03 02:01:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:52,633 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1550 transitions. [2022-11-03 02:01:52,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1550 transitions. [2022-11-03 02:01:52,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:01:52,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:52,635 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:52,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:52,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:52,849 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:01:52,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:52,850 INFO L85 PathProgramCache]: Analyzing trace with hash -852885353, now seen corresponding path program 18 times [2022-11-03 02:01:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:52,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886711360] [2022-11-03 02:01:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:01:53,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:53,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886711360] [2022-11-03 02:01:53,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886711360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:53,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916038278] [2022-11-03 02:01:53,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:01:53,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:53,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:53,310 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:53,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 02:01:53,747 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:01:53,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:01:53,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 02:01:53,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:54,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:54,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:54,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:54,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:54,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:01:54,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:01:54,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:01:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:01:54,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:01:54,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916038278] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:54,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1421131761] [2022-11-03 02:01:54,766 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:01:54,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:54,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-11-03 02:01:54,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390865692] [2022-11-03 02:01:54,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:54,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 02:01:54,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 02:01:54,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2022-11-03 02:01:54,769 INFO L87 Difference]: Start difference. First operand 793 states and 1550 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:56,273 INFO L93 Difference]: Finished difference Result 1766 states and 3486 transitions. [2022-11-03 02:01:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:01:56,273 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-03 02:01:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:56,276 INFO L225 Difference]: With dead ends: 1766 [2022-11-03 02:01:56,276 INFO L226 Difference]: Without dead ends: 1766 [2022-11-03 02:01:56,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=420, Invalid=1302, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 02:01:56,277 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 382 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:56,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 258 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1263 Invalid, 0 Unknown, 235 Unchecked, 1.0s Time] [2022-11-03 02:01:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2022-11-03 02:01:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 793. [2022-11-03 02:01:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 786 states have (on average 1.9720101781170483) internal successors, (1550), 792 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1550 transitions. [2022-11-03 02:01:56,298 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1550 transitions. Word has length 45 [2022-11-03 02:01:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:56,298 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1550 transitions. [2022-11-03 02:01:56,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1550 transitions. [2022-11-03 02:01:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:01:56,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:56,300 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:56,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-03 02:01:56,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:56,513 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:01:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash -854240363, now seen corresponding path program 19 times [2022-11-03 02:01:56,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:56,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958430974] [2022-11-03 02:01:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:56,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:01:57,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:57,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958430974] [2022-11-03 02:01:57,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958430974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:57,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700487877] [2022-11-03 02:01:57,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:01:57,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:57,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:57,098 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:57,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 02:01:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:57,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:01:57,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:57,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:57,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:57,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:01:57,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:57,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:57,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:57,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 42 [2022-11-03 02:01:57,875 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:01:57,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 02:01:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:01:57,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:02:15,520 WARN L234 SmtUtils]: Spent 9.43s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:02:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:33,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700487877] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:02:33,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [132378504] [2022-11-03 02:02:33,644 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:02:33,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:02:33,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-03 02:02:33,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102540357] [2022-11-03 02:02:33,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:02:33,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 02:02:33,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:33,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 02:02:33,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=733, Unknown=10, NotChecked=0, Total=870 [2022-11-03 02:02:33,654 INFO L87 Difference]: Start difference. First operand 793 states and 1550 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:35,793 INFO L93 Difference]: Finished difference Result 1832 states and 3617 transitions. [2022-11-03 02:02:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 02:02:35,794 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 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 45 [2022-11-03 02:02:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:35,796 INFO L225 Difference]: With dead ends: 1832 [2022-11-03 02:02:35,796 INFO L226 Difference]: Without dead ends: 1829 [2022-11-03 02:02:35,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=447, Invalid=1523, Unknown=10, NotChecked=0, Total=1980 [2022-11-03 02:02:35,797 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 369 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:35,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 333 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1615 Invalid, 0 Unknown, 650 Unchecked, 1.5s Time] [2022-11-03 02:02:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2022-11-03 02:02:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 768. [2022-11-03 02:02:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 761 states have (on average 1.971090670170828) internal successors, (1500), 767 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1500 transitions. [2022-11-03 02:02:35,814 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1500 transitions. Word has length 45 [2022-11-03 02:02:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:35,814 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1500 transitions. [2022-11-03 02:02:35,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1500 transitions. [2022-11-03 02:02:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:02:35,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:35,816 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:35,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 02:02:36,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:36,035 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:02:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash 798520513, now seen corresponding path program 20 times [2022-11-03 02:02:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:36,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036315553] [2022-11-03 02:02:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:36,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:36,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036315553] [2022-11-03 02:02:36,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036315553] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:36,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497776774] [2022-11-03 02:02:36,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:02:36,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:36,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:02:36,566 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:02:36,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 02:02:36,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:02:36,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:02:36,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 02:02:36,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:02:36,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:02:37,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:02:37,083 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:02:37,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 02:02:37,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:02:37,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:02:37,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 02:02:37,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:37,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:37,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:37,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:37,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-03 02:02:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:02:37,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:02:38,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 02:02:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:02:38,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497776774] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:38,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:02:38,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2022-11-03 02:02:38,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762138530] [2022-11-03 02:02:38,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:38,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:02:38,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:38,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:02:38,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:02:38,650 INFO L87 Difference]: Start difference. First operand 768 states and 1500 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:39,407 INFO L93 Difference]: Finished difference Result 1162 states and 2287 transitions. [2022-11-03 02:02:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:02:39,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 45 [2022-11-03 02:02:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:39,410 INFO L225 Difference]: With dead ends: 1162 [2022-11-03 02:02:39,410 INFO L226 Difference]: Without dead ends: 1162 [2022-11-03 02:02:39,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2022-11-03 02:02:39,411 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 69 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:39,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 54 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2022-11-03 02:02:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2022-11-03 02:02:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 771. [2022-11-03 02:02:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 764 states have (on average 1.9712041884816753) internal successors, (1506), 770 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1506 transitions. [2022-11-03 02:02:39,424 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1506 transitions. Word has length 45 [2022-11-03 02:02:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:39,424 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 1506 transitions. [2022-11-03 02:02:39,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1506 transitions. [2022-11-03 02:02:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:02:39,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:39,426 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:39,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-03 02:02:39,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:39,645 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:02:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash 799205923, now seen corresponding path program 21 times [2022-11-03 02:02:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:39,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780780020] [2022-11-03 02:02:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:40,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:40,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780780020] [2022-11-03 02:02:40,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780780020] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:40,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650913006] [2022-11-03 02:02:40,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:02:40,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:40,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:02:40,177 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:02:40,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 02:02:40,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:02:40,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:02:40,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 02:02:40,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:02:40,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:02:41,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:02:41,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:02:41,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:41,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:41,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:41,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 42 [2022-11-03 02:02:41,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:02:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:41,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:02:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:41,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650913006] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:02:41,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [549401299] [2022-11-03 02:02:41,994 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:02:41,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:02:41,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-03 02:02:41,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948606358] [2022-11-03 02:02:41,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:02:41,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 02:02:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:41,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 02:02:41,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2022-11-03 02:02:41,997 INFO L87 Difference]: Start difference. First operand 771 states and 1506 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:43,615 INFO L93 Difference]: Finished difference Result 1885 states and 3723 transitions. [2022-11-03 02:02:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:02:43,616 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 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 45 [2022-11-03 02:02:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:43,618 INFO L225 Difference]: With dead ends: 1885 [2022-11-03 02:02:43,618 INFO L226 Difference]: Without dead ends: 1881 [2022-11-03 02:02:43,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=420, Invalid=1472, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 02:02:43,619 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 411 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:43,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 207 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1040 Invalid, 0 Unknown, 202 Unchecked, 1.0s Time] [2022-11-03 02:02:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2022-11-03 02:02:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 771. [2022-11-03 02:02:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 764 states have (on average 1.9712041884816753) internal successors, (1506), 770 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1506 transitions. [2022-11-03 02:02:43,637 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1506 transitions. Word has length 45 [2022-11-03 02:02:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:43,637 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 1506 transitions. [2022-11-03 02:02:43,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1506 transitions. [2022-11-03 02:02:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:02:43,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:43,639 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:43,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 02:02:43,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:43,853 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:02:43,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash -259560427, now seen corresponding path program 22 times [2022-11-03 02:02:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:43,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183832502] [2022-11-03 02:02:43,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:44,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:44,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183832502] [2022-11-03 02:02:44,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183832502] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:44,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178348371] [2022-11-03 02:02:44,414 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:02:44,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:44,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:02:44,416 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:02:44,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 02:02:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:44,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:02:44,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:02:44,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:02:45,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:02:45,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:02:45,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:02:45,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:45,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:45,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:45,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:45,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:02:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:45,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:02:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:46,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178348371] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:02:46,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910255467] [2022-11-03 02:02:46,173 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:02:46,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:02:46,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 02:02:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184881846] [2022-11-03 02:02:46,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:02:46,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 02:02:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 02:02:46,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2022-11-03 02:02:46,176 INFO L87 Difference]: Start difference. First operand 771 states and 1506 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:48,098 INFO L93 Difference]: Finished difference Result 2183 states and 4315 transitions. [2022-11-03 02:02:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:02:48,098 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 45 [2022-11-03 02:02:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:48,102 INFO L225 Difference]: With dead ends: 2183 [2022-11-03 02:02:48,102 INFO L226 Difference]: Without dead ends: 2179 [2022-11-03 02:02:48,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=463, Invalid=1517, Unknown=0, NotChecked=0, Total=1980 [2022-11-03 02:02:48,103 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 635 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:48,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 201 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1375 Invalid, 0 Unknown, 419 Unchecked, 1.3s Time] [2022-11-03 02:02:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states. [2022-11-03 02:02:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 918. [2022-11-03 02:02:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 911 states have (on average 1.986827661909989) internal successors, (1810), 917 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1810 transitions. [2022-11-03 02:02:48,128 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1810 transitions. Word has length 45 [2022-11-03 02:02:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:48,129 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1810 transitions. [2022-11-03 02:02:48,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1810 transitions. [2022-11-03 02:02:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:02:48,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:48,131 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:48,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-03 02:02:48,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-03 02:02:48,341 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:02:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1909219176, now seen corresponding path program 1 times [2022-11-03 02:02:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:48,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408768801] [2022-11-03 02:02:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:48,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:48,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408768801] [2022-11-03 02:02:48,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408768801] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:48,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548763205] [2022-11-03 02:02:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:48,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:48,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:02:48,759 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:02:48,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-03 02:02:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:49,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:02:49,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:02:49,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:02:49,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:49,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:02:49,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:49,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:49,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:49,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:02:49,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:49,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:49,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:02:49,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:49,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:49,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:49,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:02:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:49,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:02:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:50,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548763205] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:02:50,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1736810670] [2022-11-03 02:02:50,022 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:02:50,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:02:50,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-11-03 02:02:50,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827959399] [2022-11-03 02:02:50,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:02:50,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 02:02:50,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:50,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 02:02:50,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-11-03 02:02:50,025 INFO L87 Difference]: Start difference. First operand 918 states and 1810 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:52,028 INFO L93 Difference]: Finished difference Result 2596 states and 5154 transitions. [2022-11-03 02:02:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 02:02:52,028 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-03 02:02:52,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:52,031 INFO L225 Difference]: With dead ends: 2596 [2022-11-03 02:02:52,031 INFO L226 Difference]: Without dead ends: 2593 [2022-11-03 02:02:52,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=445, Invalid=1625, Unknown=0, NotChecked=0, Total=2070 [2022-11-03 02:02:52,032 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 509 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:52,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 180 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1475 Invalid, 0 Unknown, 118 Unchecked, 1.3s Time] [2022-11-03 02:02:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2022-11-03 02:02:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 1046. [2022-11-03 02:02:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1039 states have (on average 1.9923002887391723) internal successors, (2070), 1045 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 2070 transitions. [2022-11-03 02:02:52,061 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 2070 transitions. Word has length 45 [2022-11-03 02:02:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:52,061 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 2070 transitions. [2022-11-03 02:02:52,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 2070 transitions. [2022-11-03 02:02:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:02:52,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:52,063 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:52,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-03 02:02:52,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-03 02:02:52,277 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:02:52,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:52,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1938712266, now seen corresponding path program 2 times [2022-11-03 02:02:52,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:52,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543778448] [2022-11-03 02:02:52,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:52,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:52,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:52,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543778448] [2022-11-03 02:02:52,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543778448] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:52,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845434186] [2022-11-03 02:02:52,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:02:52,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:52,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:02:52,667 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:02:52,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 02:02:52,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:02:52,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:02:52,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 02:02:52,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:02:53,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:02:53,216 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:02:53,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 02:02:53,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:02:53,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:02:53,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:53,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:02:53,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:53,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:53,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:02:53,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:53,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:53,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:53,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:02:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:02:53,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:02:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:02:53,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845434186] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:53,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:02:53,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 24 [2022-11-03 02:02:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115860235] [2022-11-03 02:02:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:53,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:02:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:02:53,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:02:53,646 INFO L87 Difference]: Start difference. First operand 1046 states and 2070 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:55,435 INFO L93 Difference]: Finished difference Result 1971 states and 3904 transitions. [2022-11-03 02:02:55,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 02:02:55,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 45 [2022-11-03 02:02:55,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:55,438 INFO L225 Difference]: With dead ends: 1971 [2022-11-03 02:02:55,438 INFO L226 Difference]: Without dead ends: 1971 [2022-11-03 02:02:55,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=312, Invalid=1580, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 02:02:55,439 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 174 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:55,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 25 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 985 Invalid, 0 Unknown, 69 Unchecked, 1.0s Time] [2022-11-03 02:02:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2022-11-03 02:02:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1068. [2022-11-03 02:02:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1061 states have (on average 1.9924599434495758) internal successors, (2114), 1067 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 2114 transitions. [2022-11-03 02:02:55,457 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 2114 transitions. Word has length 45 [2022-11-03 02:02:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:55,458 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 2114 transitions. [2022-11-03 02:02:55,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 2114 transitions. [2022-11-03 02:02:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:02:55,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:55,459 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:55,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-03 02:02:55,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:55,659 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:02:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1582651324, now seen corresponding path program 3 times [2022-11-03 02:02:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:55,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861689231] [2022-11-03 02:02:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:56,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:56,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861689231] [2022-11-03 02:02:56,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861689231] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:56,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339892349] [2022-11-03 02:02:56,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:02:56,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:56,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:02:56,055 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:02:56,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 02:02:56,429 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:02:56,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:02:56,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:02:56,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:02:56,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:02:56,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:56,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:02:56,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:56,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:56,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:56,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:02:56,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:56,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:56,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:02:56,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:56,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:56,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:56,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:02:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:56,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:02:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:02:57,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339892349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:02:57,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [577725756] [2022-11-03 02:02:57,381 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:02:57,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:02:57,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-11-03 02:02:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127248540] [2022-11-03 02:02:57,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:02:57,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 02:02:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 02:02:57,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-11-03 02:02:57,384 INFO L87 Difference]: Start difference. First operand 1068 states and 2114 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:59,606 INFO L93 Difference]: Finished difference Result 2063 states and 4086 transitions. [2022-11-03 02:02:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:02:59,606 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-03 02:02:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:59,609 INFO L225 Difference]: With dead ends: 2063 [2022-11-03 02:02:59,609 INFO L226 Difference]: Without dead ends: 2059 [2022-11-03 02:02:59,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2022-11-03 02:02:59,610 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 422 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:59,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 261 Invalid, 2291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1957 Invalid, 0 Unknown, 205 Unchecked, 1.8s Time] [2022-11-03 02:02:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2022-11-03 02:02:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1014. [2022-11-03 02:02:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1007 states have (on average 1.9860973187686197) internal successors, (2000), 1013 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2000 transitions. [2022-11-03 02:02:59,627 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2000 transitions. Word has length 45 [2022-11-03 02:02:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:59,627 INFO L495 AbstractCegarLoop]: Abstraction has 1014 states and 2000 transitions. [2022-11-03 02:02:59,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2000 transitions. [2022-11-03 02:02:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:02:59,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:59,628 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:59,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 02:02:59,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-03 02:02:59,829 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:02:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1341458257, now seen corresponding path program 1 times [2022-11-03 02:02:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:59,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083072467] [2022-11-03 02:02:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:03:00,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:00,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083072467] [2022-11-03 02:03:00,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083072467] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:03:00,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192370515] [2022-11-03 02:03:00,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:00,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:03:00,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:03:00,860 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:03:00,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-03 02:03:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:01,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 02:03:01,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:03:01,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:03:01,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:03:01,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:03:01,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:03:01,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:03:01,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:03:01,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:03:01,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:03:01,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:01,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:03:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:03:02,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:03:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:03:04,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192370515] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:03:04,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2086252355] [2022-11-03 02:03:04,131 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:03:04,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:03:04,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 31 [2022-11-03 02:03:04,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969882305] [2022-11-03 02:03:04,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:03:04,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:03:04,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:04,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:03:04,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=794, Unknown=0, NotChecked=0, Total=992 [2022-11-03 02:03:04,133 INFO L87 Difference]: Start difference. First operand 1014 states and 2000 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:03:05,127 INFO L93 Difference]: Finished difference Result 1612 states and 3192 transitions. [2022-11-03 02:03:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:03:05,127 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 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 45 [2022-11-03 02:03:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:03:05,129 INFO L225 Difference]: With dead ends: 1612 [2022-11-03 02:03:05,129 INFO L226 Difference]: Without dead ends: 1612 [2022-11-03 02:03:05,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=352, Invalid=1130, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 02:03:05,130 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 320 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:03:05,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 279 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 826 Invalid, 0 Unknown, 274 Unchecked, 0.7s Time] [2022-11-03 02:03:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2022-11-03 02:03:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1024. [2022-11-03 02:03:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1017 states have (on average 1.9862340216322518) internal successors, (2020), 1023 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2020 transitions. [2022-11-03 02:03:05,146 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2020 transitions. Word has length 45 [2022-11-03 02:03:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:03:05,146 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 2020 transitions. [2022-11-03 02:03:05,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2020 transitions. [2022-11-03 02:03:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:03:05,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:03:05,147 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:03:05,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-03 02:03:05,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-03 02:03:05,347 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:03:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:03:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1458830481, now seen corresponding path program 2 times [2022-11-03 02:03:05,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:03:05,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146696512] [2022-11-03 02:03:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:03:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:03:06,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:06,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146696512] [2022-11-03 02:03:06,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146696512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:03:06,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918484485] [2022-11-03 02:03:06,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:03:06,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:03:06,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:03:06,201 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:03:06,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-03 02:03:06,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:03:06,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:03:06,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:03:06,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:03:06,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:03:06,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:03:06,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:03:06,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:03:06,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:03:07,063 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:03:07,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 02:03:07,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:03:07,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:03:07,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:03:07,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:03:07,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:07,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2022-11-03 02:03:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:03:07,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:03:10,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 02:03:10,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-03 02:03:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:03:10,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918484485] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:03:10,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:03:10,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 11] total 33 [2022-11-03 02:03:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132910224] [2022-11-03 02:03:10,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:03:10,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:03:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:10,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:03:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 02:03:10,719 INFO L87 Difference]: Start difference. First operand 1024 states and 2020 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:03:11,036 INFO L93 Difference]: Finished difference Result 1264 states and 2491 transitions. [2022-11-03 02:03:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:03:11,036 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 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 45 [2022-11-03 02:03:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:03:11,038 INFO L225 Difference]: With dead ends: 1264 [2022-11-03 02:03:11,038 INFO L226 Difference]: Without dead ends: 1264 [2022-11-03 02:03:11,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 02:03:11,038 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:03:11,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 62 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2022-11-03 02:03:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2022-11-03 02:03:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1025. [2022-11-03 02:03:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1018 states have (on average 1.9862475442043221) internal successors, (2022), 1024 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 2022 transitions. [2022-11-03 02:03:11,067 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 2022 transitions. Word has length 45 [2022-11-03 02:03:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:03:11,067 INFO L495 AbstractCegarLoop]: Abstraction has 1025 states and 2022 transitions. [2022-11-03 02:03:11,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 2022 transitions. [2022-11-03 02:03:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:03:11,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:03:11,070 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:03:11,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-03 02:03:11,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-03 02:03:11,281 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:03:11,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:03:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash -801160415, now seen corresponding path program 3 times [2022-11-03 02:03:11,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:03:11,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066554213] [2022-11-03 02:03:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:03:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:03:12,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:12,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066554213] [2022-11-03 02:03:12,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066554213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:03:12,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930540750] [2022-11-03 02:03:12,241 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:03:12,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:03:12,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:03:12,242 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:03:12,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-03 02:03:12,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:03:12,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:03:12,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 02:03:12,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:03:12,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:03:12,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:03:12,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:03:13,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:03:13,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:03:13,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:03:13,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:03:13,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:03:13,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:13,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2022-11-03 02:03:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:03:19,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:03:23,341 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))))))) is different from false [2022-11-03 02:03:45,245 WARN L234 SmtUtils]: Spent 14.43s on a formula simplification. DAG size of input: 45 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:04:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:05,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930540750] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:04:05,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [884541535] [2022-11-03 02:04:05,990 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:04:05,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:04:05,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 36 [2022-11-03 02:04:05,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954285803] [2022-11-03 02:04:05,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:04:05,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:04:05,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:04:05,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1047, Unknown=9, NotChecked=68, Total=1332 [2022-11-03 02:04:05,992 INFO L87 Difference]: Start difference. First operand 1025 states and 2022 transitions. Second operand has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:10,891 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 .cse2 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (= (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse4 .cse5) 0) (= 0 (select .cse4 .cse6)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 02:04:13,023 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 .cse2 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (= (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| Int)) (or (forall ((v_ArrVal_5142 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371| v_ArrVal_5142)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_371|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse4 .cse5) 0) (= 0 (select .cse4 .cse6)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= (select .cse4 .cse2) 0) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 02:04:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:14,594 INFO L93 Difference]: Finished difference Result 3024 states and 6021 transitions. [2022-11-03 02:04:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 02:04:14,595 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 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 45 [2022-11-03 02:04:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:14,599 INFO L225 Difference]: With dead ends: 3024 [2022-11-03 02:04:14,599 INFO L226 Difference]: Without dead ends: 3022 [2022-11-03 02:04:14,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 59.4s TimeCoverageRelationStatistics Valid=322, Invalid=1570, Unknown=12, NotChecked=258, Total=2162 [2022-11-03 02:04:14,599 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 446 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1107 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:14,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 302 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1787 Invalid, 0 Unknown, 1107 Unchecked, 1.8s Time] [2022-11-03 02:04:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-11-03 02:04:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1054. [2022-11-03 02:04:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 1047 states have (on average 1.9866284622731614) internal successors, (2080), 1053 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 2080 transitions. [2022-11-03 02:04:14,624 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 2080 transitions. Word has length 45 [2022-11-03 02:04:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:14,625 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 2080 transitions. [2022-11-03 02:04:14,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 2080 transitions. [2022-11-03 02:04:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:04:14,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:14,627 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:14,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:14,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-03 02:04:14,854 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:04:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1854596311, now seen corresponding path program 4 times [2022-11-03 02:04:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:14,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497091771] [2022-11-03 02:04:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:15,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:15,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497091771] [2022-11-03 02:04:15,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497091771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:15,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132739052] [2022-11-03 02:04:15,740 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:04:15,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:15,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:15,741 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:15,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-03 02:04:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:16,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 02:04:16,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:16,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:16,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:16,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:04:16,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:04:16,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:04:16,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:16,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:16,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:16,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:16,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:04:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:16,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:19,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132739052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:04:19,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [288704312] [2022-11-03 02:04:19,156 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:04:19,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:04:19,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 31 [2022-11-03 02:04:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899120707] [2022-11-03 02:04:19,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:04:19,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:04:19,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:04:19,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2022-11-03 02:04:19,158 INFO L87 Difference]: Start difference. First operand 1054 states and 2080 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:20,419 INFO L93 Difference]: Finished difference Result 1754 states and 3476 transitions. [2022-11-03 02:04:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:04:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 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 45 [2022-11-03 02:04:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:20,422 INFO L225 Difference]: With dead ends: 1754 [2022-11-03 02:04:20,422 INFO L226 Difference]: Without dead ends: 1754 [2022-11-03 02:04:20,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2022-11-03 02:04:20,423 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 288 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 594 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:20,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 298 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 916 Invalid, 0 Unknown, 594 Unchecked, 0.9s Time] [2022-11-03 02:04:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2022-11-03 02:04:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1056. [2022-11-03 02:04:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1049 states have (on average 1.986653956148713) internal successors, (2084), 1055 states have internal predecessors, (2084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2084 transitions. [2022-11-03 02:04:20,439 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2084 transitions. Word has length 45 [2022-11-03 02:04:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:20,439 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 2084 transitions. [2022-11-03 02:04:20,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2084 transitions. [2022-11-03 02:04:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:04:20,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:20,441 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:20,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:20,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:20,641 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:04:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash 180380089, now seen corresponding path program 5 times [2022-11-03 02:04:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:20,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015245401] [2022-11-03 02:04:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:20,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:21,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015245401] [2022-11-03 02:04:21,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015245401] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007274495] [2022-11-03 02:04:21,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:04:21,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:21,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:21,624 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:21,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-03 02:04:22,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:04:22,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:04:22,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:04:22,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:22,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:04:22,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:22,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:22,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:04:22,464 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:22,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 02:04:22,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 02:04:22,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:04:22,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:22,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:22,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:23,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2022-11-03 02:04:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:04:23,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:26,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 02:04:26,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-03 02:04:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:04:26,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007274495] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:26,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:04:26,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 11] total 33 [2022-11-03 02:04:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638496845] [2022-11-03 02:04:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:04:26,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:04:26,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:26,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:04:26,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 02:04:26,939 INFO L87 Difference]: Start difference. First operand 1056 states and 2084 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:27,880 INFO L93 Difference]: Finished difference Result 1234 states and 2434 transitions. [2022-11-03 02:04:27,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:04:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 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 45 [2022-11-03 02:04:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:27,882 INFO L225 Difference]: With dead ends: 1234 [2022-11-03 02:04:27,882 INFO L226 Difference]: Without dead ends: 1234 [2022-11-03 02:04:27,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:04:27,883 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 27 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 595 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:27,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 595 Unchecked, 0.1s Time] [2022-11-03 02:04:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-11-03 02:04:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1057. [2022-11-03 02:04:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1050 states have (on average 1.9866666666666666) internal successors, (2086), 1056 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 2086 transitions. [2022-11-03 02:04:27,902 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 2086 transitions. Word has length 45 [2022-11-03 02:04:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:27,902 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 2086 transitions. [2022-11-03 02:04:27,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:27,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 2086 transitions. [2022-11-03 02:04:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:04:27,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:27,904 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:27,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:28,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:28,117 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:04:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1393800005, now seen corresponding path program 6 times [2022-11-03 02:04:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:28,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196597578] [2022-11-03 02:04:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:28,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:28,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:28,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196597578] [2022-11-03 02:04:28,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196597578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:28,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14167300] [2022-11-03 02:04:28,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:04:28,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:28,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:28,996 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:28,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-03 02:04:29,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:04:29,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:04:29,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-03 02:04:29,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:29,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:29,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:29,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:04:29,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:04:30,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:04:30,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:30,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:30,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:30,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:30,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2022-11-03 02:04:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:30,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:35,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14167300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:04:35,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [406999187] [2022-11-03 02:04:35,192 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:04:35,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:04:35,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 36 [2022-11-03 02:04:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423299280] [2022-11-03 02:04:35,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:04:35,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:04:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:04:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 02:04:35,194 INFO L87 Difference]: Start difference. First operand 1057 states and 2086 transitions. Second operand has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:36,481 INFO L93 Difference]: Finished difference Result 1748 states and 3464 transitions. [2022-11-03 02:04:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:04:36,482 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 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 45 [2022-11-03 02:04:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:36,484 INFO L225 Difference]: With dead ends: 1748 [2022-11-03 02:04:36,484 INFO L226 Difference]: Without dead ends: 1748 [2022-11-03 02:04:36,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=529, Invalid=1823, Unknown=0, NotChecked=0, Total=2352 [2022-11-03 02:04:36,484 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 345 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 514 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:36,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 210 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 572 Invalid, 0 Unknown, 514 Unchecked, 0.6s Time] [2022-11-03 02:04:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2022-11-03 02:04:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1058. [2022-11-03 02:04:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1051 states have (on average 1.9866793529971456) internal successors, (2088), 1057 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2088 transitions. [2022-11-03 02:04:36,505 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2088 transitions. Word has length 45 [2022-11-03 02:04:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:36,506 INFO L495 AbstractCegarLoop]: Abstraction has 1058 states and 2088 transitions. [2022-11-03 02:04:36,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2088 transitions. [2022-11-03 02:04:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:04:36,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:36,508 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:36,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:36,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:36,733 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:04:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 408501147, now seen corresponding path program 7 times [2022-11-03 02:04:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:36,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748989623] [2022-11-03 02:04:36,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:37,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:37,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748989623] [2022-11-03 02:04:37,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748989623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:37,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485876039] [2022-11-03 02:04:37,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:04:37,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:37,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:37,621 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:37,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-03 02:04:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:37,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:04:37,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:38,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:38,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:38,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:04:38,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 42 [2022-11-03 02:04:38,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:04:38,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:38,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:38,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:04:38,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-03 02:04:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:04:42,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:05:02,577 WARN L234 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:05:29,630 WARN L234 SmtUtils]: Spent 10.22s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:05:31,736 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0) .cse2 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| Int) (v_ArrVal_5783 Int) (v_ArrVal_5782 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| 1) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) v_ArrVal_5782) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| v_ArrVal_5783)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| Int) (v_ArrVal_5783 Int) (v_ArrVal_5782 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| 1) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) v_ArrVal_5782) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| v_ArrVal_5783)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| Int) (v_ArrVal_5783 Int) (v_ArrVal_5782 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| 1) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) v_ArrVal_5782) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| v_ArrVal_5783)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| Int) (v_ArrVal_5783 Int) (v_ArrVal_5782 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| 1) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) v_ArrVal_5782) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| v_ArrVal_5783)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))))))) is different from false [2022-11-03 02:06:02,147 WARN L234 SmtUtils]: Spent 12.85s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:06:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:06:06,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485876039] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:06:06,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [63381263] [2022-11-03 02:06:06,791 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:06:06,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:06:06,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 34 [2022-11-03 02:06:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644564473] [2022-11-03 02:06:06,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:06:06,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 02:06:06,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:06:06,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 02:06:06,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=929, Unknown=21, NotChecked=64, Total=1190 [2022-11-03 02:06:06,793 INFO L87 Difference]: Start difference. First operand 1058 states and 2088 transitions. Second operand has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:09,567 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse5 0) .cse3 0)))) (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (select .cse1 |c_~#cache~0.base|))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| Int) (v_ArrVal_5783 Int) (v_ArrVal_5782 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| 1) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) v_ArrVal_5782) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| v_ArrVal_5783)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| Int) (v_ArrVal_5783 Int) (v_ArrVal_5782 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| 1) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) v_ArrVal_5782) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| v_ArrVal_5783)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (= (select .cse0 .cse4) 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| Int) (v_ArrVal_5783 Int) (v_ArrVal_5782 Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| 1) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) v_ArrVal_5782) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| v_ArrVal_5783)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0) (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|))) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| Int) (v_ArrVal_5783 Int) (v_ArrVal_5782 Int)) (or (< |c_~#cache~0.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| 1) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375|) v_ArrVal_5782) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_375| v_ArrVal_5783)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0))))))) is different from false [2022-11-03 02:06:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:11,209 INFO L93 Difference]: Finished difference Result 3465 states and 6922 transitions. [2022-11-03 02:06:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 02:06:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 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 45 [2022-11-03 02:06:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:11,214 INFO L225 Difference]: With dead ends: 3465 [2022-11-03 02:06:11,214 INFO L226 Difference]: Without dead ends: 3463 [2022-11-03 02:06:11,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 91.4s TimeCoverageRelationStatistics Valid=270, Invalid=1522, Unknown=22, NotChecked=166, Total=1980 [2022-11-03 02:06:11,215 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 277 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1066 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:11,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 329 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 845 Invalid, 0 Unknown, 1066 Unchecked, 1.0s Time] [2022-11-03 02:06:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2022-11-03 02:06:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 1055. [2022-11-03 02:06:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1048 states have (on average 1.9866412213740459) internal successors, (2082), 1054 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2082 transitions. [2022-11-03 02:06:11,242 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2082 transitions. Word has length 45 [2022-11-03 02:06:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:11,242 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 2082 transitions. [2022-11-03 02:06:11,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2082 transitions. [2022-11-03 02:06:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:06:11,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:11,244 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:06:11,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:11,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:11,469 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:06:11,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:11,470 INFO L85 PathProgramCache]: Analyzing trace with hash -603351121, now seen corresponding path program 8 times [2022-11-03 02:06:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:06:11,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104852745] [2022-11-03 02:06:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:06:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:06:12,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:06:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104852745] [2022-11-03 02:06:12,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104852745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578017781] [2022-11-03 02:06:12,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:06:12,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:12,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:12,464 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:06:12,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-03 02:06:12,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:06:12,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:06:12,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:06:12,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:12,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:06:12,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:12,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:13,127 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:13,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 02:06:13,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:06:13,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 02:06:13,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:06:13,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:06:13,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-03 02:06:13,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-03 02:06:13,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:13,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 111 [2022-11-03 02:06:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:06:18,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:22,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 02:06:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:06:22,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578017781] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:22,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:06:22,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 12] total 34 [2022-11-03 02:06:22,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245409727] [2022-11-03 02:06:22,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:22,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:06:22,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:06:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:06:22,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=985, Unknown=4, NotChecked=0, Total=1190 [2022-11-03 02:06:22,763 INFO L87 Difference]: Start difference. First operand 1055 states and 2082 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:23,877 INFO L93 Difference]: Finished difference Result 1218 states and 2403 transitions. [2022-11-03 02:06:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:06:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 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 45 [2022-11-03 02:06:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:23,879 INFO L225 Difference]: With dead ends: 1218 [2022-11-03 02:06:23,879 INFO L226 Difference]: Without dead ends: 1218 [2022-11-03 02:06:23,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=212, Invalid=1116, Unknown=4, NotChecked=0, Total=1332 [2022-11-03 02:06:23,879 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:23,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 55 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 159 Unchecked, 0.1s Time] [2022-11-03 02:06:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2022-11-03 02:06:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1057. [2022-11-03 02:06:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1050 states have (on average 1.9866666666666666) internal successors, (2086), 1056 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 2086 transitions. [2022-11-03 02:06:23,893 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 2086 transitions. Word has length 45 [2022-11-03 02:06:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:23,893 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 2086 transitions. [2022-11-03 02:06:23,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 2086 transitions. [2022-11-03 02:06:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:06:23,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:23,895 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:06:23,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:24,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-03 02:06:24,109 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:06:24,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2117436081, now seen corresponding path program 9 times [2022-11-03 02:06:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:06:24,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118181756] [2022-11-03 02:06:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:06:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:06:25,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:06:25,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118181756] [2022-11-03 02:06:25,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118181756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:25,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196363339] [2022-11-03 02:06:25,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:06:25,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:25,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:25,075 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:06:25,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9980db-4e04-40d7-b15f-c83632ff9a2c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-03 02:06:25,552 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:06:25,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:06:25,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 02:06:25,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:25,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:25,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:25,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:06:26,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-11-03 02:06:26,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:06:26,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:06:26,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:06:26,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:06:26,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:26,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2022-11-03 02:06:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:06:32,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:36,858 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) .cse4 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))))))) is different from false [2022-11-03 02:06:55,005 WARN L234 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 46 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:07:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:07:06,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196363339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:07:06,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1638586670] [2022-11-03 02:07:06,085 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-03 02:07:06,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:07:06,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 36 [2022-11-03 02:07:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078783979] [2022-11-03 02:07:06,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:07:06,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:07:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:07:06,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:07:06,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1051, Unknown=10, NotChecked=68, Total=1332 [2022-11-03 02:07:06,088 INFO L87 Difference]: Start difference. First operand 1057 states and 2086 transitions. Second operand has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:08,699 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse3 0) .cse6 0)))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (= (select .cse0 .cse5) 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 02:07:13,080 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse3 0) .cse6 0)))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| Int)) (or (forall ((v_ArrVal_6105 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377| v_ArrVal_6105)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_377|))) (= (select .cse0 .cse5) 0) (= 0 (select .cse0 .cse3)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= (select .cse0 .cse6) 0) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) is different from false