./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0 --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 306d85d0b5300749928a8392783cd7ec5acf0c4622b6bdba80c3589786dd98ad --- 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-e04fb08 [2022-11-16 19:31:06,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:31:06,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:31:06,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:31:06,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:31:06,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:31:06,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:31:06,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:31:06,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:31:06,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:31:06,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:31:06,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:31:06,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:31:06,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:31:06,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:31:06,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:31:06,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:31:06,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:31:06,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:31:06,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:31:06,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:31:06,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:31:06,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:31:06,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:31:06,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:31:06,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:31:06,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:31:06,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:31:06,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:31:06,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:31:06,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:31:06,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:31:06,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:31:06,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:31:06,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:31:06,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:31:06,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:31:06,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:31:06,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:31:06,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:31:06,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:31:06,392 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-16 19:31:06,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:31:06,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:31:06,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:31:06,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:31:06,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:31:06,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:31:06,429 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:31:06,429 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:31:06,430 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:31:06,430 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 19:31:06,436 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:31:06,436 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:31:06,437 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 19:31:06,437 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 19:31:06,437 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:31:06,437 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 19:31:06,437 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 19:31:06,437 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 19:31:06,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:31:06,438 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:31:06,439 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 19:31:06,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:31:06,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:31:06,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:31:06,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 19:31:06,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:31:06,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 19:31:06,440 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 19:31:06,440 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:31:06,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 19:31:06,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:31:06,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 19:31:06,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:31:06,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:31:06,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:31:06,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:31:06,442 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 19:31:06,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:31:06,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 19:31:06,443 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 19:31:06,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 19:31:06,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 19:31:06,454 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:31:06,454 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_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/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_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0 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 -> 306d85d0b5300749928a8392783cd7ec5acf0c4622b6bdba80c3589786dd98ad [2022-11-16 19:31:06,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:31:06,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:31:06,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:31:06,704 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:31:06,704 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:31:06,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2022-11-16 19:31:06,790 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/data/4f5f34491/d45fa769de084107b3c48600523f900a/FLAG0b4688789 [2022-11-16 19:31:07,275 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:31:07,276 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2022-11-16 19:31:07,284 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/data/4f5f34491/d45fa769de084107b3c48600523f900a/FLAG0b4688789 [2022-11-16 19:31:07,645 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/data/4f5f34491/d45fa769de084107b3c48600523f900a [2022-11-16 19:31:07,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:31:07,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:31:07,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:31:07,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:31:07,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:31:07,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:31:07" (1/1) ... [2022-11-16 19:31:07,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4c4652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:07, skipping insertion in model container [2022-11-16 19:31:07,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:31:07" (1/1) ... [2022-11-16 19:31:07,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:31:07,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:31:07,930 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c[2823,2836] [2022-11-16 19:31:07,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:31:07,946 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:31:07,987 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c[2823,2836] [2022-11-16 19:31:07,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:31:08,007 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:31:08,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08 WrapperNode [2022-11-16 19:31:08,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:31:08,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:31:08,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:31:08,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:31:08,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,076 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 371 [2022-11-16 19:31:08,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:31:08,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:31:08,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:31:08,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:31:08,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,138 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:31:08,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:31:08,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:31:08,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:31:08,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (1/1) ... [2022-11-16 19:31:08,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:31:08,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:31:08,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:31:08,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:31:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:31:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:31:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 19:31:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 19:31:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 19:31:08,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 19:31:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 19:31:08,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 19:31:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 19:31:08,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 19:31:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 19:31:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 19:31:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 19:31:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 19:31:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:31:08,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:31:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:31:08,273 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 19:31:08,465 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:31:08,467 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:31:09,408 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:31:09,642 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:31:09,642 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 19:31:09,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:09 BoogieIcfgContainer [2022-11-16 19:31:09,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:31:09,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:31:09,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:31:09,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:31:09,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:31:07" (1/3) ... [2022-11-16 19:31:09,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42617c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:31:09, skipping insertion in model container [2022-11-16 19:31:09,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:08" (2/3) ... [2022-11-16 19:31:09,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42617c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:31:09, skipping insertion in model container [2022-11-16 19:31:09,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:09" (3/3) ... [2022-11-16 19:31:09,659 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2022-11-16 19:31:09,669 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 19:31:09,681 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:31:09,682 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-11-16 19:31:09,682 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 19:31:09,884 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 19:31:09,944 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 19:31:09,961 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 511 places, 528 transitions, 1080 flow [2022-11-16 19:31:09,966 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 511 places, 528 transitions, 1080 flow [2022-11-16 19:31:09,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 528 transitions, 1080 flow [2022-11-16 19:31:10,215 INFO L130 PetriNetUnfolder]: 27/525 cut-off events. [2022-11-16 19:31:10,216 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 19:31:10,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 525 events. 27/525 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 624 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 421. Up to 3 conditions per place. [2022-11-16 19:31:10,235 INFO L119 LiptonReduction]: Number of co-enabled transitions 13362 [2022-11-16 19:33:39,466 INFO L134 LiptonReduction]: Checked pairs total: 94407 [2022-11-16 19:33:39,466 INFO L136 LiptonReduction]: Total number of compositions: 633 [2022-11-16 19:33:39,474 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 132 transitions, 288 flow [2022-11-16 19:33:42,555 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 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-16 19:33:42,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:33:42,605 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;@241fdee7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:33:42,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2022-11-16 19:33:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 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-16 19:33:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 19:33:42,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:42,730 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 19:33:42,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:33:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2167, now seen corresponding path program 1 times [2022-11-16 19:33:42,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:33:42,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979170804] [2022-11-16 19:33:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:42,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:33:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:42,867 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-16 19:33:42,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:33:42,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979170804] [2022-11-16 19:33:42,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979170804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:33:42,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:33:42,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 19:33:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179366850] [2022-11-16 19:33:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:33:42,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 19:33:42,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:33:42,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 19:33:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:33:43,012 INFO L87 Difference]: Start difference. First operand has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-16 19:33:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:43,435 INFO L93 Difference]: Finished difference Result 5616 states and 22643 transitions. [2022-11-16 19:33:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 19:33:43,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-16 19:33:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:43,517 INFO L225 Difference]: With dead ends: 5616 [2022-11-16 19:33:43,517 INFO L226 Difference]: Without dead ends: 5585 [2022-11-16 19:33:43,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 19:33:43,523 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:43,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:33:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5585 states. [2022-11-16 19:33:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5585 to 5585. [2022-11-16 19:33:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5585 states, 5573 states have (on average 4.047371254261619) internal successors, (22556), 5584 states have internal predecessors, (22556), 0 states have call successors, (0), 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-16 19:33:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 22556 transitions. [2022-11-16 19:33:44,208 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 22556 transitions. Word has length 1 [2022-11-16 19:33:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:44,209 INFO L495 AbstractCegarLoop]: Abstraction has 5585 states and 22556 transitions. [2022-11-16 19:33:44,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-16 19:33:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 22556 transitions. [2022-11-16 19:33:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 19:33:44,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:44,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:44,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 19:33:44,213 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:33:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:44,214 INFO L85 PathProgramCache]: Analyzing trace with hash -315166111, now seen corresponding path program 1 times [2022-11-16 19:33:44,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:33:44,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985629777] [2022-11-16 19:33:44,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:44,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:33:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:45,056 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-16 19:33:45,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:33:45,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985629777] [2022-11-16 19:33:45,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985629777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:33:45,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:33:45,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:33:45,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148962742] [2022-11-16 19:33:45,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:33:45,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:33:45,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:33:45,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:33:45,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:33:45,063 INFO L87 Difference]: Start difference. First operand 5585 states and 22556 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 19:33:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:45,570 INFO L93 Difference]: Finished difference Result 5586 states and 22557 transitions. [2022-11-16 19:33:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:33:45,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-16 19:33:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:45,637 INFO L225 Difference]: With dead ends: 5586 [2022-11-16 19:33:45,637 INFO L226 Difference]: Without dead ends: 5586 [2022-11-16 19:33:45,638 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-16 19:33:45,639 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:45,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 19:33:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2022-11-16 19:33:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 5586. [2022-11-16 19:33:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5586 states, 5574 states have (on average 4.046824542518838) internal successors, (22557), 5585 states have internal predecessors, (22557), 0 states have call successors, (0), 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-16 19:33:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5586 states to 5586 states and 22557 transitions. [2022-11-16 19:33:45,993 INFO L78 Accepts]: Start accepts. Automaton has 5586 states and 22557 transitions. Word has length 13 [2022-11-16 19:33:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:45,994 INFO L495 AbstractCegarLoop]: Abstraction has 5586 states and 22557 transitions. [2022-11-16 19:33:45,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 19:33:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5586 states and 22557 transitions. [2022-11-16 19:33:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 19:33:45,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:46,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:46,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 19:33:46,003 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:33:46,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1540683272, now seen corresponding path program 1 times [2022-11-16 19:33:46,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:33:46,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666220960] [2022-11-16 19:33:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:46,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:33:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:46,868 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-16 19:33:46,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:33:46,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666220960] [2022-11-16 19:33:46,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666220960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:33:46,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:33:46,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:33:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642980520] [2022-11-16 19:33:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:33:46,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:33:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:33:46,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:33:46,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:33:46,872 INFO L87 Difference]: Start difference. First operand 5586 states and 22557 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:33:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:49,396 INFO L93 Difference]: Finished difference Result 9026 states and 36659 transitions. [2022-11-16 19:33:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:33:49,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 19:33:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:49,494 INFO L225 Difference]: With dead ends: 9026 [2022-11-16 19:33:49,494 INFO L226 Difference]: Without dead ends: 9026 [2022-11-16 19:33:49,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:33:49,500 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:49,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 71 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-16 19:33:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9026 states. [2022-11-16 19:33:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9026 to 6506. [2022-11-16 19:33:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6506 states, 6494 states have (on average 4.064213119802895) internal successors, (26393), 6505 states have internal predecessors, (26393), 0 states have call successors, (0), 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-16 19:33:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 26393 transitions. [2022-11-16 19:33:49,942 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 26393 transitions. Word has length 14 [2022-11-16 19:33:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:49,943 INFO L495 AbstractCegarLoop]: Abstraction has 6506 states and 26393 transitions. [2022-11-16 19:33:49,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:33:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 26393 transitions. [2022-11-16 19:33:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 19:33:49,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:49,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:49,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 19:33:49,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:33:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash 516557318, now seen corresponding path program 1 times [2022-11-16 19:33:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:33:49,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410252923] [2022-11-16 19:33:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:33:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:50,046 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-16 19:33:50,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:33:50,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410252923] [2022-11-16 19:33:50,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410252923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:33:50,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:33:50,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:33:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393636560] [2022-11-16 19:33:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:33:50,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:33:50,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:33:50,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:33:50,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:33:50,061 INFO L87 Difference]: Start difference. First operand 6506 states and 26393 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:33:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:50,603 INFO L93 Difference]: Finished difference Result 10116 states and 41047 transitions. [2022-11-16 19:33:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:33:50,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 19:33:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:50,679 INFO L225 Difference]: With dead ends: 10116 [2022-11-16 19:33:50,680 INFO L226 Difference]: Without dead ends: 10116 [2022-11-16 19:33:50,680 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-16 19:33:50,681 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:50,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 90 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 19:33:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2022-11-16 19:33:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 6336. [2022-11-16 19:33:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6336 states, 6326 states have (on average 4.064653809674359) internal successors, (25713), 6335 states have internal predecessors, (25713), 0 states have call successors, (0), 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-16 19:33:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 25713 transitions. [2022-11-16 19:33:51,059 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 25713 transitions. Word has length 15 [2022-11-16 19:33:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:51,059 INFO L495 AbstractCegarLoop]: Abstraction has 6336 states and 25713 transitions. [2022-11-16 19:33:51,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:33:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 25713 transitions. [2022-11-16 19:33:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:33:51,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:51,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:51,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 19:33:51,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:33:51,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1844528276, now seen corresponding path program 1 times [2022-11-16 19:33:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:33:51,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459974377] [2022-11-16 19:33:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:33:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:51,335 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-16 19:33:51,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:33:51,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459974377] [2022-11-16 19:33:51,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459974377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:33:51,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:33:51,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:33:51,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521471505] [2022-11-16 19:33:51,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:33:51,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:33:51,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:33:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:33:51,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:33:51,339 INFO L87 Difference]: Start difference. First operand 6336 states and 25713 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-16 19:33:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:51,792 INFO L93 Difference]: Finished difference Result 6338 states and 25715 transitions. [2022-11-16 19:33:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 19:33:51,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-16 19:33:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:51,835 INFO L225 Difference]: With dead ends: 6338 [2022-11-16 19:33:51,835 INFO L226 Difference]: Without dead ends: 6338 [2022-11-16 19:33:51,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:33:51,836 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 68 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:51,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 19:33:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-11-16 19:33:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6338. [2022-11-16 19:33:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6328 states have (on average 4.063685208596713) internal successors, (25715), 6337 states have internal predecessors, (25715), 0 states have call successors, (0), 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-16 19:33:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 25715 transitions. [2022-11-16 19:33:52,132 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 25715 transitions. Word has length 16 [2022-11-16 19:33:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:52,133 INFO L495 AbstractCegarLoop]: Abstraction has 6338 states and 25715 transitions. [2022-11-16 19:33:52,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-16 19:33:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 25715 transitions. [2022-11-16 19:33:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 19:33:52,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:52,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:52,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 19:33:52,136 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:33:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1022685457, now seen corresponding path program 1 times [2022-11-16 19:33:52,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:33:52,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114643622] [2022-11-16 19:33:52,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:33:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 19:33:52,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:33:52,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114643622] [2022-11-16 19:33:52,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114643622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:33:52,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:33:52,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:33:52,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732868219] [2022-11-16 19:33:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:33:52,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:33:52,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:33:52,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:33:52,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:33:52,833 INFO L87 Difference]: Start difference. First operand 6338 states and 25715 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-16 19:33:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:55,608 INFO L93 Difference]: Finished difference Result 9223 states and 37357 transitions. [2022-11-16 19:33:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:33:55,608 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 18 [2022-11-16 19:33:55,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:55,662 INFO L225 Difference]: With dead ends: 9223 [2022-11-16 19:33:55,662 INFO L226 Difference]: Without dead ends: 9223 [2022-11-16 19:33:55,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:33:55,663 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 104 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:55,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 100 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-16 19:33:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2022-11-16 19:33:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 8533. [2022-11-16 19:33:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8533 states, 8523 states have (on average 4.118737533732254) internal successors, (35104), 8532 states have internal predecessors, (35104), 0 states have call successors, (0), 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-16 19:33:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8533 states to 8533 states and 35104 transitions. [2022-11-16 19:33:56,170 INFO L78 Accepts]: Start accepts. Automaton has 8533 states and 35104 transitions. Word has length 18 [2022-11-16 19:33:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:33:56,171 INFO L495 AbstractCegarLoop]: Abstraction has 8533 states and 35104 transitions. [2022-11-16 19:33:56,172 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-16 19:33:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 8533 states and 35104 transitions. [2022-11-16 19:33:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 19:33:56,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:33:56,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:33:56,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 19:33:56,178 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:33:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:33:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1268855545, now seen corresponding path program 1 times [2022-11-16 19:33:56,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:33:56,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380957721] [2022-11-16 19:33:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:56,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:33:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 19:33:56,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:33:56,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380957721] [2022-11-16 19:33:56,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380957721] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:33:56,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695965423] [2022-11-16 19:33:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:33:56,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:33:56,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:33:56,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:33:56,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 19:33:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:33:56,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 19:33:56,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:33:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 19:33:57,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:33:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 19:33:57,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695965423] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:33:57,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1898501558] [2022-11-16 19:33:57,481 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-16 19:33:57,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:33:57,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-16 19:33:57,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171281994] [2022-11-16 19:33:57,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:33:57,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 19:33:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:33:57,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 19:33:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-16 19:33:57,495 INFO L87 Difference]: Start difference. First operand 8533 states and 35104 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:33:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:33:59,541 INFO L93 Difference]: Finished difference Result 9581 states and 38984 transitions. [2022-11-16 19:33:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:33:59,542 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 19:33:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:33:59,576 INFO L225 Difference]: With dead ends: 9581 [2022-11-16 19:33:59,576 INFO L226 Difference]: Without dead ends: 9581 [2022-11-16 19:33:59,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:33:59,578 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 124 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 19:33:59,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 313 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-16 19:33:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9581 states. [2022-11-16 19:33:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9581 to 9216. [2022-11-16 19:33:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9206 states have (on average 4.111449054964154) internal successors, (37850), 9215 states have internal predecessors, (37850), 0 states have call successors, (0), 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-16 19:34:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 37850 transitions. [2022-11-16 19:34:00,041 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 37850 transitions. Word has length 21 [2022-11-16 19:34:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:00,042 INFO L495 AbstractCegarLoop]: Abstraction has 9216 states and 37850 transitions. [2022-11-16 19:34:00,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:34:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 37850 transitions. [2022-11-16 19:34:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 19:34:00,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:34:00,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:00,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 19:34:00,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 19:34:00,254 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:34:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:34:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash 406092264, now seen corresponding path program 1 times [2022-11-16 19:34:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:34:00,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336293885] [2022-11-16 19:34:00,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:00,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:34:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 19:34:00,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:34:00,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336293885] [2022-11-16 19:34:00,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336293885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:34:00,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691142241] [2022-11-16 19:34:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:00,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:34:00,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:34:00,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:34:00,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 19:34:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:01,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 19:34:01,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:34:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 19:34:01,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:34:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 19:34:01,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691142241] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:34:01,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [68086135] [2022-11-16 19:34:01,527 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-16 19:34:01,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:34:01,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-16 19:34:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281839083] [2022-11-16 19:34:01,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:34:01,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 19:34:01,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:34:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 19:34:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-16 19:34:01,531 INFO L87 Difference]: Start difference. First operand 9216 states and 37850 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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-16 19:34:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:34:03,319 INFO L93 Difference]: Finished difference Result 9281 states and 37616 transitions. [2022-11-16 19:34:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:34:03,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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-16 19:34:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:34:03,356 INFO L225 Difference]: With dead ends: 9281 [2022-11-16 19:34:03,356 INFO L226 Difference]: Without dead ends: 9281 [2022-11-16 19:34:03,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:34:03,357 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 186 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:34:03,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 539 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-16 19:34:03,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2022-11-16 19:34:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 9209. [2022-11-16 19:34:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9209 states, 9199 states have (on average 4.072725296227851) internal successors, (37465), 9208 states have internal predecessors, (37465), 0 states have call successors, (0), 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-16 19:34:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9209 states to 9209 states and 37465 transitions. [2022-11-16 19:34:03,900 INFO L78 Accepts]: Start accepts. Automaton has 9209 states and 37465 transitions. Word has length 21 [2022-11-16 19:34:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:03,901 INFO L495 AbstractCegarLoop]: Abstraction has 9209 states and 37465 transitions. [2022-11-16 19:34:03,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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-16 19:34:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 9209 states and 37465 transitions. [2022-11-16 19:34:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 19:34:03,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:34:03,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:03,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 19:34:04,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 19:34:04,118 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:34:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:34:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1537991109, now seen corresponding path program 2 times [2022-11-16 19:34:04,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:34:04,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830283073] [2022-11-16 19:34:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:34:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 19:34:06,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:34:06,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830283073] [2022-11-16 19:34:06,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830283073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:34:06,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:34:06,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 19:34:06,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001859082] [2022-11-16 19:34:06,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:34:06,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 19:34:06,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:34:06,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 19:34:06,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-16 19:34:06,430 INFO L87 Difference]: Start difference. First operand 9209 states and 37465 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 19:34:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:34:08,986 INFO L93 Difference]: Finished difference Result 23053 states and 94195 transitions. [2022-11-16 19:34:08,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 19:34:08,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 24 [2022-11-16 19:34:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:34:09,082 INFO L225 Difference]: With dead ends: 23053 [2022-11-16 19:34:09,082 INFO L226 Difference]: Without dead ends: 23053 [2022-11-16 19:34:09,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-11-16 19:34:09,083 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 619 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:34:09,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 124 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-16 19:34:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23053 states. [2022-11-16 19:34:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23053 to 9420. [2022-11-16 19:34:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9420 states, 9412 states have (on average 4.14747131321717) internal successors, (39036), 9419 states have internal predecessors, (39036), 0 states have call successors, (0), 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-16 19:34:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9420 states to 9420 states and 39036 transitions. [2022-11-16 19:34:09,757 INFO L78 Accepts]: Start accepts. Automaton has 9420 states and 39036 transitions. Word has length 24 [2022-11-16 19:34:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:09,758 INFO L495 AbstractCegarLoop]: Abstraction has 9420 states and 39036 transitions. [2022-11-16 19:34:09,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 19:34:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 9420 states and 39036 transitions. [2022-11-16 19:34:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 19:34:09,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:34:09,766 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:09,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 19:34:09,767 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:34:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:34:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1424882331, now seen corresponding path program 3 times [2022-11-16 19:34:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:34:09,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638497006] [2022-11-16 19:34:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:09,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:34:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 19:34:11,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:34:11,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638497006] [2022-11-16 19:34:11,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638497006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:34:11,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:34:11,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:34:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717239625] [2022-11-16 19:34:11,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:34:11,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 19:34:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:34:11,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 19:34:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-16 19:34:11,410 INFO L87 Difference]: Start difference. First operand 9420 states and 39036 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 19:34:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:34:14,126 INFO L93 Difference]: Finished difference Result 19178 states and 79015 transitions. [2022-11-16 19:34:14,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 19:34:14,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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 24 [2022-11-16 19:34:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:34:14,203 INFO L225 Difference]: With dead ends: 19178 [2022-11-16 19:34:14,203 INFO L226 Difference]: Without dead ends: 19178 [2022-11-16 19:34:14,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-16 19:34:14,204 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 384 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:34:14,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 135 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-16 19:34:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19178 states. [2022-11-16 19:34:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19178 to 9494. [2022-11-16 19:34:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9494 states, 9486 states have (on average 4.1502213788741305) internal successors, (39369), 9493 states have internal predecessors, (39369), 0 states have call successors, (0), 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-16 19:34:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 39369 transitions. [2022-11-16 19:34:14,826 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 39369 transitions. Word has length 24 [2022-11-16 19:34:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:14,827 INFO L495 AbstractCegarLoop]: Abstraction has 9494 states and 39369 transitions. [2022-11-16 19:34:14,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 19:34:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 39369 transitions. [2022-11-16 19:34:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 19:34:14,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:34:14,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:14,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 19:34:14,835 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:34:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:34:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 675227828, now seen corresponding path program 2 times [2022-11-16 19:34:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:34:14,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619633297] [2022-11-16 19:34:14,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:34:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 19:34:16,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:34:16,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619633297] [2022-11-16 19:34:16,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619633297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:34:16,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:34:16,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 19:34:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897879355] [2022-11-16 19:34:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:34:16,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 19:34:16,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:34:16,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 19:34:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-16 19:34:16,254 INFO L87 Difference]: Start difference. First operand 9494 states and 39369 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 19:34:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:34:18,452 INFO L93 Difference]: Finished difference Result 8914 states and 36833 transitions. [2022-11-16 19:34:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:34:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 24 [2022-11-16 19:34:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:34:18,490 INFO L225 Difference]: With dead ends: 8914 [2022-11-16 19:34:18,490 INFO L226 Difference]: Without dead ends: 8914 [2022-11-16 19:34:18,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-16 19:34:18,492 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 373 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 19:34:18,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 72 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-16 19:34:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8914 states. [2022-11-16 19:34:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8914 to 6594. [2022-11-16 19:34:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6594 states, 6590 states have (on average 4.049924127465857) internal successors, (26689), 6593 states have internal predecessors, (26689), 0 states have call successors, (0), 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-16 19:34:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6594 states to 6594 states and 26689 transitions. [2022-11-16 19:34:18,788 INFO L78 Accepts]: Start accepts. Automaton has 6594 states and 26689 transitions. Word has length 24 [2022-11-16 19:34:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:18,788 INFO L495 AbstractCegarLoop]: Abstraction has 6594 states and 26689 transitions. [2022-11-16 19:34:18,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 19:34:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 6594 states and 26689 transitions. [2022-11-16 19:34:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 19:34:18,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:34:18,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:18,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 19:34:18,876 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:34:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:34:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1269804894, now seen corresponding path program 1 times [2022-11-16 19:34:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:34:18,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196609184] [2022-11-16 19:34:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:34:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 19:34:19,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:34:19,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196609184] [2022-11-16 19:34:19,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196609184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:34:19,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:34:19,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:34:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124892407] [2022-11-16 19:34:19,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:34:19,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:34:19,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:34:19,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:34:19,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:34:19,415 INFO L87 Difference]: Start difference. First operand 6594 states and 26689 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-16 19:34:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:34:21,074 INFO L93 Difference]: Finished difference Result 7959 states and 32268 transitions. [2022-11-16 19:34:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:34:21,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 25 [2022-11-16 19:34:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:34:21,101 INFO L225 Difference]: With dead ends: 7959 [2022-11-16 19:34:21,102 INFO L226 Difference]: Without dead ends: 7959 [2022-11-16 19:34:21,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:34:21,103 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:34:21,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 66 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-16 19:34:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states. [2022-11-16 19:34:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7404. [2022-11-16 19:34:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7404 states, 7400 states have (on average 4.060540540540541) internal successors, (30048), 7403 states have internal predecessors, (30048), 0 states have call successors, (0), 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-16 19:34:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 30048 transitions. [2022-11-16 19:34:21,440 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 30048 transitions. Word has length 25 [2022-11-16 19:34:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:21,441 INFO L495 AbstractCegarLoop]: Abstraction has 7404 states and 30048 transitions. [2022-11-16 19:34:21,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-16 19:34:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 30048 transitions. [2022-11-16 19:34:21,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 19:34:21,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:34:21,450 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:21,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 19:34:21,450 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:34:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:34:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2058959913, now seen corresponding path program 4 times [2022-11-16 19:34:21,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:34:21,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097777722] [2022-11-16 19:34:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:34:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:34:21,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:34:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097777722] [2022-11-16 19:34:21,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097777722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:34:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146232883] [2022-11-16 19:34:21,942 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 19:34:21,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:34:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:34:21,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:34:21,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 19:34:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:22,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 19:34:22,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:34:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:34:22,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:34:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:34:22,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146232883] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:34:22,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1654024065] [2022-11-16 19:34:22,912 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-16 19:34:22,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:34:22,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-16 19:34:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896562810] [2022-11-16 19:34:22,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:34:22,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 19:34:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:34:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 19:34:22,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-16 19:34:22,916 INFO L87 Difference]: Start difference. First operand 7404 states and 30048 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:34:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:34:25,617 INFO L93 Difference]: Finished difference Result 18423 states and 73089 transitions. [2022-11-16 19:34:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 19:34:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 19:34:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:34:25,693 INFO L225 Difference]: With dead ends: 18423 [2022-11-16 19:34:25,693 INFO L226 Difference]: Without dead ends: 18423 [2022-11-16 19:34:25,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2022-11-16 19:34:25,694 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 607 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:34:25,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1126 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-16 19:34:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18423 states. [2022-11-16 19:34:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18423 to 14395. [2022-11-16 19:34:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14395 states, 14391 states have (on average 4.161211868528942) internal successors, (59884), 14394 states have internal predecessors, (59884), 0 states have call successors, (0), 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-16 19:34:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14395 states to 14395 states and 59884 transitions. [2022-11-16 19:34:26,318 INFO L78 Accepts]: Start accepts. Automaton has 14395 states and 59884 transitions. Word has length 26 [2022-11-16 19:34:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:26,318 INFO L495 AbstractCegarLoop]: Abstraction has 14395 states and 59884 transitions. [2022-11-16 19:34:26,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:34:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 14395 states and 59884 transitions. [2022-11-16 19:34:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 19:34:26,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:34:26,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:26,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 19:34:26,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 19:34:26,543 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:34:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:34:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1891934090, now seen corresponding path program 1 times [2022-11-16 19:34:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:34:26,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986524116] [2022-11-16 19:34:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:26,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:34:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 19:34:27,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:34:27,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986524116] [2022-11-16 19:34:27,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986524116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:34:27,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:34:27,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:34:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630636268] [2022-11-16 19:34:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:34:27,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:34:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:34:27,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:34:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:34:27,142 INFO L87 Difference]: Start difference. First operand 14395 states and 59884 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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-16 19:34:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:34:29,410 INFO L93 Difference]: Finished difference Result 14470 states and 60094 transitions. [2022-11-16 19:34:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:34:29,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-16 19:34:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:34:29,467 INFO L225 Difference]: With dead ends: 14470 [2022-11-16 19:34:29,468 INFO L226 Difference]: Without dead ends: 10859 [2022-11-16 19:34:29,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:34:29,469 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 32 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:34:29,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 82 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-16 19:34:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10859 states. [2022-11-16 19:34:29,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10859 to 10859. [2022-11-16 19:34:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10859 states, 10855 states have (on average 3.936895439889452) internal successors, (42735), 10858 states have internal predecessors, (42735), 0 states have call successors, (0), 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-16 19:34:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10859 states to 10859 states and 42735 transitions. [2022-11-16 19:34:29,797 INFO L78 Accepts]: Start accepts. Automaton has 10859 states and 42735 transitions. Word has length 28 [2022-11-16 19:34:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:29,798 INFO L495 AbstractCegarLoop]: Abstraction has 10859 states and 42735 transitions. [2022-11-16 19:34:29,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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-16 19:34:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 10859 states and 42735 transitions. [2022-11-16 19:34:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 19:34:29,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:34:29,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:29,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 19:34:29,804 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:34:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:34:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash 582938187, now seen corresponding path program 5 times [2022-11-16 19:34:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:34:29,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077702136] [2022-11-16 19:34:29,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:29,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:34:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:34:32,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:34:32,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077702136] [2022-11-16 19:34:32,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077702136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:34:32,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629722163] [2022-11-16 19:34:32,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 19:34:32,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:34:32,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:34:32,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:34:32,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 19:34:33,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 19:34:33,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:34:33,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-16 19:34:33,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:34:33,951 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:34:33,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:34:34,030 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:34:34,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:34:34,125 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:34:34,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:34:34,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:34:34,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:34:34,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:34:34,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-16 19:34:35,064 INFO L321 Elim1Store]: treesize reduction 527, result has 6.4 percent of original size [2022-11-16 19:34:35,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 101 [2022-11-16 19:34:35,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2022-11-16 19:34:39,405 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-16 19:34:39,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-16 19:34:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:34:41,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:34:41,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629722163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:34:41,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 19:34:41,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2022-11-16 19:34:41,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881391376] [2022-11-16 19:34:41,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:34:41,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 19:34:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:34:41,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 19:34:41,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=399, Unknown=1, NotChecked=0, Total=506 [2022-11-16 19:34:41,546 INFO L87 Difference]: Start difference. First operand 10859 states and 42735 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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-16 19:34:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:34:52,176 INFO L93 Difference]: Finished difference Result 18672 states and 75187 transitions. [2022-11-16 19:34:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 19:34:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 29 [2022-11-16 19:34:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:34:52,269 INFO L225 Difference]: With dead ends: 18672 [2022-11-16 19:34:52,270 INFO L226 Difference]: Without dead ends: 18672 [2022-11-16 19:34:52,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=284, Invalid=769, Unknown=3, NotChecked=0, Total=1056 [2022-11-16 19:34:52,271 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 398 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 19:34:52,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 206 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 518 Invalid, 0 Unknown, 172 Unchecked, 1.9s Time] [2022-11-16 19:34:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18672 states. [2022-11-16 19:34:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18672 to 11673. [2022-11-16 19:34:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11673 states, 11669 states have (on average 3.96983460450767) internal successors, (46324), 11672 states have internal predecessors, (46324), 0 states have call successors, (0), 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-16 19:34:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11673 states to 11673 states and 46324 transitions. [2022-11-16 19:34:52,642 INFO L78 Accepts]: Start accepts. Automaton has 11673 states and 46324 transitions. Word has length 29 [2022-11-16 19:34:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:34:52,642 INFO L495 AbstractCegarLoop]: Abstraction has 11673 states and 46324 transitions. [2022-11-16 19:34:52,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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-16 19:34:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 11673 states and 46324 transitions. [2022-11-16 19:34:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 19:34:52,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:34:52,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:34:52,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 19:34:52,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 19:34:52,852 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:34:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:34:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 582357867, now seen corresponding path program 6 times [2022-11-16 19:34:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:34:52,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475183420] [2022-11-16 19:34:52,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:34:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:34:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:34:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:34:55,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:34:55,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475183420] [2022-11-16 19:34:55,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475183420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:34:55,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279779019] [2022-11-16 19:34:55,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 19:34:55,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:34:55,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:34:55,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:34:55,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 19:34:56,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 19:34:56,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:34:56,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-16 19:34:56,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:34:56,599 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:34:56,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:34:56,650 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:34:56,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:34:56,761 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:34:56,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:34:57,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:34:57,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:34:57,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:34:57,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-16 19:34:57,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:34:57,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-16 19:34:57,946 INFO L321 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-16 19:34:57,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 116 [2022-11-16 19:34:57,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2022-11-16 19:35:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:35:02,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:35:02,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279779019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:35:02,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 19:35:02,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2022-11-16 19:35:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157822398] [2022-11-16 19:35:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:35:02,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 19:35:02,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:35:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 19:35:02,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=472, Unknown=1, NotChecked=0, Total=600 [2022-11-16 19:35:02,114 INFO L87 Difference]: Start difference. First operand 11673 states and 46324 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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-16 19:35:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:35:11,399 INFO L93 Difference]: Finished difference Result 18672 states and 75002 transitions. [2022-11-16 19:35:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 19:35:11,400 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 29 [2022-11-16 19:35:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:35:11,491 INFO L225 Difference]: With dead ends: 18672 [2022-11-16 19:35:11,491 INFO L226 Difference]: Without dead ends: 18524 [2022-11-16 19:35:11,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=325, Invalid=862, Unknown=3, NotChecked=0, Total=1190 [2022-11-16 19:35:11,493 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 448 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:35:11,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 202 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 870 Invalid, 0 Unknown, 150 Unchecked, 2.5s Time] [2022-11-16 19:35:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18524 states. [2022-11-16 19:35:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18524 to 10785. [2022-11-16 19:35:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10785 states, 10781 states have (on average 3.93646229477785) internal successors, (42439), 10784 states have internal predecessors, (42439), 0 states have call successors, (0), 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-16 19:35:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10785 states to 10785 states and 42439 transitions. [2022-11-16 19:35:11,898 INFO L78 Accepts]: Start accepts. Automaton has 10785 states and 42439 transitions. Word has length 29 [2022-11-16 19:35:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:35:11,899 INFO L495 AbstractCegarLoop]: Abstraction has 10785 states and 42439 transitions. [2022-11-16 19:35:11,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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-16 19:35:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 10785 states and 42439 transitions. [2022-11-16 19:35:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 19:35:11,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:35:11,905 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 19:35:11,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 19:35:12,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 19:35:12,106 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:35:12,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:35:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash -756591330, now seen corresponding path program 1 times [2022-11-16 19:35:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:35:12,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50625836] [2022-11-16 19:35:12,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:35:12,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:35:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:35:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 19:35:13,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:35:13,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50625836] [2022-11-16 19:35:13,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50625836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:35:13,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:35:13,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:35:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535956724] [2022-11-16 19:35:13,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:35:13,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:35:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:35:13,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:35:13,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:35:13,778 INFO L87 Difference]: Start difference. First operand 10785 states and 42439 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:35:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:35:15,734 INFO L93 Difference]: Finished difference Result 23237 states and 90723 transitions. [2022-11-16 19:35:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 19:35:15,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 19:35:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:35:15,819 INFO L225 Difference]: With dead ends: 23237 [2022-11-16 19:35:15,819 INFO L226 Difference]: Without dead ends: 21905 [2022-11-16 19:35:15,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:35:15,820 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 429 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:35:15,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 101 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-16 19:35:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21905 states. [2022-11-16 19:35:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21905 to 13608. [2022-11-16 19:35:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13608 states, 13605 states have (on average 3.92627710400588) internal successors, (53417), 13607 states have internal predecessors, (53417), 0 states have call successors, (0), 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-16 19:35:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13608 states to 13608 states and 53417 transitions. [2022-11-16 19:35:16,233 INFO L78 Accepts]: Start accepts. Automaton has 13608 states and 53417 transitions. Word has length 30 [2022-11-16 19:35:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:35:16,234 INFO L495 AbstractCegarLoop]: Abstraction has 13608 states and 53417 transitions. [2022-11-16 19:35:16,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:35:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13608 states and 53417 transitions. [2022-11-16 19:35:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 19:35:16,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:35:16,245 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 19:35:16,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 19:35:16,245 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:35:16,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:35:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash 130826430, now seen corresponding path program 2 times [2022-11-16 19:35:16,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:35:16,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422501160] [2022-11-16 19:35:16,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:35:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:35:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:35:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 19:35:18,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:35:18,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422501160] [2022-11-16 19:35:18,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422501160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:35:18,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:35:18,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:35:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968981603] [2022-11-16 19:35:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:35:18,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:35:18,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:35:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:35:18,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:35:18,162 INFO L87 Difference]: Start difference. First operand 13608 states and 53417 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:35:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:35:20,343 INFO L93 Difference]: Finished difference Result 22927 states and 90440 transitions. [2022-11-16 19:35:20,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 19:35:20,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 19:35:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:35:20,434 INFO L225 Difference]: With dead ends: 22927 [2022-11-16 19:35:20,435 INFO L226 Difference]: Without dead ends: 22483 [2022-11-16 19:35:20,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:35:20,436 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 297 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 19:35:20,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 143 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-16 19:35:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22483 states. [2022-11-16 19:35:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22483 to 13164. [2022-11-16 19:35:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13161 states have (on average 3.932223995137148) internal successors, (51752), 13163 states have internal predecessors, (51752), 0 states have call successors, (0), 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-16 19:35:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 51752 transitions. [2022-11-16 19:35:20,889 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 51752 transitions. Word has length 30 [2022-11-16 19:35:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:35:20,889 INFO L495 AbstractCegarLoop]: Abstraction has 13164 states and 51752 transitions. [2022-11-16 19:35:20,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:35:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 51752 transitions. [2022-11-16 19:35:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 19:35:21,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:35:21,012 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 19:35:21,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 19:35:21,012 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:35:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:35:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1737856023, now seen corresponding path program 1 times [2022-11-16 19:35:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:35:21,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71691306] [2022-11-16 19:35:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:35:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:35:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:35:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:35:21,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:35:21,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71691306] [2022-11-16 19:35:21,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71691306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:35:21,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693687132] [2022-11-16 19:35:21,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:35:21,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:35:21,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:35:21,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:35:21,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 19:35:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:35:21,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 19:35:21,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:35:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:35:22,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:35:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:35:22,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693687132] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 19:35:22,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 19:35:22,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-11-16 19:35:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190500939] [2022-11-16 19:35:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:35:22,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:35:22,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:35:22,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:35:22,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-16 19:35:22,169 INFO L87 Difference]: Start difference. First operand 13164 states and 51752 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 19:35:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:35:22,706 INFO L93 Difference]: Finished difference Result 13164 states and 51452 transitions. [2022-11-16 19:35:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:35:22,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-16 19:35:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:35:22,750 INFO L225 Difference]: With dead ends: 13164 [2022-11-16 19:35:22,750 INFO L226 Difference]: Without dead ends: 13164 [2022-11-16 19:35:22,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-16 19:35:22,751 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 174 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:35:22,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 40 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 19:35:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2022-11-16 19:35:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2022-11-16 19:35:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13161 states have (on average 3.9094293746675786) internal successors, (51452), 13163 states have internal predecessors, (51452), 0 states have call successors, (0), 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-16 19:35:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 51452 transitions. [2022-11-16 19:35:23,045 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 51452 transitions. Word has length 34 [2022-11-16 19:35:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:35:23,045 INFO L495 AbstractCegarLoop]: Abstraction has 13164 states and 51452 transitions. [2022-11-16 19:35:23,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 19:35:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 51452 transitions. [2022-11-16 19:35:23,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 19:35:23,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:35:23,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:35:23,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 19:35:23,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:35:23,258 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:35:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:35:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash 990143780, now seen corresponding path program 3 times [2022-11-16 19:35:23,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:35:23,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611659854] [2022-11-16 19:35:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:35:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:35:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:35:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:35:25,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:35:25,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611659854] [2022-11-16 19:35:25,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611659854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:35:25,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674985812] [2022-11-16 19:35:25,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 19:35:25,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:35:25,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:35:25,519 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:35:25,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 19:35:26,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 19:35:26,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:35:26,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-16 19:35:26,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:35:26,175 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:35:26,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:35:26,308 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:35:26,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:35:26,478 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:35:26,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:35:27,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:35:27,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:35:27,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-16 19:35:27,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-16 19:35:27,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 142 [2022-11-16 19:35:27,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 105 [2022-11-16 19:35:27,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:27,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 107 [2022-11-16 19:35:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 19:35:32,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:35:32,102 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0)) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ .cse2 2 c_~B~0.offset) 0) (+ .cse2 3 c_~B~0.offset) 0))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse1 3 c_~B~0.offset)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ 2 .cse1 c_~B~0.offset)))))) is different from false [2022-11-16 19:35:32,237 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ .cse2 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0)))) (let ((.cse1 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base (store (store (store (store (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0)) c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))) (and (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_4833) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ 2 .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0))))))) is different from false [2022-11-16 19:35:35,866 INFO L321 Elim1Store]: treesize reduction 1170, result has 11.6 percent of original size [2022-11-16 19:35:35,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 197 treesize of output 226 [2022-11-16 19:35:35,899 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-16 19:35:35,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 146 [2022-11-16 19:35:35,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 75 [2022-11-16 19:35:35,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2022-11-16 19:35:36,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:35:36,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 186 treesize of output 394 [2022-11-16 19:35:36,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 19:35:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 1 not checked. [2022-11-16 19:35:36,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674985812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:35:36,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [165178909] [2022-11-16 19:35:36,841 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-16 19:35:36,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:35:36,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 33 [2022-11-16 19:35:36,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550452575] [2022-11-16 19:35:36,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:35:36,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 19:35:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:35:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 19:35:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=776, Unknown=34, NotChecked=122, Total=1122 [2022-11-16 19:35:36,846 INFO L87 Difference]: Start difference. First operand 13164 states and 51452 transitions. Second operand has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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-16 19:35:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:35:47,255 INFO L93 Difference]: Finished difference Result 17172 states and 67686 transitions. [2022-11-16 19:35:47,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 19:35:47,256 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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-16 19:35:47,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:35:47,316 INFO L225 Difference]: With dead ends: 17172 [2022-11-16 19:35:47,316 INFO L226 Difference]: Without dead ends: 16987 [2022-11-16 19:35:47,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=424, Invalid=1618, Unknown=36, NotChecked=178, Total=2256 [2022-11-16 19:35:47,317 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 532 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 3407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1892 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:35:47,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 607 Invalid, 3407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1459 Invalid, 0 Unknown, 1892 Unchecked, 4.2s Time] [2022-11-16 19:35:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16987 states. [2022-11-16 19:35:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16987 to 14414. [2022-11-16 19:35:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14414 states, 14411 states have (on average 3.9355353549372007) internal successors, (56715), 14413 states have internal predecessors, (56715), 0 states have call successors, (0), 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-16 19:35:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14414 states to 14414 states and 56715 transitions. [2022-11-16 19:35:47,689 INFO L78 Accepts]: Start accepts. Automaton has 14414 states and 56715 transitions. Word has length 35 [2022-11-16 19:35:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:35:47,689 INFO L495 AbstractCegarLoop]: Abstraction has 14414 states and 56715 transitions. [2022-11-16 19:35:47,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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-16 19:35:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 14414 states and 56715 transitions. [2022-11-16 19:35:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 19:35:47,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:35:47,705 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:35:47,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 19:35:47,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:35:47,906 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:35:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:35:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1007938400, now seen corresponding path program 4 times [2022-11-16 19:35:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:35:47,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091183443] [2022-11-16 19:35:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:35:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:35:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:35:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:35:49,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:35:49,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091183443] [2022-11-16 19:35:49,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091183443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:35:49,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703563767] [2022-11-16 19:35:49,914 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 19:35:49,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:35:49,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:35:49,915 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:35:49,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 19:35:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:35:50,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-16 19:35:50,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:35:50,761 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:35:50,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:35:50,989 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:35:50,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:35:51,310 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:35:51,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:35:52,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:35:52,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:35:52,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 24 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 100 [2022-11-16 19:35:52,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2022-11-16 19:35:52,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 130 [2022-11-16 19:35:52,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:35:52,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 145 [2022-11-16 19:35:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 19:35:53,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:35:53,209 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0))))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_5378 (Array Int Int))) (= 0 (select (select (store .cse0 c_~C~0.base v_ArrVal_5378) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)))) (forall ((v_ArrVal_5378 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5378) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)))) is different from false [2022-11-16 19:35:54,965 INFO L321 Elim1Store]: treesize reduction 2023, result has 6.0 percent of original size [2022-11-16 19:35:54,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 142 [2022-11-16 19:35:55,035 INFO L321 Elim1Store]: treesize reduction 466, result has 0.2 percent of original size [2022-11-16 19:35:55,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 157 treesize of output 62 [2022-11-16 19:35:55,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 19:35:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 1 not checked. [2022-11-16 19:35:55,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703563767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:35:55,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [41946956] [2022-11-16 19:35:55,454 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-16 19:35:55,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:35:55,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 9] total 34 [2022-11-16 19:35:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973737592] [2022-11-16 19:35:55,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:35:55,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-16 19:35:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:35:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-16 19:35:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=954, Unknown=8, NotChecked=64, Total=1190 [2022-11-16 19:35:55,456 INFO L87 Difference]: Start difference. First operand 14414 states and 56715 transitions. Second operand has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 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-16 19:36:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:36:06,239 INFO L93 Difference]: Finished difference Result 20108 states and 80260 transitions. [2022-11-16 19:36:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 19:36:06,240 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 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-16 19:36:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:36:06,313 INFO L225 Difference]: With dead ends: 20108 [2022-11-16 19:36:06,313 INFO L226 Difference]: Without dead ends: 20108 [2022-11-16 19:36:06,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=515, Invalid=2451, Unknown=8, NotChecked=106, Total=3080 [2022-11-16 19:36:06,315 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 608 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 4379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1994 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:36:06,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 984 Invalid, 4379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2305 Invalid, 0 Unknown, 1994 Unchecked, 8.0s Time] [2022-11-16 19:36:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20108 states. [2022-11-16 19:36:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20108 to 14636. [2022-11-16 19:36:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14636 states, 14633 states have (on average 3.949156017221349) internal successors, (57788), 14635 states have internal predecessors, (57788), 0 states have call successors, (0), 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-16 19:36:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14636 states to 14636 states and 57788 transitions. [2022-11-16 19:36:06,692 INFO L78 Accepts]: Start accepts. Automaton has 14636 states and 57788 transitions. Word has length 35 [2022-11-16 19:36:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:36:06,693 INFO L495 AbstractCegarLoop]: Abstraction has 14636 states and 57788 transitions. [2022-11-16 19:36:06,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 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-16 19:36:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 14636 states and 57788 transitions. [2022-11-16 19:36:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 19:36:06,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:36:06,709 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-16 19:36:06,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 19:36:06,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-16 19:36:06,911 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:36:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:36:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1421813057, now seen corresponding path program 1 times [2022-11-16 19:36:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:36:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030535600] [2022-11-16 19:36:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:36:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:36:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:36:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:36:08,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:36:08,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030535600] [2022-11-16 19:36:08,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030535600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:36:08,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260770042] [2022-11-16 19:36:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:36:08,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:36:08,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:36:08,813 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:36:08,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 19:36:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:36:09,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-16 19:36:09,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:36:09,679 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:36:09,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:36:09,816 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:36:09,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:36:09,975 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:36:09,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:36:10,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:36:10,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:36:11,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-16 19:36:11,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 30 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 140 [2022-11-16 19:36:11,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 118 [2022-11-16 19:36:11,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:11,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 170 [2022-11-16 19:36:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 19:36:11,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:36:16,350 INFO L321 Elim1Store]: treesize reduction 2652, result has 5.0 percent of original size [2022-11-16 19:36:16,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 235 treesize of output 156 [2022-11-16 19:36:16,427 INFO L321 Elim1Store]: treesize reduction 599, result has 0.2 percent of original size [2022-11-16 19:36:16,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 172 treesize of output 67 [2022-11-16 19:36:16,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-16 19:36:16,691 INFO L321 Elim1Store]: treesize reduction 2792, result has 0.0 percent of original size [2022-11-16 19:36:16,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 234 treesize of output 1 [2022-11-16 19:36:16,941 INFO L321 Elim1Store]: treesize reduction 2792, result has 0.0 percent of original size [2022-11-16 19:36:16,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 235 treesize of output 1 [2022-11-16 19:36:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 19:36:17,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260770042] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:36:17,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1683863614] [2022-11-16 19:36:17,372 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-16 19:36:17,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:36:17,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 32 [2022-11-16 19:36:17,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457194135] [2022-11-16 19:36:17,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:36:17,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 19:36:17,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:36:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 19:36:17,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=855, Unknown=36, NotChecked=0, Total=1056 [2022-11-16 19:36:17,375 INFO L87 Difference]: Start difference. First operand 14636 states and 57788 transitions. Second operand has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 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-16 19:36:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:36:27,750 INFO L93 Difference]: Finished difference Result 17931 states and 70940 transitions. [2022-11-16 19:36:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 19:36:27,751 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-16 19:36:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:36:27,814 INFO L225 Difference]: With dead ends: 17931 [2022-11-16 19:36:27,814 INFO L226 Difference]: Without dead ends: 17857 [2022-11-16 19:36:27,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=403, Invalid=1815, Unknown=38, NotChecked=0, Total=2256 [2022-11-16 19:36:27,815 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 589 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 988 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:36:27,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 824 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1746 Invalid, 0 Unknown, 988 Unchecked, 5.3s Time] [2022-11-16 19:36:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2022-11-16 19:36:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 14402. [2022-11-16 19:36:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14402 states, 14399 states have (on average 3.9481908465865687) internal successors, (56850), 14401 states have internal predecessors, (56850), 0 states have call successors, (0), 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-16 19:36:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14402 states to 14402 states and 56850 transitions. [2022-11-16 19:36:28,173 INFO L78 Accepts]: Start accepts. Automaton has 14402 states and 56850 transitions. Word has length 37 [2022-11-16 19:36:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:36:28,173 INFO L495 AbstractCegarLoop]: Abstraction has 14402 states and 56850 transitions. [2022-11-16 19:36:28,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 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-16 19:36:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14402 states and 56850 transitions. [2022-11-16 19:36:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 19:36:28,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:36:28,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-16 19:36:28,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 19:36:28,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 19:36:28,392 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:36:28,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:36:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2033715501, now seen corresponding path program 2 times [2022-11-16 19:36:28,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:36:28,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573102019] [2022-11-16 19:36:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:36:28,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:36:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:36:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:36:29,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:36:29,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573102019] [2022-11-16 19:36:29,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573102019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:36:29,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538854368] [2022-11-16 19:36:29,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 19:36:29,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:36:29,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:36:29,952 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:36:29,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 19:36:34,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 19:36:34,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:36:34,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-16 19:36:34,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:36:34,449 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:36:34,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:36:34,671 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:36:34,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:36:34,801 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:36:34,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:36:35,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:36:35,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:36:35,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:36:35,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2022-11-16 19:36:35,556 INFO L321 Elim1Store]: treesize reduction 352, result has 6.4 percent of original size [2022-11-16 19:36:35,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 77 [2022-11-16 19:36:39,858 INFO L321 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-16 19:36:39,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-16 19:36:42,109 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-16 19:36:42,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-16 19:36:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 19:36:50,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:36:51,673 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ .cse4 c_~B~0.offset 1))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0)))) (and (forall ((|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (forall ((v_ArrVal_6436 (Array Int Int)) (v_ArrVal_6447 (Array Int Int)) (v_ArrVal_6437 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_6447) c_~B~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_6436) c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_6437) c_~B~0.base) .cse2) 0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))) (forall ((|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (forall ((v_ArrVal_6436 (Array Int Int)) (v_ArrVal_6447 (Array Int Int)) (v_ArrVal_6437 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_6447) c_~B~0.base (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_6436) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_6437) c_~B~0.base) (+ .cse4 c_~B~0.offset)) 0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))) is different from false [2022-11-16 19:36:51,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:36:51,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 83 [2022-11-16 19:36:51,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 133 [2022-11-16 19:36:51,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:36:51,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:36:51,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:36:51,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 85 [2022-11-16 19:36:51,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:36:51,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:36:51,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:36:51,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-16 19:36:51,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-16 19:36:51,774 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-11-16 19:36:51,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 1 [2022-11-16 19:36:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 4 refuted. 1 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 19:36:52,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538854368] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:36:52,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [679520726] [2022-11-16 19:36:52,371 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-16 19:36:52,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:36:52,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 37 [2022-11-16 19:36:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731352550] [2022-11-16 19:36:52,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:36:52,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 19:36:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:36:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 19:36:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1210, Unknown=19, NotChecked=72, Total=1482 [2022-11-16 19:36:52,375 INFO L87 Difference]: Start difference. First operand 14402 states and 56850 transitions. Second operand has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 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-16 19:38:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:38:12,573 INFO L93 Difference]: Finished difference Result 23974 states and 95324 transitions. [2022-11-16 19:38:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 19:38:12,574 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-16 19:38:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:38:12,660 INFO L225 Difference]: With dead ends: 23974 [2022-11-16 19:38:12,660 INFO L226 Difference]: Without dead ends: 23834 [2022-11-16 19:38:12,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 82.8s TimeCoverageRelationStatistics Valid=1270, Invalid=5831, Unknown=43, NotChecked=166, Total=7310 [2022-11-16 19:38:12,662 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 936 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 3778 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 8440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4549 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:38:12,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1852 Invalid, 8440 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [113 Valid, 3778 Invalid, 0 Unknown, 4549 Unchecked, 13.5s Time] [2022-11-16 19:38:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23834 states. [2022-11-16 19:38:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23834 to 14735. [2022-11-16 19:38:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14735 states, 14732 states have (on average 3.9543850122183004) internal successors, (58256), 14734 states have internal predecessors, (58256), 0 states have call successors, (0), 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-16 19:38:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14735 states to 14735 states and 58256 transitions. [2022-11-16 19:38:13,126 INFO L78 Accepts]: Start accepts. Automaton has 14735 states and 58256 transitions. Word has length 37 [2022-11-16 19:38:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:38:13,126 INFO L495 AbstractCegarLoop]: Abstraction has 14735 states and 58256 transitions. [2022-11-16 19:38:13,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 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-16 19:38:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 14735 states and 58256 transitions. [2022-11-16 19:38:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 19:38:13,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:38:13,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:38:13,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 19:38:13,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 19:38:13,345 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:38:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:38:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2033711378, now seen corresponding path program 5 times [2022-11-16 19:38:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:38:13,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136833988] [2022-11-16 19:38:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:38:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:38:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:38:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 19:38:13,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:38:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136833988] [2022-11-16 19:38:13,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136833988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:38:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661146675] [2022-11-16 19:38:13,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 19:38:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:38:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:38:13,813 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:38:13,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 19:38:20,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 19:38:20,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:38:20,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 19:38:20,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:38:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 19:38:21,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:38:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 19:38:21,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661146675] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:38:21,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567034932] [2022-11-16 19:38:21,656 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-16 19:38:21,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:38:21,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-11-16 19:38:21,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140833977] [2022-11-16 19:38:21,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:38:21,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 19:38:21,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:38:21,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 19:38:21,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-11-16 19:38:21,659 INFO L87 Difference]: Start difference. First operand 14735 states and 58256 transitions. Second operand has 22 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 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-16 19:38:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:38:25,057 INFO L93 Difference]: Finished difference Result 39471 states and 153510 transitions. [2022-11-16 19:38:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 19:38:25,058 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-16 19:38:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:38:25,188 INFO L225 Difference]: With dead ends: 39471 [2022-11-16 19:38:25,188 INFO L226 Difference]: Without dead ends: 34424 [2022-11-16 19:38:25,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 19:38:25,189 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 1170 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:38:25,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1137 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-16 19:38:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34424 states. [2022-11-16 19:38:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34424 to 22875. [2022-11-16 19:38:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22875 states, 22872 states have (on average 3.9652413431269675) internal successors, (90693), 22874 states have internal predecessors, (90693), 0 states have call successors, (0), 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-16 19:38:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22875 states to 22875 states and 90693 transitions. [2022-11-16 19:38:26,183 INFO L78 Accepts]: Start accepts. Automaton has 22875 states and 90693 transitions. Word has length 37 [2022-11-16 19:38:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:38:26,183 INFO L495 AbstractCegarLoop]: Abstraction has 22875 states and 90693 transitions. [2022-11-16 19:38:26,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 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-16 19:38:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 22875 states and 90693 transitions. [2022-11-16 19:38:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 19:38:26,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:38:26,208 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-16 19:38:26,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 19:38:26,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 19:38:26,408 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:38:26,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:38:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2032304691, now seen corresponding path program 3 times [2022-11-16 19:38:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:38:26,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564604950] [2022-11-16 19:38:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:38:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:38:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:38:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:38:28,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:38:28,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564604950] [2022-11-16 19:38:28,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564604950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:38:28,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864134099] [2022-11-16 19:38:28,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 19:38:28,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:38:28,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:38:28,408 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:38:28,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 19:38:29,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 19:38:29,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:38:29,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-16 19:38:29,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:38:29,193 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:38:29,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:38:29,317 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:38:29,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:38:29,452 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:38:29,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:38:30,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:38:30,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:38:30,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 24 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 125 [2022-11-16 19:38:30,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 108 [2022-11-16 19:38:30,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 155 [2022-11-16 19:38:30,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:30,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:31,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 170 [2022-11-16 19:38:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 19:38:31,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:38:31,404 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0))))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_7560 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_7560) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_7560 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_7560) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)))) is different from false [2022-11-16 19:38:33,280 INFO L321 Elim1Store]: treesize reduction 2023, result has 6.0 percent of original size [2022-11-16 19:38:33,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 142 [2022-11-16 19:38:33,333 INFO L321 Elim1Store]: treesize reduction 466, result has 0.2 percent of original size [2022-11-16 19:38:33,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 157 treesize of output 62 [2022-11-16 19:38:33,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 19:38:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 2 not checked. [2022-11-16 19:38:33,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864134099] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:38:33,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [497857590] [2022-11-16 19:38:33,590 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-16 19:38:33,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:38:33,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 31 [2022-11-16 19:38:33,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142538238] [2022-11-16 19:38:33,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:38:33,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 19:38:33,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:38:33,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 19:38:33,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=781, Unknown=7, NotChecked=58, Total=992 [2022-11-16 19:38:33,594 INFO L87 Difference]: Start difference. First operand 22875 states and 90693 transitions. Second operand has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 19:38:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:38:39,452 INFO L93 Difference]: Finished difference Result 27731 states and 109662 transitions. [2022-11-16 19:38:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 19:38:39,459 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-16 19:38:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:38:39,571 INFO L225 Difference]: With dead ends: 27731 [2022-11-16 19:38:39,571 INFO L226 Difference]: Without dead ends: 27723 [2022-11-16 19:38:39,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=375, Invalid=1602, Unknown=7, NotChecked=86, Total=2070 [2022-11-16 19:38:39,572 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 482 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 723 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:38:39,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 784 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1339 Invalid, 0 Unknown, 723 Unchecked, 3.6s Time] [2022-11-16 19:38:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27723 states. [2022-11-16 19:38:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27723 to 23311. [2022-11-16 19:38:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23311 states, 23308 states have (on average 3.961901493049597) internal successors, (92344), 23310 states have internal predecessors, (92344), 0 states have call successors, (0), 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-16 19:38:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23311 states to 23311 states and 92344 transitions. [2022-11-16 19:38:40,350 INFO L78 Accepts]: Start accepts. Automaton has 23311 states and 92344 transitions. Word has length 37 [2022-11-16 19:38:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:38:40,350 INFO L495 AbstractCegarLoop]: Abstraction has 23311 states and 92344 transitions. [2022-11-16 19:38:40,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 19:38:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 23311 states and 92344 transitions. [2022-11-16 19:38:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 19:38:40,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:38:40,373 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-16 19:38:40,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 19:38:40,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 19:38:40,574 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:38:40,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:38:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1986724461, now seen corresponding path program 4 times [2022-11-16 19:38:40,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:38:40,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022189892] [2022-11-16 19:38:40,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:38:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:38:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:38:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 19:38:43,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:38:43,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022189892] [2022-11-16 19:38:43,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022189892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:38:43,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433069634] [2022-11-16 19:38:43,057 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 19:38:43,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:38:43,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:38:43,061 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:38:43,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 19:38:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:38:43,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-16 19:38:43,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:38:43,851 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:38:43,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:38:44,050 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:38:44,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:38:44,313 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:38:44,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:38:45,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:38:45,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:38:45,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 24 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 100 [2022-11-16 19:38:45,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2022-11-16 19:38:45,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:45,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 130 [2022-11-16 19:38:46,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:38:46,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 145 [2022-11-16 19:38:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 19:38:46,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:38:49,351 INFO L321 Elim1Store]: treesize reduction 2023, result has 6.0 percent of original size [2022-11-16 19:38:49,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 142 [2022-11-16 19:38:49,416 INFO L321 Elim1Store]: treesize reduction 466, result has 0.2 percent of original size [2022-11-16 19:38:49,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 157 treesize of output 62 [2022-11-16 19:38:49,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 19:38:49,641 INFO L321 Elim1Store]: treesize reduction 2150, result has 0.0 percent of original size [2022-11-16 19:38:49,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 203 treesize of output 1 [2022-11-16 19:38:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 19:38:49,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433069634] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:38:49,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1090345272] [2022-11-16 19:38:49,991 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-16 19:38:49,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:38:49,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 9] total 36 [2022-11-16 19:38:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592008508] [2022-11-16 19:38:49,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:38:49,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-16 19:38:49,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:38:49,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-16 19:38:49,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1171, Unknown=11, NotChecked=0, Total=1332 [2022-11-16 19:38:49,994 INFO L87 Difference]: Start difference. First operand 23311 states and 92344 transitions. Second operand has 37 states, 36 states have (on average 2.638888888888889) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 19:39:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:39:19,885 INFO L93 Difference]: Finished difference Result 59783 states and 234924 transitions. [2022-11-16 19:39:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 19:39:19,885 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.638888888888889) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-16 19:39:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:39:20,175 INFO L225 Difference]: With dead ends: 59783 [2022-11-16 19:39:20,175 INFO L226 Difference]: Without dead ends: 59586 [2022-11-16 19:39:20,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 53 SyntacticMatches, 12 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2363 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=1159, Invalid=6129, Unknown=22, NotChecked=0, Total=7310 [2022-11-16 19:39:20,177 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1136 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 4372 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 7504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 4372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2933 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:39:20,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1735 Invalid, 7504 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [199 Valid, 4372 Invalid, 0 Unknown, 2933 Unchecked, 13.6s Time] [2022-11-16 19:39:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59586 states. [2022-11-16 19:39:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59586 to 27596. [2022-11-16 19:39:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27596 states, 27593 states have (on average 3.9622367991882) internal successors, (109330), 27595 states have internal predecessors, (109330), 0 states have call successors, (0), 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-16 19:39:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27596 states to 27596 states and 109330 transitions. [2022-11-16 19:39:21,607 INFO L78 Accepts]: Start accepts. Automaton has 27596 states and 109330 transitions. Word has length 37 [2022-11-16 19:39:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:39:21,608 INFO L495 AbstractCegarLoop]: Abstraction has 27596 states and 109330 transitions. [2022-11-16 19:39:21,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.638888888888889) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 19:39:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 27596 states and 109330 transitions. [2022-11-16 19:39:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 19:39:21,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:39:21,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:39:21,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 19:39:21,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 19:39:21,846 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:39:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:39:21,847 INFO L85 PathProgramCache]: Analyzing trace with hash -797504720, now seen corresponding path program 1 times [2022-11-16 19:39:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:39:21,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716013635] [2022-11-16 19:39:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:39:21,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:39:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:39:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:39:22,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:39:22,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716013635] [2022-11-16 19:39:22,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716013635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:39:22,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210577424] [2022-11-16 19:39:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:39:22,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:39:22,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:39:22,598 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:39:22,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 19:39:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:39:23,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 19:39:23,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:39:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:39:23,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:39:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:39:23,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210577424] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:39:23,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [608769924] [2022-11-16 19:39:23,964 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-16 19:39:23,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:39:23,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-16 19:39:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876986415] [2022-11-16 19:39:23,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:39:23,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 19:39:23,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:39:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 19:39:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-16 19:39:23,970 INFO L87 Difference]: Start difference. First operand 27596 states and 109330 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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-16 19:39:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:39:26,423 INFO L93 Difference]: Finished difference Result 29142 states and 114340 transitions. [2022-11-16 19:39:26,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 19:39:26,424 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-16 19:39:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:39:26,846 INFO L225 Difference]: With dead ends: 29142 [2022-11-16 19:39:26,846 INFO L226 Difference]: Without dead ends: 29142 [2022-11-16 19:39:26,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-11-16 19:39:26,847 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 286 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:39:26,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 427 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-16 19:39:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29142 states. [2022-11-16 19:39:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29142 to 28933. [2022-11-16 19:39:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28933 states, 28930 states have (on average 3.932699619771863) internal successors, (113773), 28932 states have internal predecessors, (113773), 0 states have call successors, (0), 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-16 19:39:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28933 states to 28933 states and 113773 transitions. [2022-11-16 19:39:27,744 INFO L78 Accepts]: Start accepts. Automaton has 28933 states and 113773 transitions. Word has length 37 [2022-11-16 19:39:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:39:27,745 INFO L495 AbstractCegarLoop]: Abstraction has 28933 states and 113773 transitions. [2022-11-16 19:39:27,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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-16 19:39:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 28933 states and 113773 transitions. [2022-11-16 19:39:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 19:39:27,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:39:27,781 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-16 19:39:27,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 19:39:27,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:39:27,990 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:39:27,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:39:27,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1423081420, now seen corresponding path program 1 times [2022-11-16 19:39:27,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:39:27,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837163493] [2022-11-16 19:39:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:39:27,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:39:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:39:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:39:30,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:39:30,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837163493] [2022-11-16 19:39:30,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837163493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:39:30,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974759284] [2022-11-16 19:39:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:39:30,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:39:30,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:39:30,317 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:39:30,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 19:39:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:39:31,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-16 19:39:31,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:39:31,231 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:39:31,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:39:31,370 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:39:31,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:39:31,509 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:39:31,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:39:32,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:39:32,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:39:32,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 24 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 125 [2022-11-16 19:39:32,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 108 [2022-11-16 19:39:32,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:32,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 155 [2022-11-16 19:39:33,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:33,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 170 [2022-11-16 19:39:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 19:39:33,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:39:33,529 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0))))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_9047 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_9047) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_9047 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_9047) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)))) is different from false [2022-11-16 19:39:35,179 INFO L321 Elim1Store]: treesize reduction 2023, result has 6.0 percent of original size [2022-11-16 19:39:35,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 142 [2022-11-16 19:39:35,240 INFO L321 Elim1Store]: treesize reduction 466, result has 0.2 percent of original size [2022-11-16 19:39:35,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 157 treesize of output 62 [2022-11-16 19:39:35,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 19:39:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 2 not checked. [2022-11-16 19:39:35,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974759284] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:39:35,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067618566] [2022-11-16 19:39:35,487 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-16 19:39:35,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:39:35,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 31 [2022-11-16 19:39:35,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473626915] [2022-11-16 19:39:35,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:39:35,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 19:39:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:39:35,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 19:39:35,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=781, Unknown=7, NotChecked=58, Total=992 [2022-11-16 19:39:35,489 INFO L87 Difference]: Start difference. First operand 28933 states and 113773 transitions. Second operand has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 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-16 19:39:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:39:42,188 INFO L93 Difference]: Finished difference Result 34732 states and 136944 transitions. [2022-11-16 19:39:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 19:39:42,189 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 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 38 [2022-11-16 19:39:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:39:42,321 INFO L225 Difference]: With dead ends: 34732 [2022-11-16 19:39:42,321 INFO L226 Difference]: Without dead ends: 34034 [2022-11-16 19:39:42,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=375, Invalid=1602, Unknown=7, NotChecked=86, Total=2070 [2022-11-16 19:39:42,322 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 458 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 767 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-16 19:39:42,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 725 Invalid, 2349 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 1525 Invalid, 0 Unknown, 767 Unchecked, 4.8s Time] [2022-11-16 19:39:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34034 states. [2022-11-16 19:39:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34034 to 28873. [2022-11-16 19:39:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28873 states, 28870 states have (on average 3.9320401801177693) internal successors, (113518), 28872 states have internal predecessors, (113518), 0 states have call successors, (0), 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-16 19:39:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 113518 transitions. [2022-11-16 19:39:43,608 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 113518 transitions. Word has length 38 [2022-11-16 19:39:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:39:43,608 INFO L495 AbstractCegarLoop]: Abstraction has 28873 states and 113518 transitions. [2022-11-16 19:39:43,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 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-16 19:39:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 113518 transitions. [2022-11-16 19:39:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 19:39:43,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:39:43,652 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-16 19:39:43,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 19:39:43,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 19:39:43,861 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:39:43,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:39:43,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1443455166, now seen corresponding path program 2 times [2022-11-16 19:39:43,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:39:43,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156741055] [2022-11-16 19:39:43,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:39:43,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:39:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:39:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:39:46,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:39:46,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156741055] [2022-11-16 19:39:46,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156741055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:39:46,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361355656] [2022-11-16 19:39:46,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 19:39:46,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:39:46,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:39:46,304 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:39:46,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 19:39:52,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 19:39:52,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:39:52,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-16 19:39:52,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:39:52,615 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:39:52,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:39:52,821 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:39:52,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:39:53,074 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:39:53,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:39:53,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:39:53,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:39:53,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:53,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2022-11-16 19:39:53,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:53,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:53,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:53,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:53,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:53,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:39:53,981 INFO L321 Elim1Store]: treesize reduction 57, result has 29.6 percent of original size [2022-11-16 19:39:53,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 13 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 77 [2022-11-16 19:40:04,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:04,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:40:04,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 101 [2022-11-16 19:40:06,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:40:06,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:40:06,576 INFO L350 Elim1Store]: Elim1 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 99 treesize of output 116 [2022-11-16 19:40:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:40:08,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:40:16,035 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ .cse2 c_~B~0.offset 1))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse4 0)))) (and (forall ((|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (forall ((v_ArrVal_9575 (Array Int Int)) (v_ArrVal_9568 (Array Int Int)) (v_ArrVal_9571 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_9568) c_~B~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_9571) c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_9575) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))) (forall ((|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (forall ((v_ArrVal_9575 (Array Int Int)) (v_ArrVal_9568 (Array Int Int)) (v_ArrVal_9571 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_9568) c_~B~0.base (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_9571) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_9575) c_~B~0.base) .cse4) 0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))) is different from false [2022-11-16 19:40:16,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:40:16,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 82 [2022-11-16 19:40:16,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 130 [2022-11-16 19:40:16,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:40:16,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:40:16,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:40:16,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 75 [2022-11-16 19:40:16,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:40:16,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 118 [2022-11-16 19:40:16,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-16 19:40:16,132 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-11-16 19:40:16,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 1 [2022-11-16 19:40:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 1 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 19:40:16,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361355656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:40:16,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1551079654] [2022-11-16 19:40:16,982 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-16 19:40:16,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:40:16,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 15] total 41 [2022-11-16 19:40:16,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287503266] [2022-11-16 19:40:16,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:40:16,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-16 19:40:16,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:40:16,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-16 19:40:16,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1500, Unknown=16, NotChecked=80, Total=1806 [2022-11-16 19:40:16,985 INFO L87 Difference]: Start difference. First operand 28873 states and 113518 transitions. Second operand has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:41:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:41:51,196 INFO L93 Difference]: Finished difference Result 42304 states and 165501 transitions. [2022-11-16 19:41:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-16 19:41:51,196 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 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 38 [2022-11-16 19:41:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:41:51,349 INFO L225 Difference]: With dead ends: 42304 [2022-11-16 19:41:51,350 INFO L226 Difference]: Without dead ends: 41414 [2022-11-16 19:41:51,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 2455 ImplicationChecksByTransitivity, 105.3s TimeCoverageRelationStatistics Valid=1554, Invalid=7536, Unknown=34, NotChecked=188, Total=9312 [2022-11-16 19:41:51,352 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1126 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 7809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4164 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:41:51,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1850 Invalid, 7809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 3466 Invalid, 0 Unknown, 4164 Unchecked, 11.4s Time] [2022-11-16 19:41:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41414 states. [2022-11-16 19:41:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41414 to 27654. [2022-11-16 19:41:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27654 states, 27651 states have (on average 3.9334562945282268) internal successors, (108764), 27653 states have internal predecessors, (108764), 0 states have call successors, (0), 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-16 19:41:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27654 states to 27654 states and 108764 transitions. [2022-11-16 19:41:52,570 INFO L78 Accepts]: Start accepts. Automaton has 27654 states and 108764 transitions. Word has length 38 [2022-11-16 19:41:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:41:52,572 INFO L495 AbstractCegarLoop]: Abstraction has 27654 states and 108764 transitions. [2022-11-16 19:41:52,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:41:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 27654 states and 108764 transitions. [2022-11-16 19:41:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 19:41:52,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:41:52,617 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:41:52,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 19:41:52,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 19:41:52,842 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:41:52,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:41:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash 721225786, now seen corresponding path program 6 times [2022-11-16 19:41:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:41:52,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677958865] [2022-11-16 19:41:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:41:52,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:41:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:41:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 19:41:55,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:41:55,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677958865] [2022-11-16 19:41:55,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677958865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:41:55,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900409318] [2022-11-16 19:41:55,415 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 19:41:55,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:41:55,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:41:55,417 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:41:55,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 19:41:56,242 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 19:41:56,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:41:56,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 158 conjunts are in the unsatisfiable core [2022-11-16 19:41:56,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:41:56,356 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:41:56,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:41:56,572 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:41:56,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:41:56,732 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:41:56,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:41:57,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:41:57,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:41:57,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 24 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 132 [2022-11-16 19:41:57,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 115 [2022-11-16 19:41:57,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:57,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 162 [2022-11-16 19:41:58,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 177 [2022-11-16 19:41:58,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:41:58,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 97 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 218 [2022-11-16 19:41:58,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 151 [2022-11-16 19:41:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 19:41:58,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:41:59,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0))))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_10265 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_10265) c_~B~0.base) (+ .cse1 3 c_~B~0.offset)) 0)) (forall ((v_ArrVal_10265 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_10265) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_10265 (Array Int Int))) (= 0 (select (select (store .cse0 c_~C~0.base v_ArrVal_10265) c_~B~0.base) (+ 2 .cse1 c_~B~0.offset)))) (forall ((v_ArrVal_10265 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_10265) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)))) is different from false [2022-11-16 19:42:00,963 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ 2 .cse1 c_~B~0.offset))) (let ((.cse0 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse3 (let ((.cse5 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse2 0) (+ .cse1 3 c_~B~0.offset) 0)))) (store .cse5 c_~A~0.base (store (store (store (store (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))))) (store .cse3 c_~B~0.base (store (store (store (store (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_10265 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_10265) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_10265 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_10265) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_10265 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_10265) c_~B~0.base) .cse2) 0)))))) is different from false [2022-11-16 19:42:24,321 INFO L321 Elim1Store]: treesize reduction 2023, result has 6.0 percent of original size [2022-11-16 19:42:24,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 1737 treesize of output 361 [2022-11-16 19:42:24,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:42:24,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1701 treesize of output 1673 [2022-11-16 19:42:24,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1558 treesize of output 1462 [2022-11-16 19:42:24,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:42:24,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:42:24,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:42:24,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1582 treesize of output 1534 [2022-11-16 19:42:25,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2022-11-16 19:42:25,597 INFO L321 Elim1Store]: treesize reduction 108, result has 72.7 percent of original size [2022-11-16 19:42:25,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 113 treesize of output 332 [2022-11-16 19:42:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 4 not checked. [2022-11-16 19:42:27,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900409318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:42:27,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1036361669] [2022-11-16 19:42:27,135 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-16 19:42:27,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:42:27,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 10] total 39 [2022-11-16 19:42:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635211120] [2022-11-16 19:42:27,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:42:27,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 19:42:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:42:27,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 19:42:27,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1179, Unknown=12, NotChecked=146, Total=1560 [2022-11-16 19:42:27,138 INFO L87 Difference]: Start difference. First operand 27654 states and 108764 transitions. Second operand has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 40 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 19:43:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:43:29,403 INFO L93 Difference]: Finished difference Result 67204 states and 266779 transitions. [2022-11-16 19:43:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 19:43:29,403 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 40 states have internal predecessors, (95), 0 states have call successors, (0), 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 40 [2022-11-16 19:43:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:43:29,684 INFO L225 Difference]: With dead ends: 67204 [2022-11-16 19:43:29,685 INFO L226 Difference]: Without dead ends: 66544 [2022-11-16 19:43:29,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 57 SyntacticMatches, 24 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 3299 ImplicationChecksByTransitivity, 75.5s TimeCoverageRelationStatistics Valid=1022, Invalid=5605, Unknown=23, NotChecked=322, Total=6972 [2022-11-16 19:43:29,687 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 1273 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2673 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-16 19:43:29,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 1218 Invalid, 5428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2658 Invalid, 0 Unknown, 2673 Unchecked, 9.0s Time] [2022-11-16 19:43:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66544 states. [2022-11-16 19:43:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66544 to 38380. [2022-11-16 19:43:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38380 states, 38377 states have (on average 4.036792870729864) internal successors, (154920), 38379 states have internal predecessors, (154920), 0 states have call successors, (0), 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-16 19:43:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38380 states to 38380 states and 154920 transitions. [2022-11-16 19:43:31,581 INFO L78 Accepts]: Start accepts. Automaton has 38380 states and 154920 transitions. Word has length 40 [2022-11-16 19:43:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:43:31,581 INFO L495 AbstractCegarLoop]: Abstraction has 38380 states and 154920 transitions. [2022-11-16 19:43:31,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 40 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 19:43:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 38380 states and 154920 transitions. [2022-11-16 19:43:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 19:43:31,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:43:31,620 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-16 19:43:31,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 19:43:31,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:43:31,820 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:43:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:43:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash 966758460, now seen corresponding path program 2 times [2022-11-16 19:43:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:43:31,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709113685] [2022-11-16 19:43:31,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:43:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:43:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:43:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:43:33,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:43:33,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709113685] [2022-11-16 19:43:33,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709113685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:43:33,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976493897] [2022-11-16 19:43:33,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 19:43:33,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:43:33,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:43:33,940 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:43:33,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 19:43:34,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 19:43:34,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:43:34,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 19:43:34,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:43:34,739 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:43:34,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:43:34,780 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:43:34,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:43:34,865 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:43:34,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:43:35,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:43:35,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:43:35,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:43:35,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-16 19:43:35,425 INFO L321 Elim1Store]: treesize reduction 527, result has 6.4 percent of original size [2022-11-16 19:43:35,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 101 [2022-11-16 19:43:35,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2022-11-16 19:43:43,625 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-16 19:43:43,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-16 19:43:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 19:43:43,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:43:45,131 INFO L321 Elim1Store]: treesize reduction 557, result has 13.9 percent of original size [2022-11-16 19:43:45,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 107 [2022-11-16 19:43:45,151 INFO L321 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2022-11-16 19:43:45,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 157 treesize of output 88 [2022-11-16 19:43:45,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-16 19:43:45,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2022-11-16 19:43:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 2 refuted. 1 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 19:43:45,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976493897] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:43:45,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [677343404] [2022-11-16 19:43:45,531 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-16 19:43:45,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:43:45,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2022-11-16 19:43:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246497139] [2022-11-16 19:43:45,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:43:45,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 19:43:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:43:45,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 19:43:45,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=521, Unknown=28, NotChecked=0, Total=650 [2022-11-16 19:43:45,533 INFO L87 Difference]: Start difference. First operand 38380 states and 154920 transitions. Second operand has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 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-16 19:44:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:44:19,652 INFO L93 Difference]: Finished difference Result 55012 states and 219988 transitions. [2022-11-16 19:44:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 19:44:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 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 40 [2022-11-16 19:44:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:44:20,154 INFO L225 Difference]: With dead ends: 55012 [2022-11-16 19:44:20,154 INFO L226 Difference]: Without dead ends: 54457 [2022-11-16 19:44:20,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=670, Invalid=1742, Unknown=38, NotChecked=0, Total=2450 [2022-11-16 19:44:20,156 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 888 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-16 19:44:20,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 371 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1449 Invalid, 0 Unknown, 358 Unchecked, 4.9s Time] [2022-11-16 19:44:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54457 states. [2022-11-16 19:44:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54457 to 36493. [2022-11-16 19:44:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36493 states, 36491 states have (on average 4.012222191773314) internal successors, (146410), 36492 states have internal predecessors, (146410), 0 states have call successors, (0), 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-16 19:44:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36493 states to 36493 states and 146410 transitions. [2022-11-16 19:44:21,818 INFO L78 Accepts]: Start accepts. Automaton has 36493 states and 146410 transitions. Word has length 40 [2022-11-16 19:44:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:44:21,818 INFO L495 AbstractCegarLoop]: Abstraction has 36493 states and 146410 transitions. [2022-11-16 19:44:21,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 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-16 19:44:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 36493 states and 146410 transitions. [2022-11-16 19:44:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 19:44:21,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:44:21,862 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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-16 19:44:21,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 19:44:22,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:44:22,066 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-16 19:44:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:44:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash 931230597, now seen corresponding path program 1 times [2022-11-16 19:44:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:44:22,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304353446] [2022-11-16 19:44:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:44:22,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:44:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:44:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 19:44:25,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:44:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304353446] [2022-11-16 19:44:25,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304353446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:44:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431509016] [2022-11-16 19:44:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:44:25,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:44:25,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:44:25,115 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:44:25,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372a1df3-b39e-4e75-bd34-8d85f1ff781e/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 19:44:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:44:25,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-16 19:44:25,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:44:26,079 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 19:44:26,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-16 19:44:26,220 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:44:26,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 19:44:26,381 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 19:44:26,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 19:44:27,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 19:44:27,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-16 19:44:27,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 127 [2022-11-16 19:44:27,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 90 [2022-11-16 19:44:27,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 77 [2022-11-16 19:44:27,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 101 [2022-11-16 19:44:27,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 171 [2022-11-16 19:44:27,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 134 [2022-11-16 19:44:27,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:27,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:28,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 55 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 151 [2022-11-16 19:44:32,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:44:32,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:44:32,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 146 treesize of output 175 [2022-11-16 19:44:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 19:44:34,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:44:34,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0)) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ .cse2 2 c_~B~0.offset) 0) (+ .cse2 3 c_~B~0.offset) 0))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_11407 (Array Int Int)) (v_ArrVal_11416 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_11416) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_11407) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_11407 (Array Int Int)) (v_ArrVal_11416 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_11416) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_11407) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_11407 (Array Int Int)) (v_ArrVal_11416 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_11416) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_11407) c_~B~0.base) (+ 2 .cse1 c_~B~0.offset)) 0)))) is different from false [2022-11-16 19:44:35,013 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ 2 .cse2 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0)))) (let ((.cse1 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base (store (store (store (store (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0)) c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))) (and (forall ((v_ArrVal_11407 (Array Int Int)) (v_ArrVal_11416 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_11416) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_11407) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_11407 (Array Int Int)) (v_ArrVal_11416 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_11416) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_11407) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_11407 (Array Int Int)) (v_ArrVal_11416 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_11416) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_11407) c_~B~0.base) .cse3) 0))))))) is different from false [2022-11-16 19:44:53,063 INFO L321 Elim1Store]: treesize reduction 585, result has 14.8 percent of original size [2022-11-16 19:44:53,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 956 treesize of output 501 [2022-11-16 19:44:53,220 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-16 19:44:53,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 476 treesize of output 441 [2022-11-16 19:44:53,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21829 treesize of output 21812 [2022-11-16 19:44:53,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:44:53,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:44:53,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:44:53,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22780 treesize of output 22684 [2022-11-16 19:44:53,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:44:53,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:44:53,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:44:53,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23836 treesize of output 23068 [2022-11-16 19:44:54,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18140 treesize of output 18128 [2022-11-16 19:44:54,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2022-11-16 19:44:58,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:44:58,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 164 [2022-11-16 19:44:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 4 not checked. [2022-11-16 19:44:59,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431509016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:44:59,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1703642999] [2022-11-16 19:44:59,366 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-16 19:44:59,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:44:59,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 10] total 37 [2022-11-16 19:44:59,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486419258] [2022-11-16 19:44:59,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:44:59,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 19:44:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:44:59,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 19:44:59,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1054, Unknown=4, NotChecked=138, Total=1406 [2022-11-16 19:44:59,370 INFO L87 Difference]: Start difference. First operand 36493 states and 146410 transitions. Second operand has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)