./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.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_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/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_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/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_651e062e-4086-459c-9c99-4fea4537d784/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 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- 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 02:14:08,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:14:08,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:14:08,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:14:08,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:14:08,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:14:08,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:14:08,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:14:08,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:14:08,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:14:08,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:14:08,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:14:08,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:14:08,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:14:08,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:14:08,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:14:08,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:14:08,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:14:08,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:14:08,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:14:08,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:14:08,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:14:08,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:14:08,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:14:08,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:14:08,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:14:08,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:14:08,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:14:08,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:14:08,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:14:08,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:14:08,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:14:08,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:14:08,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:14:08,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:14:08,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:14:08,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:14:08,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:14:08,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:14:08,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:14:08,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:14:08,966 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-03 02:14:08,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:14:08,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:14:08,991 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:14:08,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:14:08,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:14:08,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:14:08,993 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:14:08,993 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:14:08,993 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:14:08,993 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:14:08,994 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:14:08,994 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:14:08,994 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:14:08,994 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:14:08,994 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:14:08,995 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:14:08,995 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:14:08,995 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:14:08,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:14:08,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:14:08,996 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:14:08,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:14:08,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:14:08,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:14:08,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:14:08,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:14:08,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:14:08,998 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-03 02:14:08,998 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:14:08,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:14:08,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:14:08,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:14:08,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:14:08,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:14:08,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:14:08,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:14:09,000 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:14:09,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:14:09,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:14:09,000 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:14:09,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:14:09,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:14:09,001 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:14:09,001 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_651e062e-4086-459c-9c99-4fea4537d784/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_651e062e-4086-459c-9c99-4fea4537d784/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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2022-11-03 02:14:09,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:14:09,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:14:09,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:14:09,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:14:09,276 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:14:09,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-11-03 02:14:09,377 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/data/e80654d77/51680a7e1d584838a91ee5992fe1c3b2/FLAG4c61e8f21 [2022-11-03 02:14:09,969 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:14:09,970 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-11-03 02:14:09,983 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/data/e80654d77/51680a7e1d584838a91ee5992fe1c3b2/FLAG4c61e8f21 [2022-11-03 02:14:10,255 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/data/e80654d77/51680a7e1d584838a91ee5992fe1c3b2 [2022-11-03 02:14:10,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:14:10,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:14:10,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:14:10,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:14:10,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:14:10,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:14:10" (1/1) ... [2022-11-03 02:14:10,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af53ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:10, skipping insertion in model container [2022-11-03 02:14:10,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:14:10" (1/1) ... [2022-11-03 02:14:10,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:14:10,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:14:10,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:14:10,936 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:14:10,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:14:11,060 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:14:11,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11 WrapperNode [2022-11-03 02:14:11,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:14:11,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:14:11,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:14:11,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:14:11,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,146 INFO L138 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2022-11-03 02:14:11,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:14:11,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:14:11,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:14:11,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:14:11,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,202 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:14:11,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:14:11,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:14:11,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:14:11,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (1/1) ... [2022-11-03 02:14:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:14:11,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:11,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:14:11,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:14:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:14:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:14:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:14:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:14:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 02:14:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:14:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-03 02:14:11,310 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-03 02:14:11,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:14:11,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:14:11,311 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 02:14:11,519 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:14:11,522 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:14:11,828 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:14:11,837 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:14:11,837 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 02:14:11,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:14:11 BoogieIcfgContainer [2022-11-03 02:14:11,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:14:11,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:14:11,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:14:11,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:14:11,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:14:10" (1/3) ... [2022-11-03 02:14:11,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e05ec63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:14:11, skipping insertion in model container [2022-11-03 02:14:11,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:11" (2/3) ... [2022-11-03 02:14:11,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e05ec63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:14:11, skipping insertion in model container [2022-11-03 02:14:11,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:14:11" (3/3) ... [2022-11-03 02:14:11,855 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2022-11-03 02:14:11,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:14:11,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:14:11,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-03 02:14:11,876 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:14:12,003 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:14:12,062 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:14:12,075 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 261 flow [2022-11-03 02:14:12,078 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 261 flow [2022-11-03 02:14:12,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 261 flow [2022-11-03 02:14:12,137 INFO L130 PetriNetUnfolder]: 6/127 cut-off events. [2022-11-03 02:14:12,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 02:14:12,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 233 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-03 02:14:12,148 INFO L118 LiptonReduction]: Number of co-enabled transitions 4864 [2022-11-03 02:14:14,609 INFO L133 LiptonReduction]: Checked pairs total: 14681 [2022-11-03 02:14:14,610 INFO L135 LiptonReduction]: Total number of compositions: 75 [2022-11-03 02:14:14,621 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 56 transitions, 117 flow [2022-11-03 02:14:14,682 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 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:14:14,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:14:14,710 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;@159c6ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:14:14,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-03 02:14:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 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:14:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:14:14,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:14,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:14,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash 552578495, now seen corresponding path program 1 times [2022-11-03 02:14:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:14,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015021735] [2022-11-03 02:14:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:15,060 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 02:14:15,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:15,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015021735] [2022-11-03 02:14:15,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015021735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:15,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:14:15,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:14:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374707489] [2022-11-03 02:14:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:14:15,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:15,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:14:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:14:15,108 INFO L87 Difference]: Start difference. First operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 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 02:14:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:15,226 INFO L93 Difference]: Finished difference Result 596 states and 1189 transitions. [2022-11-03 02:14:15,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:14:15,229 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 02:14:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:15,244 INFO L225 Difference]: With dead ends: 596 [2022-11-03 02:14:15,245 INFO L226 Difference]: Without dead ends: 596 [2022-11-03 02:14:15,246 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 02:14:15,249 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:15,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-03 02:14:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2022-11-03 02:14:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 582 states have (on average 2.042955326460481) internal successors, (1189), 595 states have internal predecessors, (1189), 0 states have call successors, (0), 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:14:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1189 transitions. [2022-11-03 02:14:15,325 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1189 transitions. Word has length 11 [2022-11-03 02:14:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:15,326 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 1189 transitions. [2022-11-03 02:14:15,326 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 02:14:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1189 transitions. [2022-11-03 02:14:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:14:15,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:15,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:15,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:14:15,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash -211752277, now seen corresponding path program 1 times [2022-11-03 02:14:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:15,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120300676] [2022-11-03 02:14:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:15,482 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 02:14:15,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:15,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120300676] [2022-11-03 02:14:15,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120300676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:15,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266483992] [2022-11-03 02:14:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:15,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:15,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:15,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:15,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:14:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:15,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:14:15,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:14:15,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:14:15,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266483992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:15,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:14:15,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-11-03 02:14:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712102440] [2022-11-03 02:14:15,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:15,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:14:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:15,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:14:15,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:14:15,661 INFO L87 Difference]: Start difference. First operand 596 states and 1189 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 02:14:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:15,760 INFO L93 Difference]: Finished difference Result 884 states and 1765 transitions. [2022-11-03 02:14:15,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:14:15,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 12 [2022-11-03 02:14:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:15,768 INFO L225 Difference]: With dead ends: 884 [2022-11-03 02:14:15,768 INFO L226 Difference]: Without dead ends: 884 [2022-11-03 02:14:15,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:14:15,783 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:15,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 73 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-11-03 02:14:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 614. [2022-11-03 02:14:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 600 states have (on average 2.0416666666666665) internal successors, (1225), 613 states have internal predecessors, (1225), 0 states have call successors, (0), 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:14:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1225 transitions. [2022-11-03 02:14:15,840 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1225 transitions. Word has length 12 [2022-11-03 02:14:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:15,841 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 1225 transitions. [2022-11-03 02:14:15,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 02:14:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1225 transitions. [2022-11-03 02:14:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:14:15,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:15,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:15,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 02:14:16,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:16,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash 206915211, now seen corresponding path program 1 times [2022-11-03 02:14:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:16,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469435040] [2022-11-03 02:14:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:16,187 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 02:14:16,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:16,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469435040] [2022-11-03 02:14:16,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469435040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:16,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217836155] [2022-11-03 02:14:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:16,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:16,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:16,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:16,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:14:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:16,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:14:16,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:16,332 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 02:14:16,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:16,365 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 02:14:16,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217836155] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:16,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [145921210] [2022-11-03 02:14:16,373 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:14:16,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:14:16,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-03 02:14:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873875300] [2022-11-03 02:14:16,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:14:16,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:14:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:14:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:14:16,387 INFO L87 Difference]: Start difference. First operand 614 states and 1225 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 02:14:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:16,539 INFO L93 Difference]: Finished difference Result 617 states and 1228 transitions. [2022-11-03 02:14:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:16,540 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 02:14:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:16,544 INFO L225 Difference]: With dead ends: 617 [2022-11-03 02:14:16,544 INFO L226 Difference]: Without dead ends: 617 [2022-11-03 02:14:16,545 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 02:14:16,557 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:16,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-03 02:14:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2022-11-03 02:14:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 603 states have (on average 2.0364842454394694) internal successors, (1228), 616 states have internal predecessors, (1228), 0 states have call successors, (0), 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:14:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1228 transitions. [2022-11-03 02:14:16,583 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1228 transitions. Word has length 12 [2022-11-03 02:14:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:16,584 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 1228 transitions. [2022-11-03 02:14:16,584 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 02:14:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1228 transitions. [2022-11-03 02:14:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:14:16,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:16,589 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:16,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:16,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:16,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash -356391777, now seen corresponding path program 2 times [2022-11-03 02:14:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767722539] [2022-11-03 02:14:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:16,929 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 02:14:16,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767722539] [2022-11-03 02:14:16,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767722539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822088054] [2022-11-03 02:14:16,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:14:16,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:16,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:16,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:14:17,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:14:17,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:14:17,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 02:14:17,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:17,137 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:14:17,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:17,166 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:14:17,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:17,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:17,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:14:17,208 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 02:14:17,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:17,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:17,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:17,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:14:17,265 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 02:14:17,304 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 02:14:17,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:14:17,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822088054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:17,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:14:17,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2022-11-03 02:14:17,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861022685] [2022-11-03 02:14:17,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:17,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:14:17,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:14:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:14:17,308 INFO L87 Difference]: Start difference. First operand 617 states and 1228 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 02:14:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:18,019 INFO L93 Difference]: Finished difference Result 1292 states and 2578 transitions. [2022-11-03 02:14:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:14:18,020 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 02:14:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:18,025 INFO L225 Difference]: With dead ends: 1292 [2022-11-03 02:14:18,025 INFO L226 Difference]: Without dead ends: 1292 [2022-11-03 02:14:18,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:14:18,031 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 208 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:18,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 102 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:14:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-11-03 02:14:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 725. [2022-11-03 02:14:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 711 states have (on average 2.030942334739803) internal successors, (1444), 724 states have internal predecessors, (1444), 0 states have call successors, (0), 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:14:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1444 transitions. [2022-11-03 02:14:18,071 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1444 transitions. Word has length 15 [2022-11-03 02:14:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:18,071 INFO L495 AbstractCegarLoop]: Abstraction has 725 states and 1444 transitions. [2022-11-03 02:14:18,072 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 02:14:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1444 transitions. [2022-11-03 02:14:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:14:18,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:18,075 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:18,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:18,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:18,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1708804052, now seen corresponding path program 1 times [2022-11-03 02:14:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:18,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921684080] [2022-11-03 02:14:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:18,409 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 02:14:18,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:18,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921684080] [2022-11-03 02:14:18,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921684080] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:18,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837046443] [2022-11-03 02:14:18,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:18,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:18,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:18,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:18,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:14:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:18,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:14:18,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:18,534 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 02:14:18,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:18,604 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 02:14:18,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837046443] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:18,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [867858306] [2022-11-03 02:14:18,605 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:14:18,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:14:18,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-03 02:14:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684358903] [2022-11-03 02:14:18,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:14:18,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:14:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:18,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:14:18,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:14:18,609 INFO L87 Difference]: Start difference. First operand 725 states and 1444 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 02:14:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:18,705 INFO L93 Difference]: Finished difference Result 731 states and 1450 transitions. [2022-11-03 02:14:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:14:18,706 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 02:14:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:18,709 INFO L225 Difference]: With dead ends: 731 [2022-11-03 02:14:18,710 INFO L226 Difference]: Without dead ends: 731 [2022-11-03 02:14:18,710 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 02:14:18,711 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:18,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-11-03 02:14:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2022-11-03 02:14:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 717 states have (on average 2.0223152022315203) internal successors, (1450), 730 states have internal predecessors, (1450), 0 states have call successors, (0), 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:14:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1450 transitions. [2022-11-03 02:14:18,731 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1450 transitions. Word has length 15 [2022-11-03 02:14:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:18,732 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1450 transitions. [2022-11-03 02:14:18,732 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 02:14:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1450 transitions. [2022-11-03 02:14:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:14:18,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:18,733 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:18,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:18,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:18,946 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1077624748, now seen corresponding path program 2 times [2022-11-03 02:14:18,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:18,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943114980] [2022-11-03 02:14:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:19,356 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 02:14:19,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:19,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943114980] [2022-11-03 02:14:19,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943114980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:19,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:14:19,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:14:19,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654510733] [2022-11-03 02:14:19,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:19,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:14:19,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:19,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:14:19,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:14:19,359 INFO L87 Difference]: Start difference. First operand 731 states and 1450 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 02:14:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:19,778 INFO L93 Difference]: Finished difference Result 915 states and 1818 transitions. [2022-11-03 02:14:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:19,779 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 02:14:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:19,783 INFO L225 Difference]: With dead ends: 915 [2022-11-03 02:14:19,783 INFO L226 Difference]: Without dead ends: 915 [2022-11-03 02:14:19,784 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 02:14:19,784 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 74 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:19,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 27 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:14:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-11-03 02:14:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 851. [2022-11-03 02:14:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 837 states have (on average 2.019115890083632) internal successors, (1690), 850 states have internal predecessors, (1690), 0 states have call successors, (0), 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:14:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1690 transitions. [2022-11-03 02:14:19,824 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1690 transitions. Word has length 21 [2022-11-03 02:14:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:19,824 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1690 transitions. [2022-11-03 02:14:19,825 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 02:14:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1690 transitions. [2022-11-03 02:14:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:14:19,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:19,826 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 02:14:19,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:14:19,826 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1841235887, now seen corresponding path program 1 times [2022-11-03 02:14:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:19,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911219824] [2022-11-03 02:14:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:20,186 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 02:14:20,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:20,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911219824] [2022-11-03 02:14:20,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911219824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:20,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:14:20,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:14:20,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339864935] [2022-11-03 02:14:20,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:20,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:14:20,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:20,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:14:20,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:14:20,189 INFO L87 Difference]: Start difference. First operand 851 states and 1690 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 02:14:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:20,613 INFO L93 Difference]: Finished difference Result 937 states and 1862 transitions. [2022-11-03 02:14:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:20,614 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 02:14:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:20,618 INFO L225 Difference]: With dead ends: 937 [2022-11-03 02:14:20,618 INFO L226 Difference]: Without dead ends: 937 [2022-11-03 02:14:20,618 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 02:14:20,619 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:20,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 40 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:14:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-11-03 02:14:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 917. [2022-11-03 02:14:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 903 states have (on average 2.017718715393134) internal successors, (1822), 916 states have internal predecessors, (1822), 0 states have call successors, (0), 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:14:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1822 transitions. [2022-11-03 02:14:20,669 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1822 transitions. Word has length 27 [2022-11-03 02:14:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:20,670 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1822 transitions. [2022-11-03 02:14:20,670 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 02:14:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1822 transitions. [2022-11-03 02:14:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:14:20,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:20,671 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 02:14:20,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:14:20,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1690315318, now seen corresponding path program 1 times [2022-11-03 02:14:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:20,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485915902] [2022-11-03 02:14:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:21,065 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 02:14:21,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:21,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485915902] [2022-11-03 02:14:21,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485915902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:21,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:14:21,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:14:21,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120631693] [2022-11-03 02:14:21,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:21,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:14:21,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:14:21,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:14:21,067 INFO L87 Difference]: Start difference. First operand 917 states and 1822 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 02:14:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:21,533 INFO L93 Difference]: Finished difference Result 1079 states and 2146 transitions. [2022-11-03 02:14:21,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:21,533 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 02:14:21,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:21,538 INFO L225 Difference]: With dead ends: 1079 [2022-11-03 02:14:21,538 INFO L226 Difference]: Without dead ends: 1047 [2022-11-03 02:14:21,538 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 02:14:21,539 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 70 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:21,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 27 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:14:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-11-03 02:14:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1010. [2022-11-03 02:14:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 996 states have (on average 2.0120481927710845) internal successors, (2004), 1009 states have internal predecessors, (2004), 0 states have call successors, (0), 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:14:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2004 transitions. [2022-11-03 02:14:21,573 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2004 transitions. Word has length 27 [2022-11-03 02:14:21,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:21,574 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 2004 transitions. [2022-11-03 02:14:21,574 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 02:14:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2004 transitions. [2022-11-03 02:14:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:14:21,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:21,576 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 02:14:21,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:14:21,580 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash -693190654, now seen corresponding path program 1 times [2022-11-03 02:14:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:21,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783937906] [2022-11-03 02:14:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:21,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:22,955 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 02:14:22,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:22,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783937906] [2022-11-03 02:14:22,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783937906] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:22,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555933592] [2022-11-03 02:14:22,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:22,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:22,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:22,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:22,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:14:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:23,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 02:14:23,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:23,169 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:14:23,228 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 02:14:23,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:14:23,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555933592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:23,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:14:23,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 16 [2022-11-03 02:14:23,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334323133] [2022-11-03 02:14:23,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:23,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:14:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:23,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:14:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:14:23,231 INFO L87 Difference]: Start difference. First operand 1010 states and 2004 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 02:14:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:23,391 INFO L93 Difference]: Finished difference Result 1765 states and 3488 transitions. [2022-11-03 02:14:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:23,392 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 02:14:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:23,401 INFO L225 Difference]: With dead ends: 1765 [2022-11-03 02:14:23,401 INFO L226 Difference]: Without dead ends: 1765 [2022-11-03 02:14:23,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:14:23,402 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 166 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:23,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 118 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2022-11-03 02:14:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1057. [2022-11-03 02:14:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1043 states have (on average 1.9865771812080537) internal successors, (2072), 1056 states have internal predecessors, (2072), 0 states have call successors, (0), 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:14:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 2072 transitions. [2022-11-03 02:14:23,437 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 2072 transitions. Word has length 31 [2022-11-03 02:14:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:23,438 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 2072 transitions. [2022-11-03 02:14:23,438 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 02:14:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 2072 transitions. [2022-11-03 02:14:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:14:23,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:23,439 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 02:14:23,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:23,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-03 02:14:23,654 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1324895332, now seen corresponding path program 2 times [2022-11-03 02:14:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:23,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622430198] [2022-11-03 02:14:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:24,798 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 02:14:24,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:24,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622430198] [2022-11-03 02:14:24,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622430198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:24,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976174203] [2022-11-03 02:14:24,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:14:24,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:24,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:24,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:24,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:14:24,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:14:24,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:14:24,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 02:14:24,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:24,999 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:14:25,096 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 02:14:25,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:14:25,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976174203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:25,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:14:25,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 16 [2022-11-03 02:14:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33131710] [2022-11-03 02:14:25,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:25,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:14:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:25,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:14:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:14:25,103 INFO L87 Difference]: Start difference. First operand 1057 states and 2072 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 02:14:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:25,298 INFO L93 Difference]: Finished difference Result 1791 states and 3527 transitions. [2022-11-03 02:14:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:25,299 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 02:14:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:25,307 INFO L225 Difference]: With dead ends: 1791 [2022-11-03 02:14:25,308 INFO L226 Difference]: Without dead ends: 1791 [2022-11-03 02:14:25,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:14:25,309 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 140 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:25,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 148 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2022-11-03 02:14:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1044. [2022-11-03 02:14:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1030 states have (on average 1.9864077669902913) internal successors, (2046), 1043 states have internal predecessors, (2046), 0 states have call successors, (0), 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:14:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2046 transitions. [2022-11-03 02:14:25,344 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 2046 transitions. Word has length 31 [2022-11-03 02:14:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:25,344 INFO L495 AbstractCegarLoop]: Abstraction has 1044 states and 2046 transitions. [2022-11-03 02:14:25,344 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 02:14:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 2046 transitions. [2022-11-03 02:14:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:14:25,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:25,346 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 02:14:25,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 02:14:25,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:25,563 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:25,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1251394592, now seen corresponding path program 3 times [2022-11-03 02:14:25,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:25,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703987830] [2022-11-03 02:14:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:25,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:26,604 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 02:14:26,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:26,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703987830] [2022-11-03 02:14:26,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703987830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:26,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179502834] [2022-11-03 02:14:26,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:14:26,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:26,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:26,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:26,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:14:26,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:14:26,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:14:26,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 02:14:26,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:26,874 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:14:26,933 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 02:14:26,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:14:26,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179502834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:26,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:14:26,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 16 [2022-11-03 02:14:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603772052] [2022-11-03 02:14:26,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:26,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:14:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:14:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:14:26,937 INFO L87 Difference]: Start difference. First operand 1044 states and 2046 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 02:14:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:27,139 INFO L93 Difference]: Finished difference Result 2510 states and 4934 transitions. [2022-11-03 02:14:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:14:27,140 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 02:14:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:27,150 INFO L225 Difference]: With dead ends: 2510 [2022-11-03 02:14:27,150 INFO L226 Difference]: Without dead ends: 2510 [2022-11-03 02:14:27,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:14:27,151 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 203 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:27,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 120 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:14:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2022-11-03 02:14:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 1087. [2022-11-03 02:14:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1073 states have (on average 1.9869524697110903) internal successors, (2132), 1086 states have internal predecessors, (2132), 0 states have call successors, (0), 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:14:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 2132 transitions. [2022-11-03 02:14:27,201 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 2132 transitions. Word has length 31 [2022-11-03 02:14:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:27,201 INFO L495 AbstractCegarLoop]: Abstraction has 1087 states and 2132 transitions. [2022-11-03 02:14:27,201 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 02:14:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 2132 transitions. [2022-11-03 02:14:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:14:27,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:27,203 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, 1, 1, 1, 1] [2022-11-03 02:14:27,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:27,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:14:27,430 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash 729248132, now seen corresponding path program 1 times [2022-11-03 02:14:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:27,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821176291] [2022-11-03 02:14:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:14:27,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:27,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821176291] [2022-11-03 02:14:27,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821176291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:27,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986630064] [2022-11-03 02:14:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:27,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:27,513 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:27,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:14:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:27,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:14:27,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:14:27,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:14:27,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986630064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:27,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [935277159] [2022-11-03 02:14:27,714 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:14:27,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:14:27,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-03 02:14:27,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296429184] [2022-11-03 02:14:27,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:14:27,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:14:27,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:27,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:14:27,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:14:27,718 INFO L87 Difference]: Start difference. First operand 1087 states and 2132 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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:14:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:27,848 INFO L93 Difference]: Finished difference Result 2461 states and 4880 transitions. [2022-11-03 02:14:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:27,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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 02:14:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:27,860 INFO L225 Difference]: With dead ends: 2461 [2022-11-03 02:14:27,860 INFO L226 Difference]: Without dead ends: 2461 [2022-11-03 02:14:27,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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 02:14:27,862 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 168 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:27,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 166 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2022-11-03 02:14:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2312. [2022-11-03 02:14:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2312 states, 2298 states have (on average 2.058746736292428) internal successors, (4731), 2311 states have internal predecessors, (4731), 0 states have call successors, (0), 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:14:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 4731 transitions. [2022-11-03 02:14:27,960 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 4731 transitions. Word has length 35 [2022-11-03 02:14:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:27,960 INFO L495 AbstractCegarLoop]: Abstraction has 2312 states and 4731 transitions. [2022-11-03 02:14:27,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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:14:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 4731 transitions. [2022-11-03 02:14:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:14:27,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:27,961 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 02:14:28,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-03 02:14:28,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:28,191 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:28,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1147915620, now seen corresponding path program 1 times [2022-11-03 02:14:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:28,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390209128] [2022-11-03 02:14:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:28,481 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 02:14:28,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:28,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390209128] [2022-11-03 02:14:28,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390209128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:28,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:14:28,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:14:28,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100747795] [2022-11-03 02:14:28,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:28,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:14:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:28,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:14:28,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:14:28,483 INFO L87 Difference]: Start difference. First operand 2312 states and 4731 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 02:14:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:28,814 INFO L93 Difference]: Finished difference Result 2646 states and 5385 transitions. [2022-11-03 02:14:28,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:14:28,815 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 02:14:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:28,826 INFO L225 Difference]: With dead ends: 2646 [2022-11-03 02:14:28,826 INFO L226 Difference]: Without dead ends: 2646 [2022-11-03 02:14:28,827 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 02:14:28,827 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:28,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 38 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:14:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2022-11-03 02:14:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2494. [2022-11-03 02:14:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2481 states have (on average 2.047964530431278) internal successors, (5081), 2493 states have internal predecessors, (5081), 0 states have call successors, (0), 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:14:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 5081 transitions. [2022-11-03 02:14:28,942 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 5081 transitions. Word has length 35 [2022-11-03 02:14:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:28,943 INFO L495 AbstractCegarLoop]: Abstraction has 2494 states and 5081 transitions. [2022-11-03 02:14:28,943 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 02:14:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 5081 transitions. [2022-11-03 02:14:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:14:28,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:28,946 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:14:28,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:14:28,946 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:28,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:28,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1640230685, now seen corresponding path program 1 times [2022-11-03 02:14:28,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:28,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634335056] [2022-11-03 02:14:28,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:28,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:29,681 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:14:29,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:29,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634335056] [2022-11-03 02:14:29,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634335056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:29,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115024382] [2022-11-03 02:14:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:29,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:29,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:29,687 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:29,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:14:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:29,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:14:29,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:30,233 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:14:30,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:30,287 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:14:30,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:30,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:30,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:30,389 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:14:30,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:30,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:30,444 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:14:30,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:30,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:30,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:30,497 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:14:30,541 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:14:30,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:31,066 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:14:31,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115024382] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:31,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [533101698] [2022-11-03 02:14:31,066 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:14:31,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:14:31,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-03 02:14:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461125224] [2022-11-03 02:14:31,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:14:31,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 02:14:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 02:14:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2022-11-03 02:14:31,070 INFO L87 Difference]: Start difference. First operand 2494 states and 5081 transitions. Second operand has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 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:14:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:35,814 INFO L93 Difference]: Finished difference Result 10958 states and 22208 transitions. [2022-11-03 02:14:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-03 02:14:35,815 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 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:14:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:35,864 INFO L225 Difference]: With dead ends: 10958 [2022-11-03 02:14:35,864 INFO L226 Difference]: Without dead ends: 10950 [2022-11-03 02:14:35,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=676, Invalid=2864, Unknown=0, NotChecked=0, Total=3540 [2022-11-03 02:14:35,866 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1033 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 3510 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 4523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 3510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:35,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 273 Invalid, 4523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 3510 Invalid, 0 Unknown, 726 Unchecked, 3.2s Time] [2022-11-03 02:14:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2022-11-03 02:14:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 5234. [2022-11-03 02:14:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5221 states have (on average 2.1271787013981998) internal successors, (11106), 5233 states have internal predecessors, (11106), 0 states have call successors, (0), 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:14:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 11106 transitions. [2022-11-03 02:14:36,093 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 11106 transitions. Word has length 45 [2022-11-03 02:14:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:36,093 INFO L495 AbstractCegarLoop]: Abstraction has 5234 states and 11106 transitions. [2022-11-03 02:14:36,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 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:14:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 11106 transitions. [2022-11-03 02:14:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:14:36,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:36,096 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:14:36,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:36,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:14:36,310 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:36,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:36,311 INFO L85 PathProgramCache]: Analyzing trace with hash -813798765, now seen corresponding path program 1 times [2022-11-03 02:14:36,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:36,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186648493] [2022-11-03 02:14:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:36,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:37,792 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:14:37,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:37,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186648493] [2022-11-03 02:14:37,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186648493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:37,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070631654] [2022-11-03 02:14:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:37,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:37,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:37,795 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:37,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:14:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:37,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:14:37,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:38,265 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:14:38,320 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:14:38,372 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:14:38,446 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:14:38,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,663 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:14:38,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,701 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:14:38,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,756 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:14:38,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,793 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:14:38,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:38,943 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 53 treesize of output 64 [2022-11-03 02:14:39,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:14:39,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:41,917 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:14:41,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070631654] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:41,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1498277479] [2022-11-03 02:14:41,918 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:14:41,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:14:41,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2022-11-03 02:14:41,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576860366] [2022-11-03 02:14:41,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:14:41,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:14:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:14:41,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:14:41,920 INFO L87 Difference]: Start difference. First operand 5234 states and 11106 transitions. Second operand has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:14:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:47,060 INFO L93 Difference]: Finished difference Result 10144 states and 20903 transitions. [2022-11-03 02:14:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-03 02:14:47,061 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:14:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:47,089 INFO L225 Difference]: With dead ends: 10144 [2022-11-03 02:14:47,089 INFO L226 Difference]: Without dead ends: 10144 [2022-11-03 02:14:47,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=703, Invalid=3079, Unknown=0, NotChecked=0, Total=3782 [2022-11-03 02:14:47,091 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 839 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1997 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:47,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 307 Invalid, 3609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1502 Invalid, 0 Unknown, 1997 Unchecked, 1.5s Time] [2022-11-03 02:14:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10144 states. [2022-11-03 02:14:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10144 to 7508. [2022-11-03 02:14:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7508 states, 7495 states have (on average 2.162508338892595) internal successors, (16208), 7507 states have internal predecessors, (16208), 0 states have call successors, (0), 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:14:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7508 states to 7508 states and 16208 transitions. [2022-11-03 02:14:47,346 INFO L78 Accepts]: Start accepts. Automaton has 7508 states and 16208 transitions. Word has length 45 [2022-11-03 02:14:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:47,347 INFO L495 AbstractCegarLoop]: Abstraction has 7508 states and 16208 transitions. [2022-11-03 02:14:47,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:14:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7508 states and 16208 transitions. [2022-11-03 02:14:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:14:47,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:47,350 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:14:47,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:47,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 02:14:47,566 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2109162849, now seen corresponding path program 1 times [2022-11-03 02:14:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:47,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831874764] [2022-11-03 02:14:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:47,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:48,370 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:14:48,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:48,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831874764] [2022-11-03 02:14:48,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831874764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:48,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527500597] [2022-11-03 02:14:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:48,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:48,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:48,376 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:48,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:14:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:48,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:14:48,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:48,969 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:14:49,018 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:14:49,071 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:14:49,138 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:14:49,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:49,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:49,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:49,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:49,217 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:14:49,263 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:14:49,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:50,412 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:14:50,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527500597] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:50,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1292721666] [2022-11-03 02:14:50,413 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:14:50,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:14:50,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 02:14:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785870111] [2022-11-03 02:14:50,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:14:50,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:14:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:50,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:14:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-11-03 02:14:50,416 INFO L87 Difference]: Start difference. First operand 7508 states and 16208 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:14:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:55,628 INFO L93 Difference]: Finished difference Result 13370 states and 27672 transitions. [2022-11-03 02:14:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-03 02:14:55,629 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:14:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:55,668 INFO L225 Difference]: With dead ends: 13370 [2022-11-03 02:14:55,669 INFO L226 Difference]: Without dead ends: 13370 [2022-11-03 02:14:55,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=835, Invalid=3587, Unknown=0, NotChecked=0, Total=4422 [2022-11-03 02:14:55,671 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 937 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 4139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1391 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:55,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 275 Invalid, 4139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2604 Invalid, 0 Unknown, 1391 Unchecked, 2.3s Time] [2022-11-03 02:14:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13370 states. [2022-11-03 02:14:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13370 to 8048. [2022-11-03 02:14:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8048 states, 8035 states have (on average 2.1600497822028624) internal successors, (17356), 8047 states have internal predecessors, (17356), 0 states have call successors, (0), 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:14:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8048 states to 8048 states and 17356 transitions. [2022-11-03 02:14:55,968 INFO L78 Accepts]: Start accepts. Automaton has 8048 states and 17356 transitions. Word has length 45 [2022-11-03 02:14:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:55,968 INFO L495 AbstractCegarLoop]: Abstraction has 8048 states and 17356 transitions. [2022-11-03 02:14:55,969 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:14:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 8048 states and 17356 transitions. [2022-11-03 02:14:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:14:55,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:55,975 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:14:56,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:56,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:14:56,190 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:56,191 INFO L85 PathProgramCache]: Analyzing trace with hash 892611103, now seen corresponding path program 2 times [2022-11-03 02:14:56,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:56,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040825237] [2022-11-03 02:14:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:56,912 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:14:56,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:56,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040825237] [2022-11-03 02:14:56,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040825237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:56,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847075473] [2022-11-03 02:14:56,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:14:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:56,915 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:56,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:14:57,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:14:57,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:14:57,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:14:57,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:57,263 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:14:57,486 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:14:57,542 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:14:57,631 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:14:57,718 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:14:57,814 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:14:57,814 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:14:57,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:57,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:57,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:57,934 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:14:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:14:57,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:59,126 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 21 treesize of output 19 [2022-11-03 02:14:59,130 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 19 treesize of output 12 [2022-11-03 02:14:59,140 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:14:59,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847075473] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:59,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:14:59,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-11-03 02:14:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140371827] [2022-11-03 02:14:59,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:59,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:14:59,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:59,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:14:59,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:14:59,142 INFO L87 Difference]: Start difference. First operand 8048 states and 17356 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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:14:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:59,236 INFO L93 Difference]: Finished difference Result 10930 states and 23360 transitions. [2022-11-03 02:14:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:14:59,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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:14:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:59,267 INFO L225 Difference]: With dead ends: 10930 [2022-11-03 02:14:59,268 INFO L226 Difference]: Without dead ends: 10930 [2022-11-03 02:14:59,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:14:59,269 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:59,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 160 Unchecked, 0.0s Time] [2022-11-03 02:14:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2022-11-03 02:14:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 8213. [2022-11-03 02:14:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8213 states, 8200 states have (on average 2.1685365853658536) internal successors, (17782), 8212 states have internal predecessors, (17782), 0 states have call successors, (0), 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:14:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8213 states to 8213 states and 17782 transitions. [2022-11-03 02:14:59,557 INFO L78 Accepts]: Start accepts. Automaton has 8213 states and 17782 transitions. Word has length 45 [2022-11-03 02:14:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:59,558 INFO L495 AbstractCegarLoop]: Abstraction has 8213 states and 17782 transitions. [2022-11-03 02:14:59,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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:14:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 8213 states and 17782 transitions. [2022-11-03 02:14:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:14:59,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:59,561 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:14:59,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:59,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 02:14:59,777 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:14:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1003433623, now seen corresponding path program 3 times [2022-11-03 02:14:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:59,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044594001] [2022-11-03 02:14:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:00,472 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:15:00,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:00,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044594001] [2022-11-03 02:15:00,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044594001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:00,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708995988] [2022-11-03 02:15:00,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:15:00,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:00,474 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:00,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:15:00,902 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:15:00,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:15:00,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:15:00,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:01,186 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:15:01,275 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:15:01,330 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:15:01,449 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:15:01,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:01,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:01,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:01,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:01,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 46 treesize of output 54 [2022-11-03 02:15:01,587 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:15:01,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:15,825 WARN L234 SmtUtils]: Spent 9.74s 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:15:40,296 WARN L234 SmtUtils]: Spent 12.68s on a formula simplification. DAG size of input: 43 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:15:57,594 WARN L234 SmtUtils]: Spent 5.77s 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 02:16:03,904 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:16:03,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708995988] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:16:03,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2030345068] [2022-11-03 02:16:03,905 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:16:03,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:16:03,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 02:16:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43610602] [2022-11-03 02:16:03,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:03,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:16:03,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:03,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:16:03,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=839, Unknown=16, NotChecked=0, Total=992 [2022-11-03 02:16:03,907 INFO L87 Difference]: Start difference. First operand 8213 states and 17782 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:16:22,510 WARN L234 SmtUtils]: Spent 14.51s on a formula simplification. DAG size of input: 49 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:16:24,551 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (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|) (+ |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 ((.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_494| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_494|) (forall ((v_ArrVal_1548 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_494| v_ArrVal_1548)) |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_494| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_494|) (forall ((v_ArrVal_1548 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_494| v_ArrVal_1548)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))))) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| (+ |c_ULTIMATE.start_main_~i~2#1| 1))))) is different from false [2022-11-03 02:16:26,583 WARN L833 $PredicateComparison]: unable to prove that (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |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_494| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_494|) (forall ((v_ArrVal_1548 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_494| v_ArrVal_1548)) |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_494| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_494|) (forall ((v_ArrVal_1548 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_494| v_ArrVal_1548)) |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_494| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_494|) (forall ((v_ArrVal_1548 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_494| v_ArrVal_1548)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))))) (< |c_t_funThread1of1ForFork0_~i~0#1| (+ |c_ULTIMATE.start_main_~i~2#1| 1))))) is different from false [2022-11-03 02:16:47,806 WARN L234 SmtUtils]: Spent 14.61s on a formula simplification. DAG size of input: 46 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:17:08,999 WARN L234 SmtUtils]: Spent 15.68s on a formula simplification. DAG size of input: 49 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:17:11,014 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (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|) (+ |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 ((.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_494| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_494|) (forall ((v_ArrVal_1548 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_494| v_ArrVal_1548)) |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_494| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_494|) (forall ((v_ArrVal_1548 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_494| v_ArrVal_1548)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))))) (< |c_t_funThread1of1ForFork0_~i~0#1| (+ |c_ULTIMATE.start_main_~i~2#1| 1))))) is different from false [2022-11-03 02:17:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:11,648 INFO L93 Difference]: Finished difference Result 21316 states and 44604 transitions. [2022-11-03 02:17:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-03 02:17:11,648 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:17:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:11,716 INFO L225 Difference]: With dead ends: 21316 [2022-11-03 02:17:11,716 INFO L226 Difference]: Without dead ends: 21316 [2022-11-03 02:17:11,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 126.3s TimeCoverageRelationStatistics Valid=973, Invalid=4128, Unknown=23, NotChecked=426, Total=5550 [2022-11-03 02:17:11,718 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1247 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 4055 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 6978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 4055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2759 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:11,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 648 Invalid, 6978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 4055 Invalid, 0 Unknown, 2759 Unchecked, 3.6s Time] [2022-11-03 02:17:11,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21316 states. [2022-11-03 02:17:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21316 to 14513. [2022-11-03 02:17:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14513 states, 14500 states have (on average 2.2071724137931032) internal successors, (32004), 14512 states have internal predecessors, (32004), 0 states have call successors, (0), 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:17:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14513 states to 14513 states and 32004 transitions. [2022-11-03 02:17:12,225 INFO L78 Accepts]: Start accepts. Automaton has 14513 states and 32004 transitions. Word has length 45 [2022-11-03 02:17:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:12,225 INFO L495 AbstractCegarLoop]: Abstraction has 14513 states and 32004 transitions. [2022-11-03 02:17:12,226 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:17:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 14513 states and 32004 transitions. [2022-11-03 02:17:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:17:12,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:12,229 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:17:12,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:17:12,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:17:12,454 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:17:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 947427717, now seen corresponding path program 4 times [2022-11-03 02:17:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:12,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270828714] [2022-11-03 02:17:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:13,163 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:17:13,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:13,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270828714] [2022-11-03 02:17:13,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270828714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:17:13,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576266727] [2022-11-03 02:17:13,164 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:17:13,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:17:13,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:17:13,165 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:17:13,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:17:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:13,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:17:13,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:17:13,626 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:17:13,670 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:17:13,825 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:17:13,883 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:17:13,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:17:13,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:17:13,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:17:13,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:17:13,987 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:17:14,031 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:17:14,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:17:41,155 WARN L234 SmtUtils]: Spent 12.21s 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:17:42,675 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse1 (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 ((.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_495| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_495|) (forall ((v_ArrVal_1700 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_495| v_ArrVal_1700)) |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_495| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_495|) (forall ((v_ArrVal_1700 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_495| v_ArrVal_1700)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))))))))) is different from false [2022-11-03 02:17:44,879 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 02:17:44,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576266727] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:17:44,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1755043188] [2022-11-03 02:17:44,879 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:17:44,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:17:44,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 02:17:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792711562] [2022-11-03 02:17:44,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:17:44,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:17:44,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:17:44,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=4, NotChecked=58, Total=992 [2022-11-03 02:17:44,882 INFO L87 Difference]: Start difference. First operand 14513 states and 32004 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:17:46,353 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 ((.cse1 (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 ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse2 (select .cse1 |c_~#cache~0.base|))) (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_495| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_495|) (forall ((v_ArrVal_1700 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_495| v_ArrVal_1700)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))) (= |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_495| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_495|) (forall ((v_ArrVal_1700 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_495| v_ArrVal_1700)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))) (= |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:17:48,374 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 ((.cse1 (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 ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse2 (select .cse1 |c_~#cache~0.base|))) (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_495| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_495|) (forall ((v_ArrVal_1700 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_495| v_ArrVal_1700)) |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 .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_495| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_495|) (forall ((v_ArrVal_1700 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_495| v_ArrVal_1700)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))) (= |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:18:05,934 WARN L234 SmtUtils]: Spent 15.94s on a formula simplification. DAG size of input: 49 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:18:07,974 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (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|) (+ |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 ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_495| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_495|) (forall ((v_ArrVal_1700 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_495| v_ArrVal_1700)) |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_495| Int)) (or (forall ((v_ArrVal_1700 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_495| v_ArrVal_1700)) |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_495|))) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| (+ |c_ULTIMATE.start_main_~i~2#1| 1))))) is different from false [2022-11-03 02:18:22,998 WARN L234 SmtUtils]: Spent 14.13s on a formula simplification. DAG size of input: 46 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:18:40,097 WARN L234 SmtUtils]: Spent 16.80s on a formula simplification. DAG size of input: 49 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:19:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:06,785 INFO L93 Difference]: Finished difference Result 42884 states and 93426 transitions. [2022-11-03 02:19:06,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-03 02:19:06,786 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:19:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:06,911 INFO L225 Difference]: With dead ends: 42884 [2022-11-03 02:19:06,911 INFO L226 Difference]: Without dead ends: 42884 [2022-11-03 02:19:06,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 110.2s TimeCoverageRelationStatistics Valid=778, Invalid=4477, Unknown=17, NotChecked=580, Total=5852 [2022-11-03 02:19:06,914 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 1060 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 5099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2248 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:06,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 652 Invalid, 5099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 2611 Invalid, 0 Unknown, 2248 Unchecked, 2.4s Time] [2022-11-03 02:19:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42884 states. [2022-11-03 02:19:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42884 to 27481. [2022-11-03 02:19:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27481 states, 27468 states have (on average 2.23248871414009) internal successors, (61322), 27480 states have internal predecessors, (61322), 0 states have call successors, (0), 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:19:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27481 states to 27481 states and 61322 transitions. [2022-11-03 02:19:07,930 INFO L78 Accepts]: Start accepts. Automaton has 27481 states and 61322 transitions. Word has length 45 [2022-11-03 02:19:07,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:07,930 INFO L495 AbstractCegarLoop]: Abstraction has 27481 states and 61322 transitions. [2022-11-03 02:19:07,930 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:19:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27481 states and 61322 transitions. [2022-11-03 02:19:07,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:19:07,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:07,933 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:19:07,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:08,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:08,158 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:19:08,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash 920074001, now seen corresponding path program 5 times [2022-11-03 02:19:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:08,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677868396] [2022-11-03 02:19:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:09,036 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:19:09,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:09,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677868396] [2022-11-03 02:19:09,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677868396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:19:09,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481290994] [2022-11-03 02:19:09,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:19:09,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:09,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:09,039 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:09,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:19:09,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:19:09,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:19:09,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:19:09,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:09,444 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:19:09,623 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:19:09,696 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:19:09,696 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:19:09,752 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:19:09,810 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:19:09,899 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:19:10,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:10,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:10,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:10,006 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:19:10,063 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:19:10,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:11,528 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 21 treesize of output 19 [2022-11-03 02:19:11,532 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 19 treesize of output 12 [2022-11-03 02:19:11,540 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:19:11,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481290994] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:19:11,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:11,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-11-03 02:19:11,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580388013] [2022-11-03 02:19:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:19:11,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:19:11,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:11,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:19:11,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:19:11,544 INFO L87 Difference]: Start difference. First operand 27481 states and 61322 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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:19:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:12,384 INFO L93 Difference]: Finished difference Result 34520 states and 76779 transitions. [2022-11-03 02:19:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:19:12,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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:19:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:12,464 INFO L225 Difference]: With dead ends: 34520 [2022-11-03 02:19:12,464 INFO L226 Difference]: Without dead ends: 34520 [2022-11-03 02:19:12,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-11-03 02:19:12,465 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:12,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 39 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 297 Unchecked, 0.3s Time] [2022-11-03 02:19:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34520 states. [2022-11-03 02:19:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34520 to 27595. [2022-11-03 02:19:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27595 states, 27582 states have (on average 2.2315278079907186) internal successors, (61550), 27594 states have internal predecessors, (61550), 0 states have call successors, (0), 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:19:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27595 states to 27595 states and 61550 transitions. [2022-11-03 02:19:13,499 INFO L78 Accepts]: Start accepts. Automaton has 27595 states and 61550 transitions. Word has length 45 [2022-11-03 02:19:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:13,500 INFO L495 AbstractCegarLoop]: Abstraction has 27595 states and 61550 transitions. [2022-11-03 02:19:13,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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:19:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27595 states and 61550 transitions. [2022-11-03 02:19:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:19:13,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:13,503 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:19:13,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:13,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:13,719 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:19:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 920823581, now seen corresponding path program 6 times [2022-11-03 02:19:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:13,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008516264] [2022-11-03 02:19:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:14,674 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:19:14,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:14,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008516264] [2022-11-03 02:19:14,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008516264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:19:14,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20310694] [2022-11-03 02:19:14,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:19:14,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:14,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:14,676 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:14,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 02:19:15,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:19:15,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:19:15,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 02:19:15,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:15,367 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:19:15,481 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:19:15,546 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:19:15,640 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:19:15,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:15,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:15,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:15,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:15,719 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:19:15,765 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:19:15,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:17,127 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:19:17,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20310694] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:17,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1608252514] [2022-11-03 02:19:17,128 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:19:17,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:19:17,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 02:19:17,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730362559] [2022-11-03 02:19:17,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:17,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:19:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:17,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:19:17,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2022-11-03 02:19:17,133 INFO L87 Difference]: Start difference. First operand 27595 states and 61550 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:19:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:21,557 INFO L93 Difference]: Finished difference Result 39336 states and 86951 transitions. [2022-11-03 02:19:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-03 02:19:21,557 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:19:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:21,670 INFO L225 Difference]: With dead ends: 39336 [2022-11-03 02:19:21,670 INFO L226 Difference]: Without dead ends: 39336 [2022-11-03 02:19:21,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=596, Invalid=2710, Unknown=0, NotChecked=0, Total=3306 [2022-11-03 02:19:21,672 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 648 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 4091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1519 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:21,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 326 Invalid, 4091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2418 Invalid, 0 Unknown, 1519 Unchecked, 2.3s Time] [2022-11-03 02:19:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39336 states. [2022-11-03 02:19:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39336 to 34191. [2022-11-03 02:19:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34191 states, 34178 states have (on average 2.2444554976885716) internal successors, (76711), 34190 states have internal predecessors, (76711), 0 states have call successors, (0), 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:19:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34191 states to 34191 states and 76711 transitions. [2022-11-03 02:19:22,751 INFO L78 Accepts]: Start accepts. Automaton has 34191 states and 76711 transitions. Word has length 45 [2022-11-03 02:19:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:22,752 INFO L495 AbstractCegarLoop]: Abstraction has 34191 states and 76711 transitions. [2022-11-03 02:19:22,752 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:19:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 34191 states and 76711 transitions. [2022-11-03 02:19:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:19:22,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:22,755 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:19:22,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:22,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:22,982 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:19:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash -53663995, now seen corresponding path program 2 times [2022-11-03 02:19:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:22,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683855268] [2022-11-03 02:19:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:22,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:24,782 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:19:24,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:24,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683855268] [2022-11-03 02:19:24,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683855268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:19:24,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925866008] [2022-11-03 02:19:24,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:19:24,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:24,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:24,787 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:24,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:19:24,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:19:24,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:19:25,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 02:19:25,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:25,097 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:19:25,153 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:19:25,213 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:19:25,285 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:19:25,373 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:19:25,373 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:19:25,434 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:19:25,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,536 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:19:25,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,580 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:19:25,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,620 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:19:25,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,657 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:19:25,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:25,936 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:19:30,081 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:19:30,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:33,520 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 21 treesize of output 19 [2022-11-03 02:19:33,524 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 19 treesize of output 12 [2022-11-03 02:19:33,536 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:19:33,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925866008] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:19:33,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:33,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 11] total 32 [2022-11-03 02:19:33,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250494603] [2022-11-03 02:19:33,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:19:33,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:19:33,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:19:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=886, Unknown=3, NotChecked=0, Total=1056 [2022-11-03 02:19:33,538 INFO L87 Difference]: Start difference. First operand 34191 states and 76711 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:19:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:35,141 INFO L93 Difference]: Finished difference Result 59808 states and 131891 transitions. [2022-11-03 02:19:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:19:35,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:19:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:35,292 INFO L225 Difference]: With dead ends: 59808 [2022-11-03 02:19:35,292 INFO L226 Difference]: Without dead ends: 59808 [2022-11-03 02:19:35,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=189, Invalid=1068, Unknown=3, NotChecked=0, Total=1260 [2022-11-03 02:19:35,293 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 836 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:35,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 53 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 836 Unchecked, 0.2s Time] [2022-11-03 02:19:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59808 states. [2022-11-03 02:19:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59808 to 34639. [2022-11-03 02:19:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34639 states, 34626 states have (on average 2.2412926702477907) internal successors, (77607), 34638 states have internal predecessors, (77607), 0 states have call successors, (0), 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:19:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34639 states to 34639 states and 77607 transitions. [2022-11-03 02:19:36,646 INFO L78 Accepts]: Start accepts. Automaton has 34639 states and 77607 transitions. Word has length 45 [2022-11-03 02:19:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:36,646 INFO L495 AbstractCegarLoop]: Abstraction has 34639 states and 77607 transitions. [2022-11-03 02:19:36,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:19:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 34639 states and 77607 transitions. [2022-11-03 02:19:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:19:36,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:36,650 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:19:36,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:36,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:36,858 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:19:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1619966761, now seen corresponding path program 3 times [2022-11-03 02:19:36,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:36,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005995030] [2022-11-03 02:19:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:38,447 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:19:38,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:38,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005995030] [2022-11-03 02:19:38,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005995030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:19:38,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685621735] [2022-11-03 02:19:38,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:19:38,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:38,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:38,449 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:38,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 02:19:38,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:19:38,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:19:38,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-03 02:19:38,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:39,112 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:19:39,156 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:19:39,213 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:19:39,337 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:19:39,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,409 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:19:39,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,454 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:19:39,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,490 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:19:39,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,523 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:19:39,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:39,742 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:19:45,889 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:19:45,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:20:27,777 WARN L234 SmtUtils]: Spent 14.42s on a formula simplification. DAG size of input: 53 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:20:29,830 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse1 (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (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_499| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |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_499| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0)))))))) is different from false [2022-11-03 02:20:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-11-03 02:20:53,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685621735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:20:53,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [468650813] [2022-11-03 02:20:53,823 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:20:53,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:20:53,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 37 [2022-11-03 02:20:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119602657] [2022-11-03 02:20:53,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:20:53,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 02:20:53,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:53,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 02:20:53,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1128, Unknown=23, NotChecked=70, Total=1406 [2022-11-03 02:20:53,834 INFO L87 Difference]: Start difference. First operand 34639 states and 77607 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 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:20:56,820 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))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (let ((.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse3 (select .cse2 |c_~#cache~0.base|)) (.cse4 (+ |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_499| Int)) (or (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |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_499| Int)) (or (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| Int)) (or (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 .cse4) 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:21:08,465 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))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (let ((.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse3 (select .cse2 |c_~#cache~0.base|)) (.cse4 (+ |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_499| Int)) (or (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |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_499| Int)) (or (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| Int)) (or (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)))) (= (select .cse0 .cse4) 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:21:31,329 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse1 (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse2 (select .cse1 |c_~#cache~0.base|))) (and (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |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_499| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0)))) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| (+ |c_ULTIMATE.start_main_~i~2#1| 1)))))) is different from false [2022-11-03 02:21:57,211 WARN L234 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:22:18,477 WARN L234 SmtUtils]: Spent 10.55s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:22:35,990 WARN L234 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 61 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:23:05,650 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse1 (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (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_499| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |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_499| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) (forall ((v_ArrVal_2328 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_499| v_ArrVal_2328)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0)))) (< |c_t_funThread1of1ForFork0_~i~0#1| (+ |c_ULTIMATE.start_main_~i~2#1| 1)))))) is different from false [2022-11-03 02:23:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:23:09,522 INFO L93 Difference]: Finished difference Result 102787 states and 228739 transitions. [2022-11-03 02:23:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-03 02:23:09,523 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 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:23:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:23:09,753 INFO L225 Difference]: With dead ends: 102787 [2022-11-03 02:23:09,753 INFO L226 Difference]: Without dead ends: 102787 [2022-11-03 02:23:09,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 95 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3125 ImplicationChecksByTransitivity, 206.4s TimeCoverageRelationStatistics Valid=1288, Invalid=7048, Unknown=56, NotChecked=920, Total=9312 [2022-11-03 02:23:09,755 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1384 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 2752 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 6135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3124 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:23:09,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 690 Invalid, 6135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 2752 Invalid, 0 Unknown, 3124 Unchecked, 2.9s Time] [2022-11-03 02:23:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102787 states. [2022-11-03 02:23:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102787 to 64747. [2022-11-03 02:23:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64747 states, 64734 states have (on average 2.2549819260357773) internal successors, (145974), 64746 states have internal predecessors, (145974), 0 states have call successors, (0), 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:23:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64747 states to 64747 states and 145974 transitions. [2022-11-03 02:23:12,031 INFO L78 Accepts]: Start accepts. Automaton has 64747 states and 145974 transitions. Word has length 45 [2022-11-03 02:23:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:23:12,031 INFO L495 AbstractCegarLoop]: Abstraction has 64747 states and 145974 transitions. [2022-11-03 02:23:12,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 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:23:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 64747 states and 145974 transitions. [2022-11-03 02:23:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:23:12,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:23:12,035 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:23:12,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-03 02:23:12,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:23:12,262 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:23:12,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:23:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash -971419309, now seen corresponding path program 4 times [2022-11-03 02:23:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:23:12,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794048665] [2022-11-03 02:23:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:23:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:13,707 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:23:13,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:23:13,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794048665] [2022-11-03 02:23:13,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794048665] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:23:13,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882516413] [2022-11-03 02:23:13,708 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:23:13,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:23:13,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:23:13,709 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:23:13,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 02:23:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:13,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:23:13,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:14,248 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:23:14,293 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:23:14,396 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:23:14,462 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:23:14,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,552 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:23:14,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,592 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:23:14,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,625 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:23:14,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,655 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:23:14,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:14,792 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 53 treesize of output 64 [2022-11-03 02:23:14,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:23:14,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:23:18,043 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:23:18,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882516413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:23:18,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1333752000] [2022-11-03 02:23:18,043 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:23:18,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:23:18,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2022-11-03 02:23:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480068360] [2022-11-03 02:23:18,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:23:18,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:23:18,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:23:18,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:23:18,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:23:18,046 INFO L87 Difference]: Start difference. First operand 64747 states and 145974 transitions. Second operand has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:23:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:23:23,780 INFO L93 Difference]: Finished difference Result 68594 states and 153746 transitions. [2022-11-03 02:23:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 02:23:23,781 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:23:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:23:23,923 INFO L225 Difference]: With dead ends: 68594 [2022-11-03 02:23:23,923 INFO L226 Difference]: Without dead ends: 68594 [2022-11-03 02:23:23,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=582, Invalid=2724, Unknown=0, NotChecked=0, Total=3306 [2022-11-03 02:23:23,925 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 620 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1239 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:23:23,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 400 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1923 Invalid, 0 Unknown, 1239 Unchecked, 1.8s Time] [2022-11-03 02:23:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68594 states. [2022-11-03 02:23:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68594 to 64900. [2022-11-03 02:23:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64900 states, 64887 states have (on average 2.2545193952563687) internal successors, (146289), 64899 states have internal predecessors, (146289), 0 states have call successors, (0), 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:23:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64900 states to 64900 states and 146289 transitions. [2022-11-03 02:23:25,778 INFO L78 Accepts]: Start accepts. Automaton has 64900 states and 146289 transitions. Word has length 45 [2022-11-03 02:23:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:23:25,778 INFO L495 AbstractCegarLoop]: Abstraction has 64900 states and 146289 transitions. [2022-11-03 02:23:25,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:23:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 64900 states and 146289 transitions. [2022-11-03 02:23:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:23:25,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:23:25,781 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:23:25,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 02:23:25,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 02:23:25,994 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:23:25,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:23:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash -204692717, now seen corresponding path program 5 times [2022-11-03 02:23:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:23:25,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446894530] [2022-11-03 02:23:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:23:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:27,589 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:23:27,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:23:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446894530] [2022-11-03 02:23:27,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446894530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:23:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488720572] [2022-11-03 02:23:27,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:23:27,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:23:27,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:23:27,599 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:23:27,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 02:23:27,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:23:27,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:23:27,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 02:23:27,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:27,941 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:23:27,999 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:23:28,045 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:23:28,130 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:23:28,130 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:23:28,206 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:23:28,274 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:23:28,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,346 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:23:28,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,388 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:23:28,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,421 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:23:28,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,449 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:23:28,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:28,693 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:23:32,768 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:23:32,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:23:36,203 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 21 treesize of output 19 [2022-11-03 02:23:36,216 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 19 treesize of output 12 [2022-11-03 02:23:36,224 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:23:36,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488720572] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:23:36,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:23:36,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 11] total 32 [2022-11-03 02:23:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269702209] [2022-11-03 02:23:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:23:36,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:23:36,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:23:36,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:23:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=883, Unknown=3, NotChecked=0, Total=1056 [2022-11-03 02:23:36,226 INFO L87 Difference]: Start difference. First operand 64900 states and 146289 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:23:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:23:36,613 INFO L93 Difference]: Finished difference Result 77016 states and 171497 transitions. [2022-11-03 02:23:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:23:36,613 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:23:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:23:36,929 INFO L225 Difference]: With dead ends: 77016 [2022-11-03 02:23:36,930 INFO L226 Difference]: Without dead ends: 77016 [2022-11-03 02:23:36,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=170, Invalid=883, Unknown=3, NotChecked=0, Total=1056 [2022-11-03 02:23:36,931 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 736 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:23:36,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 54 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 736 Unchecked, 0.1s Time] [2022-11-03 02:23:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77016 states. [2022-11-03 02:23:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77016 to 65146. [2022-11-03 02:23:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65146 states, 65133 states have (on average 2.253558104186818) internal successors, (146781), 65145 states have internal predecessors, (146781), 0 states have call successors, (0), 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:23:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65146 states to 65146 states and 146781 transitions. [2022-11-03 02:23:38,680 INFO L78 Accepts]: Start accepts. Automaton has 65146 states and 146781 transitions. Word has length 45 [2022-11-03 02:23:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:23:38,681 INFO L495 AbstractCegarLoop]: Abstraction has 65146 states and 146781 transitions. [2022-11-03 02:23:38,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:23:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 65146 states and 146781 transitions. [2022-11-03 02:23:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:23:38,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:23:38,684 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:23:38,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 02:23:38,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 02:23:38,886 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:23:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:23:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2004368093, now seen corresponding path program 6 times [2022-11-03 02:23:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:23:38,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970887655] [2022-11-03 02:23:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:38,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:23:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:40,543 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:23:40,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:23:40,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970887655] [2022-11-03 02:23:40,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970887655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:23:40,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086148774] [2022-11-03 02:23:40,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:23:40,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:23:40,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:23:40,545 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:23:40,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 02:23:40,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:23:40,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:23:40,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:23:40,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:41,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 11 treesize of output 7 [2022-11-03 02:23:41,133 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:23:41,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:23:41,222 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 02:23:41,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:23:41,278 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 37 treesize of output 42 [2022-11-03 02:23:41,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:23:41,295 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 02:23:41,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:23:41,358 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 6 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:23:41,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:23:41,398 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 6 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:23:41,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:23:41,428 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 6 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:23:41,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:23:41,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:23:41,615 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 21 case distinctions, treesize of input 67 treesize of output 84 [2022-11-03 02:23:41,695 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:23:41,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:23:45,005 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= 0 (select (select (let ((.cse0 (let ((.cse4 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= 0 (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)))) is different from false [2022-11-03 02:23:47,131 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (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|) .cse13 0)))) (and (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse0 (let ((.cse4 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13) 0))))) is different from false [2022-11-03 02:23:49,335 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse15 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (+ .cse15 |c_~#cache~0.offset| 1)) (.cse2 (+ 2 .cse15 |c_~#cache~0.offset|)) (.cse3 (+ 3 .cse15 |c_~#cache~0.offset|)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse7 (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|) .cse12 0))) (.cse4 (+ .cse15 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))))) is different from false [2022-11-03 02:23:51,536 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse15 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse16 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (+ .cse16 |c_~#cache~0.offset| 1)) (.cse2 (+ 2 .cse16 |c_~#cache~0.offset|)) (.cse3 (+ 3 .cse16 |c_~#cache~0.offset|)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse7 (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|) .cse12 0) .cse15 0))) (.cse4 (+ .cse16 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse15) 0))))) is different from false [2022-11-03 02:23:51,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:23:52,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:23:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2022-11-03 02:23:52,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086148774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:23:52,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2113330905] [2022-11-03 02:23:52,282 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:23:52,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:23:52,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 16] total 38 [2022-11-03 02:23:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531020845] [2022-11-03 02:23:52,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:23:52,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 02:23:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:23:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 02:23:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1034, Unknown=4, NotChecked=276, Total=1482 [2022-11-03 02:23:52,284 INFO L87 Difference]: Start difference. First operand 65146 states and 146781 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 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:23:55,029 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse16 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse17 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse2 (+ .cse17 |c_~#cache~0.offset| 1)) (.cse3 (+ 2 .cse17 |c_~#cache~0.offset|)) (.cse4 (+ 3 .cse17 |c_~#cache~0.offset|)) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse13 0) .cse16 0))) (.cse5 (+ .cse17 |c_~#cache~0.offset|))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse1 (let ((.cse6 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 v_ArrVal_2800)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) .cse5 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 v_ArrVal_2800)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) .cse5 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 v_ArrVal_2800)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) .cse5 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 v_ArrVal_2800)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) .cse5 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse16) 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:23:57,106 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse17 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse2 (+ .cse17 |c_~#cache~0.offset| 1)) (.cse3 (+ 2 .cse17 |c_~#cache~0.offset|)) (.cse4 (+ 3 .cse17 |c_~#cache~0.offset|)) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 .cse13 0))) (.cse5 (+ .cse17 |c_~#cache~0.offset|)) (.cse14 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse1 (let ((.cse6 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 v_ArrVal_2800)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) .cse5 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 v_ArrVal_2800)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) .cse5 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 v_ArrVal_2800)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) .cse5 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13) 0)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 .cse14) 0) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse15 (let ((.cse16 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 v_ArrVal_2800)))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) .cse5 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse14) 0)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (< |c_t_funThread1of1ForFork0_~i~0#1| (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-11-03 02:23:59,387 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse15 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse15 0))) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (not (= .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse1 (let ((.cse4 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse0 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)) (= (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8)) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse0 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse2)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse0 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8) 0)) (not (= .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse7 .cse8) 0) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse0 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse15) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse15)) (not (= .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 02:24:01,492 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse9 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (not (= .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (= (select .cse3 .cse2) 0) (= (select .cse3 .cse4) 0) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= 0 (select (select (let ((.cse5 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) .cse0 0) .cse7 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) .cse0 0) .cse7 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9) 0)) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse6)) (not (= .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse1 .cse2) 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 0 (select .cse1 .cse4)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= 0 (select (select (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) .cse0 0) .cse7 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2))) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2800)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) .cse0 0) .cse7 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4)) (not (= .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-11-03 02:24:05,068 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse16 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse3 (+ .cse16 |c_~#cache~0.offset| 1)) (.cse4 (+ 2 .cse16 |c_~#cache~0.offset|)) (.cse5 (+ 3 .cse16 |c_~#cache~0.offset|)) (.cse8 (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|) .cse13 0) .cse1 0))) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse0 (+ .cse16 |c_~#cache~0.offset|))) (and (not (= .cse0 .cse1)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse2 (let ((.cse6 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1) 0)) (< .cse16 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (not (= .cse0 .cse13)) (not (= .cse7 .cse0))))) is different from false [2022-11-03 02:24:07,219 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse16 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse3 (+ .cse16 |c_~#cache~0.offset| 1)) (.cse4 (+ 2 .cse16 |c_~#cache~0.offset|)) (.cse5 (+ 3 .cse16 |c_~#cache~0.offset|)) (.cse8 (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|) .cse13 0) .cse1 0))) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse0 (+ .cse16 |c_~#cache~0.offset|))) (and (not (= .cse0 .cse1)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse2 (let ((.cse6 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |c_~#cache~0.offset| 0) (not (= .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1) 0)) (< .cse16 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (not (= .cse0 .cse13)) (not (= .cse7 .cse0))))) is different from false [2022-11-03 02:24:09,294 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse15 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (+ .cse15 |c_~#cache~0.offset| 1)) (.cse2 (+ 2 .cse15 |c_~#cache~0.offset|)) (.cse3 (+ 3 .cse15 |c_~#cache~0.offset|)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse7 (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|) .cse12 0))) (.cse4 (+ .cse15 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_2800)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (< |c_t_funThread1of1ForFork0_~i~0#1| (+ |c_ULTIMATE.start_main_~i~2#1| 1))))) is different from false [2022-11-03 02:24:12,859 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse16 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse3 (+ .cse16 |c_~#cache~0.offset| 1)) (.cse4 (+ 2 .cse16 |c_~#cache~0.offset|)) (.cse5 (+ 3 .cse16 |c_~#cache~0.offset|)) (.cse8 (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|) .cse13 0) .cse1 0))) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse0 (+ .cse16 |c_~#cache~0.offset|))) (and (not (= .cse0 .cse1)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse2 (let ((.cse6 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (not (= .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13) 0)) (forall ((v_ArrVal_2810 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_2800 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_2800)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse4 0) .cse5 0) .cse0 v_ArrVal_2810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1) 0)) (< .cse16 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (not (= .cse0 .cse13)) (not (= .cse7 .cse0))))) is different from false [2022-11-03 02:24:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:13,567 INFO L93 Difference]: Finished difference Result 94397 states and 210602 transitions. [2022-11-03 02:24:13,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-03 02:24:13,567 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 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:24:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:13,933 INFO L225 Difference]: With dead ends: 94397 [2022-11-03 02:24:13,933 INFO L226 Difference]: Without dead ends: 94397 [2022-11-03 02:24:13,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=420, Invalid=2696, Unknown=12, NotChecked=1428, Total=4556 [2022-11-03 02:24:13,934 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 556 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 6225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3312 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:13,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 729 Invalid, 6225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2827 Invalid, 0 Unknown, 3312 Unchecked, 2.5s Time] [2022-11-03 02:24:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94397 states. [2022-11-03 02:24:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94397 to 84786. [2022-11-03 02:24:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84786 states, 84773 states have (on average 2.253701060479162) internal successors, (191053), 84785 states have internal predecessors, (191053), 0 states have call successors, (0), 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:24:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84786 states to 84786 states and 191053 transitions. [2022-11-03 02:24:15,932 INFO L78 Accepts]: Start accepts. Automaton has 84786 states and 191053 transitions. Word has length 45 [2022-11-03 02:24:15,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:15,932 INFO L495 AbstractCegarLoop]: Abstraction has 84786 states and 191053 transitions. [2022-11-03 02:24:15,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 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:24:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 84786 states and 191053 transitions. [2022-11-03 02:24:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:24:15,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:15,935 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:24:15,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 02:24:16,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 02:24:16,136 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:24:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:16,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1980736109, now seen corresponding path program 7 times [2022-11-03 02:24:16,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:16,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448742598] [2022-11-03 02:24:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:17,524 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:24:17,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:17,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448742598] [2022-11-03 02:24:17,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448742598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:24:17,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459885767] [2022-11-03 02:24:17,526 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:24:17,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:24:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:24:17,533 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:24:17,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 02:24:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:17,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:24:17,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:24:18,043 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:24:18,084 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:24:18,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,209 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:24:18,228 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:24:18,294 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:24:18,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,368 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:24:18,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,401 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:24:18,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,440 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:24:18,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:18,574 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 53 treesize of output 64 [2022-11-03 02:24:18,627 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:24:18,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:24:23,426 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:24:23,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459885767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:24:23,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1465632699] [2022-11-03 02:24:23,426 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:24:23,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:24:23,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2022-11-03 02:24:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225992071] [2022-11-03 02:24:23,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:24:23,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:24:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:23,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:24:23,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:24:23,428 INFO L87 Difference]: Start difference. First operand 84786 states and 191053 transitions. Second operand has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:24:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:31,187 INFO L93 Difference]: Finished difference Result 93122 states and 208269 transitions. [2022-11-03 02:24:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-03 02:24:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:24:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:31,383 INFO L225 Difference]: With dead ends: 93122 [2022-11-03 02:24:31,384 INFO L226 Difference]: Without dead ends: 93122 [2022-11-03 02:24:31,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=710, Invalid=3450, Unknown=0, NotChecked=0, Total=4160 [2022-11-03 02:24:31,384 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 736 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 3921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1748 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:31,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 355 Invalid, 3921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2009 Invalid, 0 Unknown, 1748 Unchecked, 2.1s Time] [2022-11-03 02:24:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93122 states. [2022-11-03 02:24:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93122 to 84803. [2022-11-03 02:24:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84803 states, 84790 states have (on average 2.253614813067579) internal successors, (191084), 84802 states have internal predecessors, (191084), 0 states have call successors, (0), 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:24:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84803 states to 84803 states and 191084 transitions. [2022-11-03 02:24:33,672 INFO L78 Accepts]: Start accepts. Automaton has 84803 states and 191084 transitions. Word has length 45 [2022-11-03 02:24:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:33,672 INFO L495 AbstractCegarLoop]: Abstraction has 84803 states and 191084 transitions. [2022-11-03 02:24:33,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:24:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 84803 states and 191084 transitions. [2022-11-03 02:24:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:24:33,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:33,694 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:24:33,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-03 02:24:33,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 02:24:33,895 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:24:33,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1366162967, now seen corresponding path program 8 times [2022-11-03 02:24:33,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:33,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149338399] [2022-11-03 02:24:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:35,257 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:24:35,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:35,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149338399] [2022-11-03 02:24:35,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149338399] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:24:35,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973850377] [2022-11-03 02:24:35,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:24:35,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:24:35,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:24:35,259 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:24:35,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 02:24:35,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:24:35,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:24:35,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 02:24:35,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:24:35,659 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:24:35,721 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:24:35,784 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:24:35,785 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:24:35,850 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:24:35,914 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:24:35,986 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:24:36,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,089 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:24:36,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,116 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:24:36,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,161 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:24:36,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,199 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:24:36,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:36,459 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:24:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:24:40,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:24:44,049 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 21 treesize of output 19 [2022-11-03 02:24:44,061 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 19 treesize of output 12 [2022-11-03 02:24:44,070 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:24:44,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973850377] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:24:44,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:24:44,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 11] total 32 [2022-11-03 02:24:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742415554] [2022-11-03 02:24:44,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:44,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:24:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:24:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=869, Unknown=3, NotChecked=0, Total=1056 [2022-11-03 02:24:44,072 INFO L87 Difference]: Start difference. First operand 84803 states and 191084 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:24:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:45,823 INFO L93 Difference]: Finished difference Result 131728 states and 294641 transitions. [2022-11-03 02:24:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:24:45,824 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:24:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:46,119 INFO L225 Difference]: With dead ends: 131728 [2022-11-03 02:24:46,119 INFO L226 Difference]: Without dead ends: 131728 [2022-11-03 02:24:46,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=193, Invalid=994, Unknown=3, NotChecked=0, Total=1190 [2022-11-03 02:24:46,119 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 70 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:46,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 47 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 480 Unchecked, 0.3s Time] [2022-11-03 02:24:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131728 states. [2022-11-03 02:24:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131728 to 85134. [2022-11-03 02:24:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85134 states, 85121 states have (on average 2.2526286110360547) internal successors, (191746), 85133 states have internal predecessors, (191746), 0 states have call successors, (0), 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:24:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85134 states to 85134 states and 191746 transitions. [2022-11-03 02:24:48,949 INFO L78 Accepts]: Start accepts. Automaton has 85134 states and 191746 transitions. Word has length 45 [2022-11-03 02:24:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:48,949 INFO L495 AbstractCegarLoop]: Abstraction has 85134 states and 191746 transitions. [2022-11-03 02:24:48,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:24:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 85134 states and 191746 transitions. [2022-11-03 02:24:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:24:48,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:48,953 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:24:48,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 02:24:49,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 02:24:49,154 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:24:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash -433512409, now seen corresponding path program 9 times [2022-11-03 02:24:49,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:49,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524922692] [2022-11-03 02:24:49,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:50,601 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:24:50,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:50,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524922692] [2022-11-03 02:24:50,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524922692] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:24:50,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713869283] [2022-11-03 02:24:50,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:24:50,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:24:50,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:24:50,603 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:24:50,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 02:24:50,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:24:50,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:24:50,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 02:24:50,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:24:51,069 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:24:51,126 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:24:51,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:24:51,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 02:24:51,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:24:51,211 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 37 treesize of output 42 [2022-11-03 02:24:51,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:24:51,229 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 02:24:51,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:24:51,295 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 6 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:24:51,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:24:51,325 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 6 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:24:51,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:24:51,354 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 6 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 02:24:51,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:51,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:24:51,557 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 21 case distinctions, treesize of input 73 treesize of output 90 [2022-11-03 02:25:01,830 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:25:01,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:25:05,064 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse0 (let ((.cse4 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)))) is different from false [2022-11-03 02:25:07,191 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (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|) .cse9 0))) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse0 (let ((.cse4 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0))))) is different from false [2022-11-03 02:25:09,324 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse10 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (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|) .cse7 0) .cse10 0))) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse0 (let ((.cse4 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0))))) is different from false [2022-11-03 02:25:11,770 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse3 (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|) .cse12 0) .cse7 0))) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |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_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|)))))) is different from false [2022-11-03 02:25:12,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:25:12,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:25:12,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:25:12,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:25:12,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:25:12,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:25:12,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:25:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2022-11-03 02:25:12,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713869283] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:25:12,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1751256575] [2022-11-03 02:25:12,287 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:25:12,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:25:12,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 16] total 36 [2022-11-03 02:25:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809522538] [2022-11-03 02:25:12,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:25:12,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:25:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:25:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=903, Unknown=8, NotChecked=260, Total=1332 [2022-11-03 02:25:12,290 INFO L87 Difference]: Start difference. First operand 85134 states and 191746 transitions. Second operand has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 37 states have internal predecessors, (98), 0 states have call successors, (0), 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:25:19,081 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse13 0) .cse8 0))) (.cse5 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8) 0)) (< .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13) 0)) (< .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 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:25:22,350 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse10 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse11 .cse7 0) .cse10 0))) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (not (= .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse1 (let ((.cse4 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse0 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse0 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10) 0)) (= (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse7)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse0 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse0 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse2)) (not (= .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse10)) (not (= .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 02:25:24,457 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 .cse11 0))) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (not (= .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse2 (let ((.cse5 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse0 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse0 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11) 0)) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse0 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse3)) (not (= .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse1 .cse8) 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0) .cse0 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse11)) (not (= .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) is different from false [2022-11-03 02:25:26,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse9 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (not (= .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (= (select .cse3 .cse2) 0) (= (select .cse3 .cse4) 0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse5 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) .cse0 0) .cse7 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) .cse0 0) .cse7 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse6)) (not (= .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse1 .cse2) 0) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) .cse0 0) .cse7 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= 0 (select .cse1 .cse4)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) .cse0 0) .cse7 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4)) (not (= .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-11-03 02:25:42,071 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse13 0) .cse8 0))) (.cse5 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (< .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8) 0)) (< .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13) 0)) (< .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-11-03 02:25:44,590 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse10 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse11 .cse7 0) .cse10 0))) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse0 (let ((.cse4 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10) 0)) (= (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0))))) is different from false [2022-11-03 02:25:46,701 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse10 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 .cse10 0))) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse1 (let ((.cse5 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10) 0)) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13) 0)) (= (select .cse0 .cse13) 0) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0))))) is different from false [2022-11-03 02:25:48,875 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse9 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse1 (let ((.cse5 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0)) (= (select .cse0 .cse9) 0) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12) 0)) (= 0 (select .cse0 .cse12)) (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3283)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9) 0)))) is different from false [2022-11-03 02:25:53,439 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse3 (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|) .cse12 0) .cse7 0))) (.cse4 (+ .cse13 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |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_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (< .cse13 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (< .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 0 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2022-11-03 02:25:58,088 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse3 (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|) .cse12 0) .cse7 0))) (.cse4 (+ .cse13 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |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_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| Int)) (or (forall ((v_ArrVal_3293 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_3283 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3283)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505| v_ArrVal_3293))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12) 0)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_505|))) (< .cse13 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (< .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-11-03 02:25:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:58,984 INFO L93 Difference]: Finished difference Result 132575 states and 296621 transitions. [2022-11-03 02:25:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-03 02:25:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 37 states have internal predecessors, (98), 0 states have call successors, (0), 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:25:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:59,273 INFO L225 Difference]: With dead ends: 132575 [2022-11-03 02:25:59,273 INFO L226 Difference]: Without dead ends: 132575 [2022-11-03 02:25:59,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 64.3s TimeCoverageRelationStatistics Valid=356, Invalid=2026, Unknown=26, NotChecked=1498, Total=3906 [2022-11-03 02:25:59,275 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 621 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 6810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4335 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:59,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 725 Invalid, 6810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2385 Invalid, 0 Unknown, 4335 Unchecked, 2.3s Time] [2022-11-03 02:25:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132575 states. [2022-11-03 02:26:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132575 to 96592. [2022-11-03 02:26:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96592 states, 96579 states have (on average 2.251234740471531) internal successors, (217422), 96591 states have internal predecessors, (217422), 0 states have call successors, (0), 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:26:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96592 states to 96592 states and 217422 transitions. [2022-11-03 02:26:02,174 INFO L78 Accepts]: Start accepts. Automaton has 96592 states and 217422 transitions. Word has length 45 [2022-11-03 02:26:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:26:02,175 INFO L495 AbstractCegarLoop]: Abstraction has 96592 states and 217422 transitions. [2022-11-03 02:26:02,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 37 states have internal predecessors, (98), 0 states have call successors, (0), 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:26:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 96592 states and 217422 transitions. [2022-11-03 02:26:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:26:02,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:02,179 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:26:02,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 02:26:02,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 02:26:02,394 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:26:02,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash -409880425, now seen corresponding path program 10 times [2022-11-03 02:26:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:26:02,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299789457] [2022-11-03 02:26:02,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:02,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:26:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:04,361 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:26:04,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:26:04,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299789457] [2022-11-03 02:26:04,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299789457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:26:04,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965068628] [2022-11-03 02:26:04,362 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:26:04,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:26:04,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:26:04,363 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:26:04,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 02:26:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:04,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:26:04,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:26:04,893 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:26:04,998 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:26:05,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,051 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:26:05,070 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:26:05,136 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:26:05,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,208 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:26:05,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,251 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:26:05,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,291 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:26:05,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:05,445 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 53 treesize of output 64 [2022-11-03 02:26:05,498 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:26:05,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:26:10,629 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:26:10,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965068628] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:26:10,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [931458750] [2022-11-03 02:26:10,630 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:26:10,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:26:10,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2022-11-03 02:26:10,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457004452] [2022-11-03 02:26:10,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:26:10,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:26:10,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:26:10,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:26:10,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:26:10,632 INFO L87 Difference]: Start difference. First operand 96592 states and 217422 transitions. Second operand has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:26:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:26:19,076 INFO L93 Difference]: Finished difference Result 137886 states and 309419 transitions. [2022-11-03 02:26:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-03 02:26:19,077 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:26:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:26:19,382 INFO L225 Difference]: With dead ends: 137886 [2022-11-03 02:26:19,383 INFO L226 Difference]: Without dead ends: 137886 [2022-11-03 02:26:19,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 88 SyntacticMatches, 10 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=906, Invalid=4064, Unknown=0, NotChecked=0, Total=4970 [2022-11-03 02:26:19,384 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 681 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 4561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1991 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:26:19,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 464 Invalid, 4561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2424 Invalid, 0 Unknown, 1991 Unchecked, 2.3s Time] [2022-11-03 02:26:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137886 states. [2022-11-03 02:26:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137886 to 128151. [2022-11-03 02:26:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128151 states, 128138 states have (on average 2.2586586336605845) internal successors, (289420), 128150 states have internal predecessors, (289420), 0 states have call successors, (0), 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:26:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128151 states to 128151 states and 289420 transitions. [2022-11-03 02:26:22,618 INFO L78 Accepts]: Start accepts. Automaton has 128151 states and 289420 transitions. Word has length 45 [2022-11-03 02:26:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:26:22,618 INFO L495 AbstractCegarLoop]: Abstraction has 128151 states and 289420 transitions. [2022-11-03 02:26:22,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:26:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 128151 states and 289420 transitions. [2022-11-03 02:26:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:26:23,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:23,134 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:26:23,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-03 02:26:23,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:26:23,335 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:26:23,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1196327719, now seen corresponding path program 11 times [2022-11-03 02:26:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:26:23,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183436510] [2022-11-03 02:26:23,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:23,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:26:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:24,684 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:26:24,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:26:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183436510] [2022-11-03 02:26:24,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183436510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:26:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179661293] [2022-11-03 02:26:24,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:26:24,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:26:24,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:26:24,685 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:26:24,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 02:26:24,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:26:24,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:26:24,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:26:24,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:26:25,106 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:26:25,166 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:26:25,239 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:26:25,240 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:26:25,314 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:26:25,347 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:26:25,415 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:26:25,519 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:26:25,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,637 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:26:25,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,681 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:26:25,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,709 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:26:25,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:25,988 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:26:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:26:26,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:26:33,417 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 21 treesize of output 19 [2022-11-03 02:26:33,420 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 19 treesize of output 12 [2022-11-03 02:26:33,427 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:26:33,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179661293] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:26:33,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:26:33,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 11] total 32 [2022-11-03 02:26:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700072121] [2022-11-03 02:26:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:26:33,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:26:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:26:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:26:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 02:26:33,429 INFO L87 Difference]: Start difference. First operand 128151 states and 289420 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:26:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:26:36,199 INFO L93 Difference]: Finished difference Result 205265 states and 457690 transitions. [2022-11-03 02:26:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:26:36,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:26:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:26:37,067 INFO L225 Difference]: With dead ends: 205265 [2022-11-03 02:26:37,067 INFO L226 Difference]: Without dead ends: 205265 [2022-11-03 02:26:37,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:26:37,068 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 621 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:26:37,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 47 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 621 Unchecked, 0.3s Time] [2022-11-03 02:26:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205265 states. [2022-11-03 02:26:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205265 to 129183. [2022-11-03 02:26:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129183 states, 129170 states have (on average 2.2565920879461174) internal successors, (291484), 129182 states have internal predecessors, (291484), 0 states have call successors, (0), 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:26:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129183 states to 129183 states and 291484 transitions. [2022-11-03 02:26:41,872 INFO L78 Accepts]: Start accepts. Automaton has 129183 states and 291484 transitions. Word has length 45 [2022-11-03 02:26:41,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:26:41,872 INFO L495 AbstractCegarLoop]: Abstraction has 129183 states and 291484 transitions. [2022-11-03 02:26:41,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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:26:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 129183 states and 291484 transitions. [2022-11-03 02:26:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:26:41,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:41,875 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:26:41,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 02:26:42,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-03 02:26:42,079 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:26:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash 16566887, now seen corresponding path program 12 times [2022-11-03 02:26:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:26:42,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930732252] [2022-11-03 02:26:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:26:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:43,676 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:26:43,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:26:43,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930732252] [2022-11-03 02:26:43,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930732252] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:26:43,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259987446] [2022-11-03 02:26:43,677 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:26:43,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:26:43,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:26:43,678 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:26:43,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 02:26:44,156 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:26:44,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:26:44,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-03 02:26:44,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:26:44,378 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:26:44,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,471 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:26:44,483 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:26:44,534 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:26:44,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,597 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:26:44,618 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:26:44,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,690 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:26:44,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,717 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:26:44,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:26:44,928 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:26:51,069 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:26:51,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:27:10,997 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse7 (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|) .cse20 0) .cse4 0)))) (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (select .cse7 |c_~#cache~0.base|)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse3 (let ((.cse5 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse2 v_ArrVal_3766)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse3 |c_~#cache~0.base|))) (or (not (= (select .cse1 .cse2) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store .cse1 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))))))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse11 (let ((.cse12 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse10 v_ArrVal_3766)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse11 |c_~#cache~0.base|))) (or (not (= (select .cse9 .cse10) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse11 |c_~#cache~0.base| (store (store (store .cse9 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |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_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse14 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse15 (let ((.cse16 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse14 v_ArrVal_3766)))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse13 (select .cse15 |c_~#cache~0.base|))) (or (not (= (select .cse13 .cse14) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse15 |c_~#cache~0.base| (store (store (store .cse13 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse18 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse19 (let ((.cse21 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse18 v_ArrVal_3766)))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse17 (select .cse19 |c_~#cache~0.base|))) (or (not (= (select .cse17 .cse18) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse19 |c_~#cache~0.base| (store (store (store .cse17 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse20) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))))))) is different from false [2022-11-03 02:27:12,487 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:27:12,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259987446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:27:12,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [278377199] [2022-11-03 02:27:12,488 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:27:12,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:27:12,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 37 [2022-11-03 02:27:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119814728] [2022-11-03 02:27:12,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:27:12,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 02:27:12,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:12,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 02:27:12,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1127, Unknown=3, NotChecked=70, Total=1406 [2022-11-03 02:27:12,490 INFO L87 Difference]: Start difference. First operand 129183 states and 291484 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 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:27:15,865 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse21 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse9 .cse21 0) .cse4 0)))) (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (select .cse7 |c_~#cache~0.base|)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse3 (let ((.cse5 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse2 v_ArrVal_3766)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse3 |c_~#cache~0.base|))) (or (not (= (select .cse1 .cse2) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store .cse1 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))))))))) (= (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse12 (let ((.cse13 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse11 v_ArrVal_3766)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse10 (select .cse12 |c_~#cache~0.base|))) (or (not (= (select .cse10 .cse11) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse12 |c_~#cache~0.base| (store (store (store .cse10 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))))))) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse15 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse16 (let ((.cse17 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse15 v_ArrVal_3766)))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse14 (select .cse16 |c_~#cache~0.base|))) (or (not (= (select .cse14 .cse15) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse16 |c_~#cache~0.base| (store (store (store .cse14 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse19 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse20 (let ((.cse22 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse19 v_ArrVal_3766)))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse18 (select .cse20 |c_~#cache~0.base|))) (or (not (= (select .cse18 .cse19) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse20 |c_~#cache~0.base| (store (store (store .cse18 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse21) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (= |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:27:19,851 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse21 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse9 .cse21 0) .cse4 0)))) (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (select .cse7 |c_~#cache~0.base|)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse3 (let ((.cse5 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse2 v_ArrVal_3766)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse3 |c_~#cache~0.base|))) (or (not (= (select .cse1 .cse2) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store .cse1 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))))))))) (= (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse12 (let ((.cse13 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse11 v_ArrVal_3766)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse10 (select .cse12 |c_~#cache~0.base|))) (or (not (= (select .cse10 .cse11) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse12 |c_~#cache~0.base| (store (store (store .cse10 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))))))) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse15 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse16 (let ((.cse17 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse15 v_ArrVal_3766)))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse14 (select .cse16 |c_~#cache~0.base|))) (or (not (= (select .cse14 .cse15) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse16 |c_~#cache~0.base| (store (store (store .cse14 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse19 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse20 (let ((.cse22 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse19 v_ArrVal_3766)))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse18 (select .cse20 |c_~#cache~0.base|))) (or (not (= (select .cse18 .cse19) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse20 |c_~#cache~0.base| (store (store (store .cse18 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse21) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (= |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:27:23,505 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse22 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse7 (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|) .cse20 0) .cse4 0)))) (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (select .cse7 |c_~#cache~0.base|)) (.cse0 (+ .cse22 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse3 (let ((.cse5 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse2 v_ArrVal_3766)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse3 |c_~#cache~0.base|))) (or (not (= (select .cse1 .cse2) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store .cse1 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))))))))) (or (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (< .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse11 (let ((.cse12 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse10 v_ArrVal_3766)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse11 |c_~#cache~0.base|))) (or (not (= (select .cse9 .cse10) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse11 |c_~#cache~0.base| (store (store (store .cse9 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))))))) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse14 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse15 (let ((.cse16 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse14 v_ArrVal_3766)))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse13 (select .cse15 |c_~#cache~0.base|))) (or (not (= (select .cse13 .cse14) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse15 |c_~#cache~0.base| (store (store (store .cse13 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse18 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse19 (let ((.cse21 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse18 v_ArrVal_3766)))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse17 (select .cse19 |c_~#cache~0.base|))) (or (not (= (select .cse17 .cse18) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse19 |c_~#cache~0.base| (store (store (store .cse17 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse20) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (< .cse22 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (<= 0 |c_ULTIMATE.start_main_~i~2#1|))))) is different from false [2022-11-03 02:27:29,391 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse22 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse7 (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|) .cse20 0) .cse4 0)))) (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (select .cse7 |c_~#cache~0.base|)) (.cse0 (+ .cse22 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse3 (let ((.cse5 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse2 v_ArrVal_3766)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse3 |c_~#cache~0.base|))) (or (not (= (select .cse1 .cse2) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store .cse1 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))))))))) (or (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (< .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse11 (let ((.cse12 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse10 v_ArrVal_3766)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse11 |c_~#cache~0.base|))) (or (not (= (select .cse9 .cse10) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse11 |c_~#cache~0.base| (store (store (store .cse9 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |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_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse14 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse15 (let ((.cse16 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse14 v_ArrVal_3766)))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse13 (select .cse15 |c_~#cache~0.base|))) (or (not (= (select .cse13 .cse14) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse15 |c_~#cache~0.base| (store (store (store .cse13 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse18 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse19 (let ((.cse21 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse18 v_ArrVal_3766)))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse17 (select .cse19 |c_~#cache~0.base|))) (or (not (= (select .cse17 .cse18) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse19 |c_~#cache~0.base| (store (store (store .cse17 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse20) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (< .cse22 (* |c_ULTIMATE.start_main_~i~2#1| 28)))))) is different from false [2022-11-03 02:27:32,080 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse22 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse7 (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|) .cse20 0) .cse4 0)))) (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (select .cse7 |c_~#cache~0.base|)) (.cse0 (+ .cse22 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse3 (let ((.cse5 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse2 v_ArrVal_3766)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse3 |c_~#cache~0.base|))) (or (not (= (select .cse1 .cse2) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store .cse1 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))))))))) (or (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (< .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) (forall ((v_ArrVal_3766 Int)) (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse11 (let ((.cse12 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse10 v_ArrVal_3766)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse11 |c_~#cache~0.base|))) (or (not (= (select .cse9 .cse10) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse11 |c_~#cache~0.base| (store (store (store .cse9 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))))))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse14 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse15 (let ((.cse16 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse14 v_ArrVal_3766)))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse13 (select .cse15 |c_~#cache~0.base|))) (or (not (= (select .cse13 .cse14) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse15 |c_~#cache~0.base| (store (store (store .cse13 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| Int)) (or (forall ((v_ArrVal_3766 Int)) (let ((.cse18 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| 1))) (let ((.cse19 (let ((.cse21 (store .cse7 |c_~#cache~0.base| (store .cse8 .cse18 v_ArrVal_3766)))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse17 (select .cse19 |c_~#cache~0.base|))) (or (not (= (select .cse17 .cse18) 0)) (forall ((v_ArrVal_3774 Int)) (= (select (select (store .cse19 |c_~#cache~0.base| (store (store (store .cse17 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508| v_ArrVal_3774)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse20) 0))))))) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_508|))) (< .cse22 (* |c_ULTIMATE.start_main_~i~2#1| 28)))))) is different from false [2022-11-03 02:27:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:33,308 INFO L93 Difference]: Finished difference Result 183564 states and 411346 transitions. [2022-11-03 02:27:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-03 02:27:33,308 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 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:27:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:34,051 INFO L225 Difference]: With dead ends: 183564 [2022-11-03 02:27:34,051 INFO L226 Difference]: Without dead ends: 183564 [2022-11-03 02:27:34,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=447, Invalid=2875, Unknown=8, NotChecked=702, Total=4032 [2022-11-03 02:27:34,052 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 703 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 7276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4175 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:34,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 810 Invalid, 7276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 3005 Invalid, 0 Unknown, 4175 Unchecked, 2.3s Time] [2022-11-03 02:27:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183564 states. [2022-11-03 02:27:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183564 to 129576. [2022-11-03 02:27:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129576 states, 129563 states have (on average 2.2559990120636293) internal successors, (292294), 129575 states have internal predecessors, (292294), 0 states have call successors, (0), 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:27:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129576 states to 129576 states and 292294 transitions. [2022-11-03 02:27:38,595 INFO L78 Accepts]: Start accepts. Automaton has 129576 states and 292294 transitions. Word has length 45 [2022-11-03 02:27:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:38,595 INFO L495 AbstractCegarLoop]: Abstraction has 129576 states and 292294 transitions. [2022-11-03 02:27:38,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 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:27:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 129576 states and 292294 transitions. [2022-11-03 02:27:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:27:38,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:38,599 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:27:38,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 02:27:38,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:38,810 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:27:38,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:38,811 INFO L85 PathProgramCache]: Analyzing trace with hash 720224365, now seen corresponding path program 13 times [2022-11-03 02:27:38,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:38,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14257448] [2022-11-03 02:27:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:40,229 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:27:40,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:40,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14257448] [2022-11-03 02:27:40,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14257448] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:27:40,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358114245] [2022-11-03 02:27:40,230 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:27:40,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:40,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:27:40,231 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:27:40,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 02:27:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:40,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:27:40,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:27:40,842 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:27:40,895 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:27:40,954 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:27:41,023 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:27:41,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,098 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:27:41,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,136 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:27:41,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,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 48 treesize of output 56 [2022-11-03 02:27:41,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,197 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:27:41,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:41,334 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 53 treesize of output 64 [2022-11-03 02:27:41,386 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:27:41,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:27:44,187 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:27:44,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358114245] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:27:44,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [603760532] [2022-11-03 02:27:44,187 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:27:44,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:27:44,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2022-11-03 02:27:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204383306] [2022-11-03 02:27:44,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:27:44,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:27:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:27:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:27:44,190 INFO L87 Difference]: Start difference. First operand 129576 states and 292294 transitions. Second operand has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:27:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:54,037 INFO L93 Difference]: Finished difference Result 201467 states and 456427 transitions. [2022-11-03 02:27:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-03 02:27:54,038 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:27:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:54,893 INFO L225 Difference]: With dead ends: 201467 [2022-11-03 02:27:54,893 INFO L226 Difference]: Without dead ends: 201467 [2022-11-03 02:27:54,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=936, Invalid=4034, Unknown=0, NotChecked=0, Total=4970 [2022-11-03 02:27:54,894 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 788 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 3605 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 5392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 3605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1646 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:54,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 430 Invalid, 5392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 3605 Invalid, 0 Unknown, 1646 Unchecked, 3.6s Time] [2022-11-03 02:27:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201467 states. [2022-11-03 02:27:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201467 to 134807. [2022-11-03 02:27:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134807 states, 134794 states have (on average 2.2454411917444395) internal successors, (302672), 134806 states have internal predecessors, (302672), 0 states have call successors, (0), 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:27:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134807 states to 134807 states and 302672 transitions. [2022-11-03 02:27:59,453 INFO L78 Accepts]: Start accepts. Automaton has 134807 states and 302672 transitions. Word has length 45 [2022-11-03 02:27:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:59,453 INFO L495 AbstractCegarLoop]: Abstraction has 134807 states and 302672 transitions. [2022-11-03 02:27:59,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 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:27:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 134807 states and 302672 transitions. [2022-11-03 02:27:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:27:59,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:59,457 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:27:59,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-03 02:27:59,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:59,670 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 02:27:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1185800316, now seen corresponding path program 1 times [2022-11-03 02:27:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:59,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677157773] [2022-11-03 02:27:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:28:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:28:00,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:28:00,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677157773] [2022-11-03 02:28:00,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677157773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:28:00,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30198074] [2022-11-03 02:28:00,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:28:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:28:00,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:28:00,228 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:28:00,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651e062e-4086-459c-9c99-4fea4537d784/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 02:28:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:28:00,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:28:00,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:28:00,878 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:28:00,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:00,928 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:28:00,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:00,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:00,985 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:28:01,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:01,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:01,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:01,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:01,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:01,046 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:28:01,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:01,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:01,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:01,099 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:28:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:28:01,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:28:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 02:28:02,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30198074] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:28:02,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1941357917] [2022-11-03 02:28:02,193 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:28:02,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:28:02,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 02:28:02,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598071140] [2022-11-03 02:28:02,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:28:02,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 02:28:02,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:28:02,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 02:28:02,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2022-11-03 02:28:02,195 INFO L87 Difference]: Start difference. First operand 134807 states and 302672 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 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)