./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b5237d83 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_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba --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 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 --- 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-b5237d8 [2022-11-22 01:52:40,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:52:40,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:52:40,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:52:40,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:52:40,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:52:40,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:52:40,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:52:40,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:52:40,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:52:40,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:52:40,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:52:40,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:52:40,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:52:40,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:52:40,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:52:40,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:52:40,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:52:40,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:52:40,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:52:40,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:52:40,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:52:40,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:52:40,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:52:40,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:52:40,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:52:40,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:52:40,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:52:40,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:52:40,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:52:40,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:52:40,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:52:40,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:52:40,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:52:40,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:52:40,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:52:40,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:52:40,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:52:40,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:52:40,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:52:40,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:52:40,349 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-22 01:52:40,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:52:40,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:52:40,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:52:40,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:52:40,404 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:52:40,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:52:40,405 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:52:40,405 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:52:40,406 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:52:40,406 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:52:40,407 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:52:40,408 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:52:40,408 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:52:40,408 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:52:40,409 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:52:40,409 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:52:40,409 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:52:40,410 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:52:40,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:52:40,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:52:40,411 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:52:40,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:52:40,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:52:40,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:52:40,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:52:40,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:52:40,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:52:40,414 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-22 01:52:40,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:52:40,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:52:40,415 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:52:40,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:52:40,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:52:40,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:52:40,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:52:40,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:52:40,417 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:52:40,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:52:40,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:52:40,418 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:52:40,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:52:40,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:52:40,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:52:40,419 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_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/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_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba 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 -> 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 [2022-11-22 01:52:40,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:52:40,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:52:40,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:52:40,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:52:40,842 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:52:40,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-22 01:52:44,485 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:52:44,738 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:52:44,739 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-22 01:52:44,748 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/data/85579f8d1/0562540f92094da99413a3af7f5e3a36/FLAGcd137701e [2022-11-22 01:52:44,766 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/data/85579f8d1/0562540f92094da99413a3af7f5e3a36 [2022-11-22 01:52:44,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:52:44,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:52:44,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:52:44,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:52:44,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:52:44,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:52:44" (1/1) ... [2022-11-22 01:52:44,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a02546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:44, skipping insertion in model container [2022-11-22 01:52:44,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:52:44" (1/1) ... [2022-11-22 01:52:44,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:52:44,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:52:45,067 WARN L237 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_fa4b263a-4309-4f2a-8241-03b6524896fe/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-22 01:52:45,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:52:45,086 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:52:45,127 WARN L237 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_fa4b263a-4309-4f2a-8241-03b6524896fe/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-22 01:52:45,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:52:45,152 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:52:45,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45 WrapperNode [2022-11-22 01:52:45,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:52:45,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:52:45,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:52:45,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:52:45,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,232 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 341 [2022-11-22 01:52:45,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:52:45,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:52:45,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:52:45,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:52:45,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,351 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:52:45,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:52:45,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:52:45,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:52:45,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (1/1) ... [2022-11-22 01:52:45,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:52:45,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:52:45,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:52:45,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:52:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:52:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 01:52:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:52:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:52:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:52:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 01:52:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-22 01:52:45,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-22 01:52:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-22 01:52:45,503 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-22 01:52:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:52:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 01:52:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:52:45,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:52:45,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:52:45,506 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:52:45,719 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:52:45,731 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:52:46,793 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:52:46,811 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:52:46,811 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-22 01:52:46,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:52:46 BoogieIcfgContainer [2022-11-22 01:52:46,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:52:46,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:52:46,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:52:46,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:52:46,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:52:44" (1/3) ... [2022-11-22 01:52:46,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dede992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:52:46, skipping insertion in model container [2022-11-22 01:52:46,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:45" (2/3) ... [2022-11-22 01:52:46,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dede992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:52:46, skipping insertion in model container [2022-11-22 01:52:46,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:52:46" (3/3) ... [2022-11-22 01:52:46,831 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2022-11-22 01:52:46,848 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 01:52:46,861 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:52:46,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-11-22 01:52:46,862 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:52:47,031 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-22 01:52:47,103 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:52:47,131 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 516 places, 539 transitions, 1094 flow [2022-11-22 01:52:47,135 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 516 places, 539 transitions, 1094 flow [2022-11-22 01:52:47,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 516 places, 539 transitions, 1094 flow [2022-11-22 01:52:47,361 INFO L130 PetriNetUnfolder]: 30/537 cut-off events. [2022-11-22 01:52:47,362 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-22 01:52:47,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 537 events. 30/537 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 813 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 343. Up to 2 conditions per place. [2022-11-22 01:52:47,379 INFO L119 LiptonReduction]: Number of co-enabled transitions 6986 [2022-11-22 01:53:27,538 WARN L233 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 151 DAG size of output: 147 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:53:37,022 INFO L134 LiptonReduction]: Checked pairs total: 48935 [2022-11-22 01:53:37,022 INFO L136 LiptonReduction]: Total number of compositions: 662 [2022-11-22 01:53:37,031 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 123 places, 123 transitions, 262 flow [2022-11-22 01:53:37,270 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4961 states, 4803 states have (on average 2.936706225275869) internal successors, (14105), 4960 states have internal predecessors, (14105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:37,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:53:37,302 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;@2780d4a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:53:37,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-22 01:53:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 4961 states, 4803 states have (on average 2.936706225275869) internal successors, (14105), 4960 states have internal predecessors, (14105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 01:53:37,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:37,334 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 01:53:37,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:37,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:37,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1971, now seen corresponding path program 1 times [2022-11-22 01:53:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:37,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397454470] [2022-11-22 01:53:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:37,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:37,485 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-22 01:53:37,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:37,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397454470] [2022-11-22 01:53:37,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397454470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:37,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:37,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 01:53:37,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117729723] [2022-11-22 01:53:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:37,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 01:53:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:37,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 01:53:37,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:53:37,547 INFO L87 Difference]: Start difference. First operand has 4961 states, 4803 states have (on average 2.936706225275869) internal successors, (14105), 4960 states have internal predecessors, (14105), 0 states have call successors, (0), 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-22 01:53:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:37,772 INFO L93 Difference]: Finished difference Result 3497 states and 9991 transitions. [2022-11-22 01:53:37,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 01:53:37,776 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-22 01:53:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:37,820 INFO L225 Difference]: With dead ends: 3497 [2022-11-22 01:53:37,821 INFO L226 Difference]: Without dead ends: 3495 [2022-11-22 01:53:37,822 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-22 01:53:37,826 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:37,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:53:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2022-11-22 01:53:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2022-11-22 01:53:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 3468 states have (on average 2.8800461361014995) internal successors, (9988), 3494 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 9988 transitions. [2022-11-22 01:53:38,127 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 9988 transitions. Word has length 1 [2022-11-22 01:53:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:38,128 INFO L495 AbstractCegarLoop]: Abstraction has 3495 states and 9988 transitions. [2022-11-22 01:53:38,129 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-22 01:53:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 9988 transitions. [2022-11-22 01:53:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:53:38,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:38,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:38,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:53:38,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:38,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1855252122, now seen corresponding path program 1 times [2022-11-22 01:53:38,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:38,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021941064] [2022-11-22 01:53:38,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:38,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:38,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:38,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201024877] [2022-11-22 01:53:38,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:38,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:38,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:38,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:38,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:53:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:38,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:53:38,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:38,540 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-22 01:53:38,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:53:38,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:38,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021941064] [2022-11-22 01:53:38,541 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:53:38,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201024877] [2022-11-22 01:53:38,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201024877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:38,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:38,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:53:38,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433818986] [2022-11-22 01:53:38,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:38,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:53:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:38,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:53:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:53:38,548 INFO L87 Difference]: Start difference. First operand 3495 states and 9988 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-22 01:53:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:38,929 INFO L93 Difference]: Finished difference Result 5051 states and 13782 transitions. [2022-11-22 01:53:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:53:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-22 01:53:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:38,964 INFO L225 Difference]: With dead ends: 5051 [2022-11-22 01:53:38,964 INFO L226 Difference]: Without dead ends: 5051 [2022-11-22 01:53:38,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:38,966 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 231 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:38,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 192 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:53:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2022-11-22 01:53:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 3889. [2022-11-22 01:53:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3889 states, 3862 states have (on average 2.881149663386846) internal successors, (11127), 3888 states have internal predecessors, (11127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 11127 transitions. [2022-11-22 01:53:39,208 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 11127 transitions. Word has length 13 [2022-11-22 01:53:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:39,209 INFO L495 AbstractCegarLoop]: Abstraction has 3889 states and 11127 transitions. [2022-11-22 01:53:39,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-22 01:53:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 11127 transitions. [2022-11-22 01:53:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:53:39,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:39,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:39,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:53:39,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:39,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1689690295, now seen corresponding path program 1 times [2022-11-22 01:53:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:39,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135100264] [2022-11-22 01:53:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:39,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:39,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628039721] [2022-11-22 01:53:39,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:39,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:39,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:39,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:39,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:53:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:39,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-22 01:53:39,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:39,663 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:53:39,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:39,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:53:39,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:39,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:39,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:39,744 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:53:39,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:39,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:39,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:39,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:39,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:53:39,844 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-22 01:53:39,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:53:39,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:39,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135100264] [2022-11-22 01:53:39,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:53:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628039721] [2022-11-22 01:53:39,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628039721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:39,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:39,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:53:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150199529] [2022-11-22 01:53:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:39,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:53:39,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:53:39,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:39,848 INFO L87 Difference]: Start difference. First operand 3889 states and 11127 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-22 01:53:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:40,824 INFO L93 Difference]: Finished difference Result 6342 states and 17945 transitions. [2022-11-22 01:53:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:53:40,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-22 01:53:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:40,863 INFO L225 Difference]: With dead ends: 6342 [2022-11-22 01:53:40,863 INFO L226 Difference]: Without dead ends: 6342 [2022-11-22 01:53:40,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:40,865 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 160 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:40,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 69 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 01:53:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6342 states. [2022-11-22 01:53:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6342 to 5698. [2022-11-22 01:53:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5671 states have (on average 2.9324634103332747) internal successors, (16630), 5697 states have internal predecessors, (16630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 16630 transitions. [2022-11-22 01:53:41,104 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 16630 transitions. Word has length 13 [2022-11-22 01:53:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:41,164 INFO L495 AbstractCegarLoop]: Abstraction has 5698 states and 16630 transitions. [2022-11-22 01:53:41,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-22 01:53:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 16630 transitions. [2022-11-22 01:53:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:53:41,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:41,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:41,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:53:41,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:41,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash -762446149, now seen corresponding path program 1 times [2022-11-22 01:53:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:41,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570630069] [2022-11-22 01:53:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:41,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:41,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159722005] [2022-11-22 01:53:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:41,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:41,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:41,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:41,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:53:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:41,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 01:53:41,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:41,860 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:53:41,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-22 01:53:41,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:41,960 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:53:42,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:42,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:53:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:53:42,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:53:42,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:42,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570630069] [2022-11-22 01:53:42,140 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:53:42,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159722005] [2022-11-22 01:53:42,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159722005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:42,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:42,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 01:53:42,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866805170] [2022-11-22 01:53:42,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:42,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:53:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:42,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:53:42,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:53:42,144 INFO L87 Difference]: Start difference. First operand 5698 states and 16630 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-22 01:53:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:44,433 INFO L93 Difference]: Finished difference Result 24236 states and 70847 transitions. [2022-11-22 01:53:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:53:44,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-22 01:53:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:44,591 INFO L225 Difference]: With dead ends: 24236 [2022-11-22 01:53:44,591 INFO L226 Difference]: Without dead ends: 24236 [2022-11-22 01:53:44,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-11-22 01:53:44,595 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 705 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:44,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 133 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-22 01:53:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24236 states. [2022-11-22 01:53:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24236 to 7693. [2022-11-22 01:53:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7693 states, 7666 states have (on average 2.9744325593529872) internal successors, (22802), 7692 states have internal predecessors, (22802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7693 states to 7693 states and 22802 transitions. [2022-11-22 01:53:45,589 INFO L78 Accepts]: Start accepts. Automaton has 7693 states and 22802 transitions. Word has length 15 [2022-11-22 01:53:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:45,589 INFO L495 AbstractCegarLoop]: Abstraction has 7693 states and 22802 transitions. [2022-11-22 01:53:45,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-22 01:53:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 7693 states and 22802 transitions. [2022-11-22 01:53:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:53:45,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:45,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:45,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:53:45,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-22 01:53:45,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1230086114, now seen corresponding path program 1 times [2022-11-22 01:53:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:45,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016388484] [2022-11-22 01:53:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:45,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488477429] [2022-11-22 01:53:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:45,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:45,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:45,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:53:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:46,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:53:46,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:46,090 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-22 01:53:46,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:53:46,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:46,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016388484] [2022-11-22 01:53:46,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:53:46,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488477429] [2022-11-22 01:53:46,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488477429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:46,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:46,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:53:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271137381] [2022-11-22 01:53:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:46,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:53:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:46,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:53:46,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:53:46,095 INFO L87 Difference]: Start difference. First operand 7693 states and 22802 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-22 01:53:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:46,519 INFO L93 Difference]: Finished difference Result 8560 states and 24995 transitions. [2022-11-22 01:53:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:53:46,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-22 01:53:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:46,571 INFO L225 Difference]: With dead ends: 8560 [2022-11-22 01:53:46,571 INFO L226 Difference]: Without dead ends: 8558 [2022-11-22 01:53:46,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:46,573 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 106 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:46,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 176 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:53:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2022-11-22 01:53:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8287. [2022-11-22 01:53:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8287 states, 8260 states have (on average 2.96319612590799) internal successors, (24476), 8286 states have internal predecessors, (24476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 24476 transitions. [2022-11-22 01:53:46,922 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 24476 transitions. Word has length 15 [2022-11-22 01:53:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:46,923 INFO L495 AbstractCegarLoop]: Abstraction has 8287 states and 24476 transitions. [2022-11-22 01:53:46,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-22 01:53:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 24476 transitions. [2022-11-22 01:53:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:53:46,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:46,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:46,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:53:47,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:47,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:47,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1494825734, now seen corresponding path program 1 times [2022-11-22 01:53:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:47,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622169874] [2022-11-22 01:53:47,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:47,198 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:47,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964670940] [2022-11-22 01:53:47,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:47,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:47,200 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:47,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:53:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:47,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:53:47,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:53:47,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:53:47,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:47,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622169874] [2022-11-22 01:53:47,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:53:47,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964670940] [2022-11-22 01:53:47,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964670940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:47,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:47,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:53:47,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486208113] [2022-11-22 01:53:47,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:47,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:53:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:53:47,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:53:47,411 INFO L87 Difference]: Start difference. First operand 8287 states and 24476 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:47,832 INFO L93 Difference]: Finished difference Result 11641 states and 34100 transitions. [2022-11-22 01:53:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:53:47,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 01:53:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:47,879 INFO L225 Difference]: With dead ends: 11641 [2022-11-22 01:53:47,879 INFO L226 Difference]: Without dead ends: 11633 [2022-11-22 01:53:47,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:47,880 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 184 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:47,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 233 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:53:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11633 states. [2022-11-22 01:53:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11633 to 9154. [2022-11-22 01:53:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9154 states, 9127 states have (on average 2.9810452503560865) internal successors, (27208), 9153 states have internal predecessors, (27208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 27208 transitions. [2022-11-22 01:53:48,296 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 27208 transitions. Word has length 17 [2022-11-22 01:53:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:48,297 INFO L495 AbstractCegarLoop]: Abstraction has 9154 states and 27208 transitions. [2022-11-22 01:53:48,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 27208 transitions. [2022-11-22 01:53:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:53:48,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:48,301 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-22 01:53:48,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:53:48,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:48,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:48,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:48,509 INFO L85 PathProgramCache]: Analyzing trace with hash 99014628, now seen corresponding path program 1 times [2022-11-22 01:53:48,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:48,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018962933] [2022-11-22 01:53:48,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:48,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:48,538 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:48,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595831512] [2022-11-22 01:53:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:48,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:48,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:48,541 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:48,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:53:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:48,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-22 01:53:48,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:48,834 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:53:48,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-22 01:53:48,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:48,924 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:53:48,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:48,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:53:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:53:49,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:53:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:53:49,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:49,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018962933] [2022-11-22 01:53:49,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:53:49,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595831512] [2022-11-22 01:53:49,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595831512] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:53:49,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:53:49,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2022-11-22 01:53:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364383876] [2022-11-22 01:53:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:49,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:53:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:49,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:53:49,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:53:49,169 INFO L87 Difference]: Start difference. First operand 9154 states and 27208 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-22 01:53:51,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-22 01:53:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:51,981 INFO L93 Difference]: Finished difference Result 11634 states and 34334 transitions. [2022-11-22 01:53:51,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:53:51,981 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-22 01:53:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:52,028 INFO L225 Difference]: With dead ends: 11634 [2022-11-22 01:53:52,028 INFO L226 Difference]: Without dead ends: 11634 [2022-11-22 01:53:52,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:53:52,030 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 74 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:52,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 371 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-11-22 01:53:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2022-11-22 01:53:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 9834. [2022-11-22 01:53:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9834 states, 9807 states have (on average 2.972366676863465) internal successors, (29150), 9833 states have internal predecessors, (29150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9834 states to 9834 states and 29150 transitions. [2022-11-22 01:53:52,318 INFO L78 Accepts]: Start accepts. Automaton has 9834 states and 29150 transitions. Word has length 18 [2022-11-22 01:53:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:52,319 INFO L495 AbstractCegarLoop]: Abstraction has 9834 states and 29150 transitions. [2022-11-22 01:53:52,319 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-22 01:53:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 9834 states and 29150 transitions. [2022-11-22 01:53:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:53:52,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:52,328 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-22 01:53:52,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:53:52,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:52,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1091291607, now seen corresponding path program 1 times [2022-11-22 01:53:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:52,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321732341] [2022-11-22 01:53:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:52,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:52,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:52,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568007581] [2022-11-22 01:53:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:52,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:52,658 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:52,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:53:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:52,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-22 01:53:52,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:52,948 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:53:52,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-22 01:53:53,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:53,011 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:53:53,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:53,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:53:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:53:53,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:53:53,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:53,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321732341] [2022-11-22 01:53:53,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:53:53,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568007581] [2022-11-22 01:53:53,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568007581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:53,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:53,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 01:53:53,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194833992] [2022-11-22 01:53:53,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:53,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:53:53,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:53:53,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:53:53,095 INFO L87 Difference]: Start difference. First operand 9834 states and 29150 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-22 01:53:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:54,439 INFO L93 Difference]: Finished difference Result 15553 states and 45131 transitions. [2022-11-22 01:53:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:53:54,440 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 21 [2022-11-22 01:53:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:54,500 INFO L225 Difference]: With dead ends: 15553 [2022-11-22 01:53:54,501 INFO L226 Difference]: Without dead ends: 15553 [2022-11-22 01:53:54,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2022-11-22 01:53:54,502 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 572 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:54,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 159 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 01:53:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15553 states. [2022-11-22 01:53:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15553 to 12466. [2022-11-22 01:53:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12466 states, 12439 states have (on average 2.9876999758823057) internal successors, (37164), 12465 states have internal predecessors, (37164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37164 transitions. [2022-11-22 01:53:55,009 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37164 transitions. Word has length 21 [2022-11-22 01:53:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:55,009 INFO L495 AbstractCegarLoop]: Abstraction has 12466 states and 37164 transitions. [2022-11-22 01:53:55,010 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-22 01:53:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37164 transitions. [2022-11-22 01:53:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:53:55,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:55,014 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] [2022-11-22 01:53:55,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 01:53:55,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-22 01:53:55,221 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:55,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash -688650743, now seen corresponding path program 1 times [2022-11-22 01:53:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:55,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245384379] [2022-11-22 01:53:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:55,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:55,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848776201] [2022-11-22 01:53:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:55,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:55,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:55,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:55,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 01:53:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:55,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-22 01:53:55,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:55,485 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:53:55,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:55,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:53:55,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:55,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:55,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:55,544 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:53:55,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:55,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:55,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:55,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:55,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:53:55,628 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-22 01:53:55,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:53:55,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:55,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245384379] [2022-11-22 01:53:55,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:53:55,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848776201] [2022-11-22 01:53:55,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848776201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:55,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:55,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:53:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479632] [2022-11-22 01:53:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:55,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:53:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:53:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:55,637 INFO L87 Difference]: Start difference. First operand 12466 states and 37164 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) 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-22 01:53:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:56,431 INFO L93 Difference]: Finished difference Result 12564 states and 37342 transitions. [2022-11-22 01:53:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:53:56,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) 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 22 [2022-11-22 01:53:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:56,491 INFO L225 Difference]: With dead ends: 12564 [2022-11-22 01:53:56,491 INFO L226 Difference]: Without dead ends: 12386 [2022-11-22 01:53:56,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:56,492 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:56,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 63 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:53:56,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2022-11-22 01:53:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12365. [2022-11-22 01:53:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12365 states, 12339 states have (on average 2.9803873895777615) internal successors, (36775), 12364 states have internal predecessors, (36775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12365 states to 12365 states and 36775 transitions. [2022-11-22 01:53:56,990 INFO L78 Accepts]: Start accepts. Automaton has 12365 states and 36775 transitions. Word has length 22 [2022-11-22 01:53:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:56,991 INFO L495 AbstractCegarLoop]: Abstraction has 12365 states and 36775 transitions. [2022-11-22 01:53:56,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) 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-22 01:53:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 12365 states and 36775 transitions. [2022-11-22 01:53:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:53:56,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:56,997 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] [2022-11-22 01:53:57,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 01:53:57,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-22 01:53:57,204 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash 477787027, now seen corresponding path program 1 times [2022-11-22 01:53:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:57,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942066886] [2022-11-22 01:53:57,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:57,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:57,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245433703] [2022-11-22 01:53:57,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:57,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:57,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:57,233 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:57,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 01:53:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:57,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-22 01:53:57,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:57,466 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-22 01:53:57,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 01:53:57,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:57,517 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 1 case distinctions, treesize of input 55 treesize of output 57 [2022-11-22 01:53:57,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:53:57,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 77 [2022-11-22 01:53:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:53:57,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:53:57,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:57,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942066886] [2022-11-22 01:53:57,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:53:57,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245433703] [2022-11-22 01:53:57,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245433703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:57,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:57,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:53:57,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785937857] [2022-11-22 01:53:57,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:57,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:53:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:57,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:53:57,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:57,623 INFO L87 Difference]: Start difference. First operand 12365 states and 36775 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:58,394 INFO L93 Difference]: Finished difference Result 13426 states and 39809 transitions. [2022-11-22 01:53:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:53:58,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 01:53:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:58,456 INFO L225 Difference]: With dead ends: 13426 [2022-11-22 01:53:58,456 INFO L226 Difference]: Without dead ends: 13426 [2022-11-22 01:53:58,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-22 01:53:58,458 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 68 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:58,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 56 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:53:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13426 states. [2022-11-22 01:53:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13426 to 12964. [2022-11-22 01:53:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12964 states, 12939 states have (on average 2.973722853388979) internal successors, (38477), 12963 states have internal predecessors, (38477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12964 states to 12964 states and 38477 transitions. [2022-11-22 01:53:58,959 INFO L78 Accepts]: Start accepts. Automaton has 12964 states and 38477 transitions. Word has length 24 [2022-11-22 01:53:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:58,961 INFO L495 AbstractCegarLoop]: Abstraction has 12964 states and 38477 transitions. [2022-11-22 01:53:58,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 12964 states and 38477 transitions. [2022-11-22 01:53:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:53:58,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:58,967 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] [2022-11-22 01:53:58,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 01:53:59,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:59,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:53:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash -62933662, now seen corresponding path program 1 times [2022-11-22 01:53:59,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:59,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576872043] [2022-11-22 01:53:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:59,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:59,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:53:59,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330371509] [2022-11-22 01:53:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:59,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:53:59,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:59,215 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:53:59,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 01:53:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:59,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-22 01:53:59,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:53:59,716 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:53:59,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-22 01:53:59,818 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 40 treesize of output 42 [2022-11-22 01:53:59,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:53:59,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:53:59,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-11-22 01:54:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:54:00,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:54:00,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:00,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576872043] [2022-11-22 01:54:00,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:00,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330371509] [2022-11-22 01:54:00,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330371509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:00,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:00,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 01:54:00,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577320496] [2022-11-22 01:54:00,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:00,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:54:00,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:00,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:54:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:54:00,030 INFO L87 Difference]: Start difference. First operand 12964 states and 38477 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:01,928 INFO L93 Difference]: Finished difference Result 17019 states and 49378 transitions. [2022-11-22 01:54:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:54:01,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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-22 01:54:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:01,985 INFO L225 Difference]: With dead ends: 17019 [2022-11-22 01:54:01,985 INFO L226 Difference]: Without dead ends: 17019 [2022-11-22 01:54:01,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-11-22 01:54:01,986 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 369 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:01,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 184 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-22 01:54:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2022-11-22 01:54:02,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 13428. [2022-11-22 01:54:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13428 states, 13403 states have (on average 2.9770200701335523) internal successors, (39901), 13427 states have internal predecessors, (39901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13428 states to 13428 states and 39901 transitions. [2022-11-22 01:54:02,623 INFO L78 Accepts]: Start accepts. Automaton has 13428 states and 39901 transitions. Word has length 25 [2022-11-22 01:54:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:02,624 INFO L495 AbstractCegarLoop]: Abstraction has 13428 states and 39901 transitions. [2022-11-22 01:54:02,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 13428 states and 39901 transitions. [2022-11-22 01:54:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:54:02,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:02,629 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] [2022-11-22 01:54:02,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 01:54:02,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:02,836 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 183808725, now seen corresponding path program 1 times [2022-11-22 01:54:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:02,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553098678] [2022-11-22 01:54:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:02,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:02,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:02,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669641516] [2022-11-22 01:54:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:02,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:02,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:02,861 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:02,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 01:54:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:03,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-22 01:54:03,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:03,253 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:54:03,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:03,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:54:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:03,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:03,323 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 30 treesize of output 32 [2022-11-22 01:54:03,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:03,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:03,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:03,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:54:03,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:03,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:54:03,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:54:03,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:03,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553098678] [2022-11-22 01:54:03,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:03,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669641516] [2022-11-22 01:54:03,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669641516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:03,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:03,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 01:54:03,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987009160] [2022-11-22 01:54:03,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:03,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:54:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:54:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:54:03,470 INFO L87 Difference]: Start difference. First operand 13428 states and 39901 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:04,572 INFO L93 Difference]: Finished difference Result 16791 states and 49002 transitions. [2022-11-22 01:54:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:54:04,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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-22 01:54:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:04,617 INFO L225 Difference]: With dead ends: 16791 [2022-11-22 01:54:04,618 INFO L226 Difference]: Without dead ends: 16767 [2022-11-22 01:54:04,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:54:04,618 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 176 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:04,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 98 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 01:54:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16767 states. [2022-11-22 01:54:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16767 to 12828. [2022-11-22 01:54:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12828 states, 12803 states have (on average 2.9685230024213074) internal successors, (38006), 12827 states have internal predecessors, (38006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12828 states to 12828 states and 38006 transitions. [2022-11-22 01:54:05,170 INFO L78 Accepts]: Start accepts. Automaton has 12828 states and 38006 transitions. Word has length 25 [2022-11-22 01:54:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:05,170 INFO L495 AbstractCegarLoop]: Abstraction has 12828 states and 38006 transitions. [2022-11-22 01:54:05,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 12828 states and 38006 transitions. [2022-11-22 01:54:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-22 01:54:05,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:05,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:05,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 01:54:05,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 01:54:05,384 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:05,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1924236333, now seen corresponding path program 1 times [2022-11-22 01:54:05,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:05,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483835702] [2022-11-22 01:54:05,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:05,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:05,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:05,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416326167] [2022-11-22 01:54:05,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:05,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:05,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:05,413 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:05,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 01:54:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:05,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 01:54:05,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:54:05,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:54:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:54:05,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:05,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483835702] [2022-11-22 01:54:05,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:05,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416326167] [2022-11-22 01:54:05,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416326167] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:54:05,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [786830338] [2022-11-22 01:54:05,939 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-22 01:54:05,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:54:05,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-22 01:54:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585665329] [2022-11-22 01:54:05,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:54:05,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:54:05,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:05,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:54:05,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:54:05,949 INFO L87 Difference]: Start difference. First operand 12828 states and 38006 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 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-22 01:54:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:06,955 INFO L93 Difference]: Finished difference Result 22207 states and 64542 transitions. [2022-11-22 01:54:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 01:54:06,955 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 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 28 [2022-11-22 01:54:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:07,013 INFO L225 Difference]: With dead ends: 22207 [2022-11-22 01:54:07,013 INFO L226 Difference]: Without dead ends: 21167 [2022-11-22 01:54:07,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:54:07,014 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 375 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:07,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 580 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 01:54:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21167 states. [2022-11-22 01:54:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21167 to 19081. [2022-11-22 01:54:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19081 states, 19056 states have (on average 3.008028967254408) internal successors, (57321), 19080 states have internal predecessors, (57321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19081 states to 19081 states and 57321 transitions. [2022-11-22 01:54:07,653 INFO L78 Accepts]: Start accepts. Automaton has 19081 states and 57321 transitions. Word has length 28 [2022-11-22 01:54:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:07,653 INFO L495 AbstractCegarLoop]: Abstraction has 19081 states and 57321 transitions. [2022-11-22 01:54:07,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 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-22 01:54:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 19081 states and 57321 transitions. [2022-11-22 01:54:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 01:54:07,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:07,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:07,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 01:54:07,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 01:54:07,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:07,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash 377215540, now seen corresponding path program 2 times [2022-11-22 01:54:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:07,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801628129] [2022-11-22 01:54:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:07,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:07,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396431987] [2022-11-22 01:54:07,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:54:07,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:07,907 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:07,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 01:54:08,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 01:54:08,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:54:08,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-22 01:54:08,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:08,167 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:54:08,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-22 01:54:08,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:08,206 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:54:08,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:08,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:54:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 01:54:08,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:54:08,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:08,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801628129] [2022-11-22 01:54:08,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:08,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396431987] [2022-11-22 01:54:08,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396431987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:08,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:08,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:54:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747100749] [2022-11-22 01:54:08,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:08,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:54:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:08,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:54:08,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:54:08,278 INFO L87 Difference]: Start difference. First operand 19081 states and 57321 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:09,482 INFO L93 Difference]: Finished difference Result 21419 states and 64260 transitions. [2022-11-22 01:54:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:54:09,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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-22 01:54:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:09,543 INFO L225 Difference]: With dead ends: 21419 [2022-11-22 01:54:09,543 INFO L226 Difference]: Without dead ends: 21419 [2022-11-22 01:54:09,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:54:09,544 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 74 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:09,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-22 01:54:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21419 states. [2022-11-22 01:54:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21419 to 19921. [2022-11-22 01:54:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19921 states, 19900 states have (on average 3.006030150753769) internal successors, (59820), 19920 states have internal predecessors, (59820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19921 states to 19921 states and 59820 transitions. [2022-11-22 01:54:10,132 INFO L78 Accepts]: Start accepts. Automaton has 19921 states and 59820 transitions. Word has length 30 [2022-11-22 01:54:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:10,132 INFO L495 AbstractCegarLoop]: Abstraction has 19921 states and 59820 transitions. [2022-11-22 01:54:10,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 19921 states and 59820 transitions. [2022-11-22 01:54:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 01:54:10,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:10,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:10,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-22 01:54:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 01:54:10,353 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1176781416, now seen corresponding path program 1 times [2022-11-22 01:54:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636500868] [2022-11-22 01:54:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:10,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:10,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807585403] [2022-11-22 01:54:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:10,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:10,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:10,378 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:10,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 01:54:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:10,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-22 01:54:10,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:10,734 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-22 01:54:10,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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-22 01:54:10,794 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 01:54:10,795 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-22 01:54:10,847 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 01:54:10,848 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 11 treesize of output 11 [2022-11-22 01:54:10,996 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:54:11,035 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-22 01:54:11,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:54:11,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:54:11,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-11-22 01:54:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 01:54:11,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:54:11,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:11,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636500868] [2022-11-22 01:54:11,248 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:11,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807585403] [2022-11-22 01:54:11,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807585403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:11,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:11,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 01:54:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640793353] [2022-11-22 01:54:11,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:11,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:54:11,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:11,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:54:11,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:54:11,252 INFO L87 Difference]: Start difference. First operand 19921 states and 59820 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:12,761 INFO L93 Difference]: Finished difference Result 25553 states and 75637 transitions. [2022-11-22 01:54:12,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:54:12,762 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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-22 01:54:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:12,853 INFO L225 Difference]: With dead ends: 25553 [2022-11-22 01:54:12,853 INFO L226 Difference]: Without dead ends: 25553 [2022-11-22 01:54:12,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-11-22 01:54:12,855 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 409 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:12,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 92 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 01:54:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25553 states. [2022-11-22 01:54:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25553 to 21269. [2022-11-22 01:54:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21269 states, 21248 states have (on average 3.0103539156626504) internal successors, (63964), 21268 states have internal predecessors, (63964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 63964 transitions. [2022-11-22 01:54:13,682 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 63964 transitions. Word has length 30 [2022-11-22 01:54:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:13,682 INFO L495 AbstractCegarLoop]: Abstraction has 21269 states and 63964 transitions. [2022-11-22 01:54:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 63964 transitions. [2022-11-22 01:54:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 01:54:13,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:13,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:13,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-22 01:54:13,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 01:54:13,898 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash 832271772, now seen corresponding path program 1 times [2022-11-22 01:54:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:13,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053573633] [2022-11-22 01:54:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:13,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:13,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757027743] [2022-11-22 01:54:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:13,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:13,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:13,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:13,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 01:54:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:14,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-22 01:54:14,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:14,312 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-22 01:54:14,313 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-22 01:54:14,362 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 01:54:14,362 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-22 01:54:14,397 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 01:54:14,397 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 11 treesize of output 11 [2022-11-22 01:54:14,563 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:54:14,605 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-22 01:54:14,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:54:14,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:54:14,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-11-22 01:54:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:54:14,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:54:15,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse3 (+ .cse2 2 c_~B~0.offset)) (.cse1 (+ .cse2 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse3) 0)))))) is different from false [2022-11-22 01:54:15,135 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse4 (+ .cse1 c_~B~0.offset 1)) (.cse2 (+ .cse1 2 c_~B~0.offset)) (.cse3 (+ .cse1 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse4 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= 0 (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse3))) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse4) 0)))))) is different from false [2022-11-22 01:54:15,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:15,157 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 4 case distinctions, treesize of input 51 treesize of output 67 [2022-11-22 01:54:15,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:15,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2022-11-22 01:54:15,170 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-22 01:54:15,177 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-22 01:54:15,178 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 4 case distinctions, treesize of input 50 treesize of output 1 [2022-11-22 01:54:15,185 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-22 01:54:15,186 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 4 case distinctions, treesize of input 51 treesize of output 1 [2022-11-22 01:54:15,194 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-22 01:54:15,194 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 4 case distinctions, treesize of input 51 treesize of output 1 [2022-11-22 01:54:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:54:15,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:15,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053573633] [2022-11-22 01:54:15,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:15,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757027743] [2022-11-22 01:54:15,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757027743] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:54:15,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:54:15,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2022-11-22 01:54:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993242109] [2022-11-22 01:54:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:15,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:54:15,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:15,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:54:15,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=259, Unknown=9, NotChecked=70, Total=420 [2022-11-22 01:54:15,513 INFO L87 Difference]: Start difference. First operand 21269 states and 63964 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:16,901 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~N~0 1)) (.cse0 (* c_thread2Thread1of1ForFork1_~i~1 4))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 3 c_~B~0.offset)) 0)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_243| Int) (v_ArrVal_1911 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_243|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_243| v_ArrVal_1911) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)))) .cse1) (or .cse1 (not (= (select |c_#valid| c_~A~0.base) 0))) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 c_~B~0.offset 1)) 0)))) is different from false [2022-11-22 01:54:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:19,180 INFO L93 Difference]: Finished difference Result 27149 states and 81030 transitions. [2022-11-22 01:54:19,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 01:54:19,181 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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-22 01:54:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:19,271 INFO L225 Difference]: With dead ends: 27149 [2022-11-22 01:54:19,271 INFO L226 Difference]: Without dead ends: 27149 [2022-11-22 01:54:19,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=131, Invalid=464, Unknown=17, NotChecked=144, Total=756 [2022-11-22 01:54:19,273 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 281 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 9 mSolverCounterUnsat, 83 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 83 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:19,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 149 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 608 Invalid, 83 Unknown, 391 Unchecked, 2.7s Time] [2022-11-22 01:54:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27149 states. [2022-11-22 01:54:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27149 to 22326. [2022-11-22 01:54:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22326 states, 22305 states have (on average 3.0286482851378613) internal successors, (67554), 22325 states have internal predecessors, (67554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22326 states to 22326 states and 67554 transitions. [2022-11-22 01:54:19,975 INFO L78 Accepts]: Start accepts. Automaton has 22326 states and 67554 transitions. Word has length 30 [2022-11-22 01:54:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:19,976 INFO L495 AbstractCegarLoop]: Abstraction has 22326 states and 67554 transitions. [2022-11-22 01:54:19,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 22326 states and 67554 transitions. [2022-11-22 01:54:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 01:54:19,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:19,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:19,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-22 01:54:20,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 01:54:20,182 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash 832483812, now seen corresponding path program 2 times [2022-11-22 01:54:20,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:20,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265127655] [2022-11-22 01:54:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:20,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:20,210 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:20,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070021098] [2022-11-22 01:54:20,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:54:20,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:20,212 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:20,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 01:54:20,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 01:54:20,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:54:20,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-22 01:54:20,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:20,581 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-22 01:54:20,581 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-22 01:54:20,628 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 01:54:20,629 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-22 01:54:20,659 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 01:54:20,660 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 11 treesize of output 11 [2022-11-22 01:54:20,837 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:54:20,866 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-22 01:54:20,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:54:20,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-22 01:54:20,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:20,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:54:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 01:54:21,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:54:21,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:21,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265127655] [2022-11-22 01:54:21,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:21,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070021098] [2022-11-22 01:54:21,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070021098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:21,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:21,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 01:54:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998335069] [2022-11-22 01:54:21,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:21,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:54:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:54:21,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:54:21,024 INFO L87 Difference]: Start difference. First operand 22326 states and 67554 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:22,327 INFO L93 Difference]: Finished difference Result 41888 states and 126962 transitions. [2022-11-22 01:54:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:54:22,328 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 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-22 01:54:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:22,448 INFO L225 Difference]: With dead ends: 41888 [2022-11-22 01:54:22,448 INFO L226 Difference]: Without dead ends: 41888 [2022-11-22 01:54:22,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-11-22 01:54:22,449 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 398 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:22,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 103 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 01:54:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41888 states. [2022-11-22 01:54:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41888 to 36329. [2022-11-22 01:54:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36329 states, 36308 states have (on average 3.0916326980279827) internal successors, (112251), 36328 states have internal predecessors, (112251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36329 states to 36329 states and 112251 transitions. [2022-11-22 01:54:23,592 INFO L78 Accepts]: Start accepts. Automaton has 36329 states and 112251 transitions. Word has length 30 [2022-11-22 01:54:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:23,592 INFO L495 AbstractCegarLoop]: Abstraction has 36329 states and 112251 transitions. [2022-11-22 01:54:23,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 36329 states and 112251 transitions. [2022-11-22 01:54:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 01:54:23,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:23,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:23,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 01:54:23,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:23,805 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:23,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:23,805 INFO L85 PathProgramCache]: Analyzing trace with hash 936168753, now seen corresponding path program 1 times [2022-11-22 01:54:23,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:23,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818808525] [2022-11-22 01:54:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:23,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:23,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:23,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815448184] [2022-11-22 01:54:23,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:23,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:23,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:23,841 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:23,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-22 01:54:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:24,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-22 01:54:24,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:24,187 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:54:24,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-22 01:54:24,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:24,226 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:54:24,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:24,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:54:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:54:24,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:54:24,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:24,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818808525] [2022-11-22 01:54:24,290 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:24,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815448184] [2022-11-22 01:54:24,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815448184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:24,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:24,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:54:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95935688] [2022-11-22 01:54:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:24,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:54:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:24,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:54:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:54:24,293 INFO L87 Difference]: Start difference. First operand 36329 states and 112251 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:25,648 INFO L93 Difference]: Finished difference Result 38661 states and 119232 transitions. [2022-11-22 01:54:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:54:25,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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-22 01:54:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:25,760 INFO L225 Difference]: With dead ends: 38661 [2022-11-22 01:54:25,760 INFO L226 Difference]: Without dead ends: 38641 [2022-11-22 01:54:25,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:54:25,761 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:25,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 62 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 01:54:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38641 states. [2022-11-22 01:54:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38641 to 38641. [2022-11-22 01:54:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38641 states, 38620 states have (on average 3.085784567581564) internal successors, (119173), 38640 states have internal predecessors, (119173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38641 states to 38641 states and 119173 transitions. [2022-11-22 01:54:27,095 INFO L78 Accepts]: Start accepts. Automaton has 38641 states and 119173 transitions. Word has length 30 [2022-11-22 01:54:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:27,096 INFO L495 AbstractCegarLoop]: Abstraction has 38641 states and 119173 transitions. [2022-11-22 01:54:27,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 38641 states and 119173 transitions. [2022-11-22 01:54:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 01:54:27,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:27,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:27,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-22 01:54:27,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 01:54:27,306 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1750440838, now seen corresponding path program 1 times [2022-11-22 01:54:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:27,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840622093] [2022-11-22 01:54:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:27,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:27,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559672272] [2022-11-22 01:54:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:27,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:27,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:27,332 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:27,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-22 01:54:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:27,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-22 01:54:27,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:27,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:27,704 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:54:27,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-22 01:54:27,758 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:54:27,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-22 01:54:27,827 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 01:54:27,827 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 11 treesize of output 11 [2022-11-22 01:54:28,081 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:54:28,135 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-22 01:54:28,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:54:28,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:54:28,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:28,350 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 54 treesize of output 50 [2022-11-22 01:54:28,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-11-22 01:54:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:54:28,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:54:28,527 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_thread1Thread1of1ForFork0_~i~0 4))) (and (forall ((v_ArrVal_2497 (Array Int Int))) (= |c_thread1Thread1of1ForFork0_#t~nondet3| (select (select (store |c_#race| c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse0)))) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse0 1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset 2 .cse0)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset 3 .cse0)) |c_thread1Thread1of1ForFork0_#t~nondet3|)))) is different from false [2022-11-22 01:54:28,704 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse2 |c_thread1Thread1of1ForFork0_#t~nondet3|)))) (and (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse2) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset 2 .cse1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)))))) is different from false [2022-11-22 01:54:28,740 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse1)) (.cse3 (+ c_~A~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 |c_thread1Thread1of1ForFork0_#t~nondet3|) .cse3 |c_thread1Thread1of1ForFork0_#t~nondet3|)))) (and (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse2) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse3) |c_thread1Thread1of1ForFork0_#t~nondet3|)))))) is different from false [2022-11-22 01:54:30,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:30,988 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 4 case distinctions, treesize of input 53 treesize of output 69 [2022-11-22 01:54:30,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:30,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 72 [2022-11-22 01:54:31,007 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-22 01:54:31,010 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-22 01:54:31,036 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-22 01:54:31,037 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 4 case distinctions, treesize of input 54 treesize of output 1 [2022-11-22 01:54:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:54:31,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:31,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840622093] [2022-11-22 01:54:31,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:31,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559672272] [2022-11-22 01:54:31,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559672272] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:54:31,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:54:31,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 21 [2022-11-22 01:54:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030878154] [2022-11-22 01:54:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:31,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:54:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:31,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:54:31,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=281, Unknown=23, NotChecked=114, Total=506 [2022-11-22 01:54:31,408 INFO L87 Difference]: Start difference. First operand 38641 states and 119173 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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-22 01:54:32,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset 2 .cse1)) (.cse4 (+ c_~A~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse3 |c_thread1Thread1of1ForFork0_#t~nondet3|) .cse4 |c_thread1Thread1of1ForFork0_#t~nondet3|))) (.cse2 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~A~0.base)))) (and (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (or (< c_~N~0 1) (and (or .cse2 (forall ((v_~B~0.base_276 Int)) (not (= (select |c_#valid| v_~B~0.base_276) 0)))) (not (= (select |c_#valid| c_~A~0.base) 0)))) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse3) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse4) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (or (not (< |c_ULTIMATE.start_main_~i~2#1| c_~N~0)) (and .cse2 (not (= c_~B~0.base c_~A~0.base)))))))) is different from false [2022-11-22 01:54:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:35,220 INFO L93 Difference]: Finished difference Result 61715 states and 188085 transitions. [2022-11-22 01:54:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 01:54:35,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 32 [2022-11-22 01:54:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:35,465 INFO L225 Difference]: With dead ends: 61715 [2022-11-22 01:54:35,465 INFO L226 Difference]: Without dead ends: 61715 [2022-11-22 01:54:35,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=108, Invalid=390, Unknown=24, NotChecked=180, Total=702 [2022-11-22 01:54:35,466 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 275 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 2 mSolverCounterUnsat, 243 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 243 IncrementalHoareTripleChecker+Unknown, 1151 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:35,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 172 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 470 Invalid, 243 Unknown, 1151 Unchecked, 3.1s Time] [2022-11-22 01:54:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61715 states. [2022-11-22 01:54:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61715 to 38767. [2022-11-22 01:54:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38767 states, 38746 states have (on average 3.086976720177567) internal successors, (119608), 38766 states have internal predecessors, (119608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38767 states to 38767 states and 119608 transitions. [2022-11-22 01:54:37,068 INFO L78 Accepts]: Start accepts. Automaton has 38767 states and 119608 transitions. Word has length 32 [2022-11-22 01:54:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:37,068 INFO L495 AbstractCegarLoop]: Abstraction has 38767 states and 119608 transitions. [2022-11-22 01:54:37,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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-22 01:54:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 38767 states and 119608 transitions. [2022-11-22 01:54:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 01:54:37,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:37,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:37,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-22 01:54:37,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:37,281 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:37,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:37,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1750619398, now seen corresponding path program 2 times [2022-11-22 01:54:37,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:37,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778652395] [2022-11-22 01:54:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:37,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:37,301 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:37,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50812813] [2022-11-22 01:54:37,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:54:37,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:37,302 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:37,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-22 01:54:37,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 01:54:37,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:54:37,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-22 01:54:37,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:37,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:37,622 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:54:37,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-22 01:54:37,676 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:54:37,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-22 01:54:37,733 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 01:54:37,733 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 11 treesize of output 11 [2022-11-22 01:54:38,013 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:54:38,068 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-22 01:54:38,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:54:38,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:54:38,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-11-22 01:54:38,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:38,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-11-22 01:54:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 01:54:38,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:54:38,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778652395] [2022-11-22 01:54:38,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50812813] [2022-11-22 01:54:38,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50812813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:38,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:38,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 01:54:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038402675] [2022-11-22 01:54:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:38,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:54:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:38,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:54:38,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:54:38,441 INFO L87 Difference]: Start difference. First operand 38767 states and 119608 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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-22 01:54:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:40,765 INFO L93 Difference]: Finished difference Result 44094 states and 134820 transitions. [2022-11-22 01:54:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:54:40,765 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 32 [2022-11-22 01:54:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:40,890 INFO L225 Difference]: With dead ends: 44094 [2022-11-22 01:54:40,891 INFO L226 Difference]: Without dead ends: 44094 [2022-11-22 01:54:40,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-11-22 01:54:40,891 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 287 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:40,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 122 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-22 01:54:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44094 states. [2022-11-22 01:54:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44094 to 36731. [2022-11-22 01:54:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36731 states, 36710 states have (on average 3.083001906837374) internal successors, (113177), 36730 states have internal predecessors, (113177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36731 states to 36731 states and 113177 transitions. [2022-11-22 01:54:42,091 INFO L78 Accepts]: Start accepts. Automaton has 36731 states and 113177 transitions. Word has length 32 [2022-11-22 01:54:42,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:42,092 INFO L495 AbstractCegarLoop]: Abstraction has 36731 states and 113177 transitions. [2022-11-22 01:54:42,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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-22 01:54:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 36731 states and 113177 transitions. [2022-11-22 01:54:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 01:54:42,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:42,105 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:42,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-22 01:54:42,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:42,305 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1386527827, now seen corresponding path program 1 times [2022-11-22 01:54:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:42,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192451355] [2022-11-22 01:54:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:42,336 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:42,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564592031] [2022-11-22 01:54:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:42,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:42,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:42,339 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:42,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-22 01:54:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:42,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:54:42,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:54:42,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:54:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:54:42,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:42,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192451355] [2022-11-22 01:54:42,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:42,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564592031] [2022-11-22 01:54:42,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564592031] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:54:42,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:54:42,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 01:54:42,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443589518] [2022-11-22 01:54:42,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:42,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:54:42,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:42,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:54:42,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:54:42,835 INFO L87 Difference]: Start difference. First operand 36731 states and 113177 transitions. Second operand has 5 states, 5 states have (on average 6.4) 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-22 01:54:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:43,324 INFO L93 Difference]: Finished difference Result 36522 states and 111683 transitions. [2022-11-22 01:54:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:54:43,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) 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 32 [2022-11-22 01:54:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:43,456 INFO L225 Difference]: With dead ends: 36522 [2022-11-22 01:54:43,457 INFO L226 Difference]: Without dead ends: 36522 [2022-11-22 01:54:43,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:54:43,458 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 122 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:43,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 74 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:54:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36522 states. [2022-11-22 01:54:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36522 to 36520. [2022-11-22 01:54:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36520 states, 36498 states have (on average 3.059921091566661) internal successors, (111681), 36519 states have internal predecessors, (111681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36520 states to 36520 states and 111681 transitions. [2022-11-22 01:54:44,962 INFO L78 Accepts]: Start accepts. Automaton has 36520 states and 111681 transitions. Word has length 32 [2022-11-22 01:54:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:44,964 INFO L495 AbstractCegarLoop]: Abstraction has 36520 states and 111681 transitions. [2022-11-22 01:54:44,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) 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-22 01:54:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 36520 states and 111681 transitions. [2022-11-22 01:54:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 01:54:44,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:44,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:44,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-22 01:54:45,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:45,187 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:54:45,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:45,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2079790042, now seen corresponding path program 1 times [2022-11-22 01:54:45,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:45,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936950390] [2022-11-22 01:54:45,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:45,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:45,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:54:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587581652] [2022-11-22 01:54:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:45,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:45,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:45,210 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:45,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-22 01:54:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:45,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-22 01:54:45,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:45,769 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:54:45,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:45,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:54:45,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:45,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:54:46,099 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 17 treesize of output 9 [2022-11-22 01:54:46,165 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:54:46,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:54:46,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,301 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 30 treesize of output 32 [2022-11-22 01:54:46,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:54:46,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:46,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:46,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:46,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:46,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:46,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:46,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:46,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:46,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:47,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:47,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:54:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:54:47,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:54:47,186 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3078 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3078 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3078 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3078 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-11-22 01:54:47,248 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-22 01:54:47,386 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-11-22 01:54:47,506 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-11-22 01:54:47,542 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)))) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0))))) is different from false [2022-11-22 01:54:47,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:47,847 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 4 case distinctions, treesize of input 39 treesize of output 55 [2022-11-22 01:54:47,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:47,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 516 treesize of output 478 [2022-11-22 01:54:47,890 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 430 treesize of output 398 [2022-11-22 01:54:47,907 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 398 treesize of output 382 [2022-11-22 01:54:47,916 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 382 treesize of output 374 [2022-11-22 01:54:48,945 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3061 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3061) c_~B~0.base) c_~B~0.offset) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-22 01:54:49,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:49,055 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-22 01:54:49,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:54:49,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:49,074 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 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-22 01:54:49,080 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 20 treesize of output 18 [2022-11-22 01:54:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:54:49,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:49,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936950390] [2022-11-22 01:54:49,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:54:49,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587581652] [2022-11-22 01:54:49,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587581652] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:54:49,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1060973385] [2022-11-22 01:54:49,403 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-22 01:54:49,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:54:49,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-22 01:54:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413670402] [2022-11-22 01:54:49,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:54:49,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:54:49,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:49,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:54:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=593, Unknown=25, NotChecked=330, Total=1056 [2022-11-22 01:54:49,407 INFO L87 Difference]: Start difference. First operand 36520 states and 111681 transitions. Second operand has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:58,989 INFO L93 Difference]: Finished difference Result 62878 states and 186487 transitions. [2022-11-22 01:54:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 01:54:58,990 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 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 32 [2022-11-22 01:54:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:59,218 INFO L225 Difference]: With dead ends: 62878 [2022-11-22 01:54:59,218 INFO L226 Difference]: Without dead ends: 62875 [2022-11-22 01:54:59,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=507, Invalid=1732, Unknown=41, NotChecked=582, Total=2862 [2022-11-22 01:54:59,220 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1047 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 3114 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 5805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 3114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2408 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:59,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 200 Invalid, 5805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 3114 Invalid, 0 Unknown, 2408 Unchecked, 5.9s Time] [2022-11-22 01:54:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62875 states. [2022-11-22 01:55:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62875 to 45203. [2022-11-22 01:55:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45203 states, 45181 states have (on average 3.069033443261548) internal successors, (138662), 45202 states have internal predecessors, (138662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45203 states to 45203 states and 138662 transitions. [2022-11-22 01:55:00,676 INFO L78 Accepts]: Start accepts. Automaton has 45203 states and 138662 transitions. Word has length 32 [2022-11-22 01:55:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:55:00,676 INFO L495 AbstractCegarLoop]: Abstraction has 45203 states and 138662 transitions. [2022-11-22 01:55:00,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 45203 states and 138662 transitions. [2022-11-22 01:55:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 01:55:00,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:55:00,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:55:00,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-22 01:55:00,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:55:00,886 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:55:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:55:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash 826937013, now seen corresponding path program 1 times [2022-11-22 01:55:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:55:00,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466776097] [2022-11-22 01:55:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:55:00,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:55:00,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499721358] [2022-11-22 01:55:00,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:00,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:55:00,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:55:00,911 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:55:00,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-22 01:55:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:55:01,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-22 01:55:01,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:55:01,752 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:55:01,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:01,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:55:01,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:01,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:55:01,978 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 17 treesize of output 9 [2022-11-22 01:55:02,041 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:55:02,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-22 01:55:02,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:02,134 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 01:55:02,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:02,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-22 01:55:02,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:02,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-11-22 01:55:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:55:02,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:55:02,371 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_thread2Thread1of1ForFork1_~j~0 4))) (and (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse0)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse0)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse0)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse0 1)) |c_thread2Thread1of1ForFork1_#t~nondet8|)))) is different from false [2022-11-22 01:55:02,557 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread2Thread1of1ForFork1_~j~0 4))) (let ((.cse2 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse1)) (.cse3 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse2 |c_thread2Thread1of1ForFork1_#t~nondet8|) .cse3 |c_thread2Thread1of1ForFork1_#t~nondet8|)))) (and (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse1 1)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse2) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse3) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse1)) |c_thread2Thread1of1ForFork1_#t~nondet8|)))))) is different from false [2022-11-22 01:55:02,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:02,755 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 4 case distinctions, treesize of input 50 treesize of output 66 [2022-11-22 01:55:02,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:02,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2022-11-22 01:55:02,777 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-22 01:55:02,778 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 4 case distinctions, treesize of input 51 treesize of output 1 [2022-11-22 01:55:03,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:03,081 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-22 01:55:03,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:03,098 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 68 treesize of output 66 [2022-11-22 01:55:03,103 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 52 treesize of output 48 [2022-11-22 01:55:03,116 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 48 treesize of output 46 [2022-11-22 01:55:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:55:03,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:55:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466776097] [2022-11-22 01:55:03,326 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:55:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499721358] [2022-11-22 01:55:03,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499721358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:55:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [477981985] [2022-11-22 01:55:03,327 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-22 01:55:03,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:55:03,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2022-11-22 01:55:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781766183] [2022-11-22 01:55:03,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:55:03,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:55:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:55:03,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:55:03,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=447, Unknown=27, NotChecked=90, Total=650 [2022-11-22 01:55:03,330 INFO L87 Difference]: Start difference. First operand 45203 states and 138662 transitions. Second operand has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:05,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-22 01:55:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:55:12,362 INFO L93 Difference]: Finished difference Result 56874 states and 172053 transitions. [2022-11-22 01:55:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:55:12,362 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 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 32 [2022-11-22 01:55:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:55:12,526 INFO L225 Difference]: With dead ends: 56874 [2022-11-22 01:55:12,526 INFO L226 Difference]: Without dead ends: 56874 [2022-11-22 01:55:12,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=223, Invalid=948, Unknown=27, NotChecked=134, Total=1332 [2022-11-22 01:55:12,527 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 634 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 3374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:55:12,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 493 Invalid, 3374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2927 Invalid, 1 Unknown, 409 Unchecked, 7.8s Time] [2022-11-22 01:55:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56874 states. [2022-11-22 01:55:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56874 to 48320. [2022-11-22 01:55:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48320 states, 48298 states have (on average 3.0714729388380473) internal successors, (148346), 48319 states have internal predecessors, (148346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48320 states to 48320 states and 148346 transitions. [2022-11-22 01:55:13,734 INFO L78 Accepts]: Start accepts. Automaton has 48320 states and 148346 transitions. Word has length 32 [2022-11-22 01:55:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:55:13,735 INFO L495 AbstractCegarLoop]: Abstraction has 48320 states and 148346 transitions. [2022-11-22 01:55:13,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 48320 states and 148346 transitions. [2022-11-22 01:55:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 01:55:13,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:55:13,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:55:13,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-22 01:55:13,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-22 01:55:13,946 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:55:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:55:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash 49004664, now seen corresponding path program 2 times [2022-11-22 01:55:13,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:55:13,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660355735] [2022-11-22 01:55:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:13,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:55:13,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:55:13,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143350250] [2022-11-22 01:55:13,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:55:13,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:55:13,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:55:13,967 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:55:13,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-22 01:55:14,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 01:55:14,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:55:14,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:55:14,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:55:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:55:14,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:55:14,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:55:14,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660355735] [2022-11-22 01:55:14,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:55:14,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143350250] [2022-11-22 01:55:14,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143350250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:55:14,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:55:14,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:55:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333916811] [2022-11-22 01:55:14,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:55:14,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:55:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:55:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:55:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:55:14,566 INFO L87 Difference]: Start difference. First operand 48320 states and 148346 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-22 01:55:15,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-22 01:55:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:55:16,652 INFO L93 Difference]: Finished difference Result 48469 states and 148655 transitions. [2022-11-22 01:55:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:55:16,652 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 32 [2022-11-22 01:55:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:55:16,888 INFO L225 Difference]: With dead ends: 48469 [2022-11-22 01:55:16,888 INFO L226 Difference]: Without dead ends: 48319 [2022-11-22 01:55:16,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:55:16,889 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 43 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:55:16,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 201 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-22 01:55:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48319 states. [2022-11-22 01:55:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48319 to 48319. [2022-11-22 01:55:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48319 states, 48297 states have (on average 3.0714744187009546) internal successors, (148343), 48318 states have internal predecessors, (148343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48319 states to 48319 states and 148343 transitions. [2022-11-22 01:55:18,146 INFO L78 Accepts]: Start accepts. Automaton has 48319 states and 148343 transitions. Word has length 32 [2022-11-22 01:55:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:55:18,146 INFO L495 AbstractCegarLoop]: Abstraction has 48319 states and 148343 transitions. [2022-11-22 01:55:18,146 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-22 01:55:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 48319 states and 148343 transitions. [2022-11-22 01:55:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 01:55:18,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:55:18,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:55:18,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-22 01:55:18,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-22 01:55:18,359 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:55:18,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:55:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash -537347640, now seen corresponding path program 1 times [2022-11-22 01:55:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:55:18,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059632889] [2022-11-22 01:55:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:55:18,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:55:18,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639609435] [2022-11-22 01:55:18,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:18,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:55:18,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:55:18,386 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:55:18,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-22 01:55:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:55:18,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 01:55:18,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:55:18,747 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-22 01:55:18,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:55:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:55:18,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:55:18,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059632889] [2022-11-22 01:55:18,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:55:18,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639609435] [2022-11-22 01:55:18,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639609435] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:55:18,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:55:18,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 01:55:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331587259] [2022-11-22 01:55:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:55:18,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:55:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:55:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:55:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:55:18,786 INFO L87 Difference]: Start difference. First operand 48319 states and 148343 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 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-22 01:55:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:55:19,100 INFO L93 Difference]: Finished difference Result 47833 states and 146918 transitions. [2022-11-22 01:55:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:55:19,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 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 33 [2022-11-22 01:55:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:55:19,228 INFO L225 Difference]: With dead ends: 47833 [2022-11-22 01:55:19,228 INFO L226 Difference]: Without dead ends: 47833 [2022-11-22 01:55:19,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:55:19,229 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 68 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:55:19,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 82 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:55:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47833 states. [2022-11-22 01:55:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47833 to 47833. [2022-11-22 01:55:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47833 states, 47811 states have (on average 3.0728911756708706) internal successors, (146918), 47832 states have internal predecessors, (146918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47833 states to 47833 states and 146918 transitions. [2022-11-22 01:55:21,051 INFO L78 Accepts]: Start accepts. Automaton has 47833 states and 146918 transitions. Word has length 33 [2022-11-22 01:55:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:55:21,051 INFO L495 AbstractCegarLoop]: Abstraction has 47833 states and 146918 transitions. [2022-11-22 01:55:21,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 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-22 01:55:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 47833 states and 146918 transitions. [2022-11-22 01:55:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:55:21,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:55:21,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:55:21,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-22 01:55:21,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-22 01:55:21,268 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:55:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:55:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1246251703, now seen corresponding path program 1 times [2022-11-22 01:55:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:55:21,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603839727] [2022-11-22 01:55:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:55:21,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:55:21,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371129892] [2022-11-22 01:55:21,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:21,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:55:21,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:55:21,308 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:55:21,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-22 01:55:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:55:21,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 01:55:21,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:55:21,994 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:55:22,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:55:22,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:55:22,369 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:55:22,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:55:22,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,556 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 30 treesize of output 32 [2022-11-22 01:55:22,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:55:22,814 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 17 treesize of output 9 [2022-11-22 01:55:22,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:22,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:22,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:22,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:23,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:23,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:23,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:23,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:23,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:23,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:23,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:23,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:23,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:23,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:23,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:23,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:55:23,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:55:23,708 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3826 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3826 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3826 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3826 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-11-22 01:55:30,365 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-11-22 01:55:30,516 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))))) is different from false [2022-11-22 01:55:30,620 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1))))))) is different from false [2022-11-22 01:55:30,710 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1))))))) is different from false [2022-11-22 01:55:30,798 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse4 0) .cse2 0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= 0 (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0))))))) is different from false [2022-11-22 01:55:30,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:30,853 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 4 case distinctions, treesize of input 39 treesize of output 55 [2022-11-22 01:55:30,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:30,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 272 treesize of output 242 [2022-11-22 01:55:30,888 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 114 treesize of output 110 [2022-11-22 01:55:30,897 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 206 treesize of output 190 [2022-11-22 01:55:30,905 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 190 treesize of output 182 [2022-11-22 01:55:31,031 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:55:31,032 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:55:31,044 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:55:31,044 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:55:31,056 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:55:31,056 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:55:31,209 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (forall ((v_ArrVal_3809 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3809) c_~B~0.base) c_~B~0.offset))))) is different from false [2022-11-22 01:55:31,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:31,362 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-22 01:55:31,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:31,378 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 142 treesize of output 136 [2022-11-22 01:55:31,385 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 122 treesize of output 114 [2022-11-22 01:55:31,396 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 114 treesize of output 110 [2022-11-22 01:55:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:55:32,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:55:32,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603839727] [2022-11-22 01:55:32,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:55:32,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371129892] [2022-11-22 01:55:32,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371129892] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:55:32,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1415890715] [2022-11-22 01:55:32,079 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-22 01:55:32,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:55:32,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-22 01:55:32,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922602483] [2022-11-22 01:55:32,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:55:32,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:55:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:55:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:55:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=545, Unknown=18, NotChecked=378, Total=1056 [2022-11-22 01:55:32,089 INFO L87 Difference]: Start difference. First operand 47833 states and 146918 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:55:42,023 INFO L93 Difference]: Finished difference Result 57299 states and 171308 transitions. [2022-11-22 01:55:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 01:55:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 01:55:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:55:42,213 INFO L225 Difference]: With dead ends: 57299 [2022-11-22 01:55:42,213 INFO L226 Difference]: Without dead ends: 57298 [2022-11-22 01:55:42,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=416, Invalid=1313, Unknown=21, NotChecked=602, Total=2352 [2022-11-22 01:55:42,214 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 792 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 5162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2344 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:55:42,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 190 Invalid, 5162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 2630 Invalid, 0 Unknown, 2344 Unchecked, 6.4s Time] [2022-11-22 01:55:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57298 states. [2022-11-22 01:55:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57298 to 47985. [2022-11-22 01:55:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47985 states, 47963 states have (on average 3.073577549360966) internal successors, (147418), 47984 states have internal predecessors, (147418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47985 states to 47985 states and 147418 transitions. [2022-11-22 01:55:43,557 INFO L78 Accepts]: Start accepts. Automaton has 47985 states and 147418 transitions. Word has length 34 [2022-11-22 01:55:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:55:43,557 INFO L495 AbstractCegarLoop]: Abstraction has 47985 states and 147418 transitions. [2022-11-22 01:55:43,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47985 states and 147418 transitions. [2022-11-22 01:55:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:55:43,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:55:43,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:55:43,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-22 01:55:43,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-22 01:55:43,771 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:55:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:55:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash 291811779, now seen corresponding path program 2 times [2022-11-22 01:55:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:55:43,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136527154] [2022-11-22 01:55:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:43,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:55:43,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:55:43,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676538878] [2022-11-22 01:55:43,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:55:43,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:55:43,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:55:43,801 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:55:43,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-22 01:55:44,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:55:44,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:55:44,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 01:55:44,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:55:44,888 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:55:44,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:44,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:55:45,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:55:45,219 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:55:45,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:55:45,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,354 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 30 treesize of output 32 [2022-11-22 01:55:45,458 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 17 treesize of output 9 [2022-11-22 01:55:45,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:55:45,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:45,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:45,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:45,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:45,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:45,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:45,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:45,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:46,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:46,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:46,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:46,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:55:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:55:46,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:55:53,063 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)))) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-11-22 01:55:53,150 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-11-22 01:55:53,219 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))))) is different from false [2022-11-22 01:55:53,292 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse3 0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0))))))) is different from false [2022-11-22 01:55:53,677 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse4 0) .cse3 0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= 0 (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2))))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0))))))) is different from false [2022-11-22 01:55:53,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:53,719 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 4 case distinctions, treesize of input 41 treesize of output 57 [2022-11-22 01:55:53,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:53,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 138 [2022-11-22 01:55:53,742 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 62 treesize of output 58 [2022-11-22 01:55:53,747 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 110 treesize of output 94 [2022-11-22 01:55:53,753 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 94 treesize of output 86 [2022-11-22 01:55:53,857 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:55:53,857 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:55:53,866 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:55:53,867 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 4 case distinctions, treesize of input 39 treesize of output 1 [2022-11-22 01:55:53,875 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:55:53,876 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:55:54,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:54,238 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-22 01:55:54,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:54,254 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 142 treesize of output 136 [2022-11-22 01:55:54,261 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 122 treesize of output 118 [2022-11-22 01:55:54,268 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 118 treesize of output 110 [2022-11-22 01:55:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:55:54,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:55:54,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136527154] [2022-11-22 01:55:54,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:55:54,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676538878] [2022-11-22 01:55:54,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676538878] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:55:54,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [872157509] [2022-11-22 01:55:54,653 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-22 01:55:54,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:55:54,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-22 01:55:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349410012] [2022-11-22 01:55:54,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:55:54,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:55:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:55:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:55:54,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=618, Unknown=46, NotChecked=280, Total=1056 [2022-11-22 01:55:54,655 INFO L87 Difference]: Start difference. First operand 47985 states and 147418 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:56:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:56:04,198 INFO L93 Difference]: Finished difference Result 58526 states and 175120 transitions. [2022-11-22 01:56:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 01:56:04,199 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 01:56:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:56:04,385 INFO L225 Difference]: With dead ends: 58526 [2022-11-22 01:56:04,385 INFO L226 Difference]: Without dead ends: 58525 [2022-11-22 01:56:04,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=422, Invalid=1532, Unknown=46, NotChecked=450, Total=2450 [2022-11-22 01:56:04,387 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 968 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 5024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1595 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:56:04,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 214 Invalid, 5024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 3096 Invalid, 0 Unknown, 1595 Unchecked, 6.8s Time] [2022-11-22 01:56:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58525 states. [2022-11-22 01:56:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58525 to 47985. [2022-11-22 01:56:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47985 states, 47963 states have (on average 3.073577549360966) internal successors, (147418), 47984 states have internal predecessors, (147418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:56:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47985 states to 47985 states and 147418 transitions. [2022-11-22 01:56:05,640 INFO L78 Accepts]: Start accepts. Automaton has 47985 states and 147418 transitions. Word has length 34 [2022-11-22 01:56:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:56:05,640 INFO L495 AbstractCegarLoop]: Abstraction has 47985 states and 147418 transitions. [2022-11-22 01:56:05,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:56:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 47985 states and 147418 transitions. [2022-11-22 01:56:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:56:05,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:56:05,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:56:05,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-22 01:56:05,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-22 01:56:05,853 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:56:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:56:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 525676119, now seen corresponding path program 3 times [2022-11-22 01:56:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:56:05,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010831849] [2022-11-22 01:56:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:56:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:56:05,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:56:05,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [691466809] [2022-11-22 01:56:05,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:56:05,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:56:05,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:56:05,882 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:56:05,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-22 01:56:07,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:56:07,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:56:07,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-22 01:56:07,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:56:07,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:07,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:07,217 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:56:07,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:56:07,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:07,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:07,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:07,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:07,331 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-22 01:56:07,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-11-22 01:56:07,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:07,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:07,475 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-22 01:56:07,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-11-22 01:56:07,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:56:07,728 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 25 treesize of output 25 [2022-11-22 01:56:07,787 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 25 treesize of output 25 [2022-11-22 01:56:07,971 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:56:08,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:08,058 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 21 treesize of output 20 [2022-11-22 01:56:08,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2022-11-22 01:56:08,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:08,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:08,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:56:08,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:08,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:08,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:08,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:56:08,748 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 41 treesize of output 37 [2022-11-22 01:56:08,792 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 41 treesize of output 37 [2022-11-22 01:56:08,843 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 41 treesize of output 37 [2022-11-22 01:56:08,894 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 41 treesize of output 37 [2022-11-22 01:56:09,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:09,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:09,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:09,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:09,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:09,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:09,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:09,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:09,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:09,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:56:09,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:56:09,443 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4286 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4286 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4286 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4286 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-11-22 01:56:20,090 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-11-22 01:56:20,194 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-11-22 01:56:20,228 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2))) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-11-22 01:56:20,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0) .cse3 0))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse2))))))) is different from false [2022-11-22 01:56:20,373 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse4 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse1))))))) is different from false [2022-11-22 01:56:20,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:56:20,421 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 4 case distinctions, treesize of input 41 treesize of output 57 [2022-11-22 01:56:20,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:56:20,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 304 treesize of output 270 [2022-11-22 01:56:20,453 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 238 treesize of output 222 [2022-11-22 01:56:20,464 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 122 treesize of output 114 [2022-11-22 01:56:20,472 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 214 treesize of output 182 [2022-11-22 01:56:20,630 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:56:20,631 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:56:20,641 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:56:20,642 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 4 case distinctions, treesize of input 39 treesize of output 1 [2022-11-22 01:56:20,652 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:56:20,653 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:56:21,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:56:21,051 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-22 01:56:21,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:56:21,065 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 76 treesize of output 74 [2022-11-22 01:56:21,070 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 28 treesize of output 26 [2022-11-22 01:56:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:56:22,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:56:22,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010831849] [2022-11-22 01:56:22,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:56:22,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691466809] [2022-11-22 01:56:22,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691466809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:56:22,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1083191033] [2022-11-22 01:56:22,229 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-22 01:56:22,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:56:22,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-22 01:56:22,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050646280] [2022-11-22 01:56:22,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:56:22,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:56:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:56:22,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:56:22,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=594, Unknown=30, NotChecked=330, Total=1056 [2022-11-22 01:56:22,233 INFO L87 Difference]: Start difference. First operand 47985 states and 147418 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:56:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:56:36,333 INFO L93 Difference]: Finished difference Result 58067 states and 173665 transitions. [2022-11-22 01:56:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-22 01:56:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 01:56:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:56:36,507 INFO L225 Difference]: With dead ends: 58067 [2022-11-22 01:56:36,507 INFO L226 Difference]: Without dead ends: 58066 [2022-11-22 01:56:36,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=488, Invalid=1666, Unknown=32, NotChecked=570, Total=2756 [2022-11-22 01:56:36,508 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 637 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 3670 mSolverCounterSat, 292 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 5679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 3670 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 1675 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:56:36,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 255 Invalid, 5679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 3670 Invalid, 42 Unknown, 1675 Unchecked, 8.0s Time] [2022-11-22 01:56:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58066 states. [2022-11-22 01:56:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58066 to 47985. [2022-11-22 01:56:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47985 states, 47963 states have (on average 3.073577549360966) internal successors, (147418), 47984 states have internal predecessors, (147418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:56:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47985 states to 47985 states and 147418 transitions. [2022-11-22 01:56:37,900 INFO L78 Accepts]: Start accepts. Automaton has 47985 states and 147418 transitions. Word has length 34 [2022-11-22 01:56:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:56:37,900 INFO L495 AbstractCegarLoop]: Abstraction has 47985 states and 147418 transitions. [2022-11-22 01:56:37,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:56:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47985 states and 147418 transitions. [2022-11-22 01:56:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:56:37,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:56:37,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:56:37,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-22 01:56:38,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:56:38,113 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:56:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:56:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1977522497, now seen corresponding path program 4 times [2022-11-22 01:56:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:56:38,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010162530] [2022-11-22 01:56:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:56:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:56:38,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:56:38,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522945417] [2022-11-22 01:56:38,137 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:56:38,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:56:38,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:56:38,138 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:56:38,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-22 01:56:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:56:38,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-22 01:56:38,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:56:38,783 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:56:38,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:38,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:56:38,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:38,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:56:39,145 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:56:39,213 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 17 treesize of output 9 [2022-11-22 01:56:39,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:56:39,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,358 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 30 treesize of output 32 [2022-11-22 01:56:39,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:56:39,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:39,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:39,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:39,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:39,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:39,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:39,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:39,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:39,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:39,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:56:40,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:56:40,114 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4513 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (forall ((v_ArrVal_4513 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4513 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4513 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-11-22 01:56:40,164 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-11-22 01:56:40,569 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-11-22 01:56:40,594 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0))))) is different from false [2022-11-22 01:56:40,622 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3)))))) is different from false [2022-11-22 01:56:40,663 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse3 0) .cse4 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) .cse1 v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) .cse1 v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) .cse1 v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3))) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) .cse1 v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0))))) is different from false [2022-11-22 01:56:40,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:56:40,691 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 4 case distinctions, treesize of input 49 treesize of output 65 [2022-11-22 01:56:40,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:56:40,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1244 treesize of output 1174 [2022-11-22 01:56:40,741 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 1094 treesize of output 1030 [2022-11-22 01:56:40,752 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 1030 treesize of output 902 [2022-11-22 01:56:40,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 902 treesize of output 870 [2022-11-22 01:56:42,931 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:56:42,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 1 [2022-11-22 01:56:42,941 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:56:42,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 1 [2022-11-22 01:56:42,951 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:56:42,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 1 [2022-11-22 01:56:43,100 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (forall ((v_ArrVal_4496 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4496) c_~B~0.base) c_~B~0.offset) |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2022-11-22 01:56:43,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:56:43,220 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-22 01:56:43,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:56:43,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:56:43,235 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 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-22 01:56:43,241 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 20 treesize of output 18 [2022-11-22 01:56:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:56:43,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:56:43,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010162530] [2022-11-22 01:56:43,586 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:56:43,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522945417] [2022-11-22 01:56:43,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522945417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:56:43,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1016953796] [2022-11-22 01:56:43,587 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-22 01:56:43,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:56:43,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-22 01:56:43,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402932040] [2022-11-22 01:56:43,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:56:43,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:56:43,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:56:43,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:56:43,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=563, Unknown=15, NotChecked=378, Total=1056 [2022-11-22 01:56:43,589 INFO L87 Difference]: Start difference. First operand 47985 states and 147418 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:56:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:56:54,422 INFO L93 Difference]: Finished difference Result 57795 states and 172841 transitions. [2022-11-22 01:56:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-22 01:56:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 01:56:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:56:54,594 INFO L225 Difference]: With dead ends: 57795 [2022-11-22 01:56:54,594 INFO L226 Difference]: Without dead ends: 57794 [2022-11-22 01:56:54,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=451, Invalid=1632, Unknown=15, NotChecked=658, Total=2756 [2022-11-22 01:56:54,596 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 473 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 4029 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 6751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 4029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2507 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:56:54,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 262 Invalid, 6751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 4029 Invalid, 0 Unknown, 2507 Unchecked, 7.8s Time] [2022-11-22 01:56:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57794 states. [2022-11-22 01:56:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57794 to 47985. [2022-11-22 01:56:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47985 states, 47963 states have (on average 3.073577549360966) internal successors, (147418), 47984 states have internal predecessors, (147418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:56:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47985 states to 47985 states and 147418 transitions. [2022-11-22 01:56:55,779 INFO L78 Accepts]: Start accepts. Automaton has 47985 states and 147418 transitions. Word has length 34 [2022-11-22 01:56:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:56:55,779 INFO L495 AbstractCegarLoop]: Abstraction has 47985 states and 147418 transitions. [2022-11-22 01:56:55,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:56:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 47985 states and 147418 transitions. [2022-11-22 01:56:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:56:55,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:56:55,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:56:55,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-22 01:56:55,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-22 01:56:55,993 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:56:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:56:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1217333769, now seen corresponding path program 5 times [2022-11-22 01:56:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:56:55,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785927649] [2022-11-22 01:56:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:56:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:56:56,014 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:56:56,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477464976] [2022-11-22 01:56:56,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:56:56,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:56:56,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:56:56,015 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:56:56,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-22 01:56:57,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:56:57,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:56:57,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 01:56:57,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:56:57,257 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:56:57,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:57,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:56:57,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:57,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:56:57,459 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:56:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:57,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:56:57,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:57,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:57,604 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 30 treesize of output 32 [2022-11-22 01:56:57,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:57,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:57,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:57,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:56:57,942 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 17 treesize of output 9 [2022-11-22 01:56:58,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:58,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:58,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:58,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:58,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:58,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:58,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:58,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:58,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:58,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:58,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:58,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:58,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:58,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:58,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:58,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:58,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:56:58,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:56:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:56:58,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:56:58,931 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4740 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4740 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4740 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4740 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-22 01:56:58,983 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4739) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4739) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4739) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4739) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-11-22 01:57:01,672 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))))) is different from false [2022-11-22 01:57:06,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:06,810 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 4 case distinctions, treesize of input 39 treesize of output 55 [2022-11-22 01:57:06,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:06,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 272 treesize of output 242 [2022-11-22 01:57:06,836 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 210 treesize of output 202 [2022-11-22 01:57:06,842 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 202 treesize of output 186 [2022-11-22 01:57:06,851 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 95 treesize of output 91 [2022-11-22 01:57:07,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:07,501 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-22 01:57:07,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:07,514 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 142 treesize of output 136 [2022-11-22 01:57:07,519 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 122 treesize of output 118 [2022-11-22 01:57:07,526 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 118 treesize of output 110 [2022-11-22 01:57:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:57:07,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:07,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785927649] [2022-11-22 01:57:07,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:57:07,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477464976] [2022-11-22 01:57:07,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477464976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:57:07,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1444474212] [2022-11-22 01:57:07,929 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-22 01:57:07,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:57:07,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-22 01:57:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645272588] [2022-11-22 01:57:07,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:57:07,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:57:07,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:07,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:57:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=643, Unknown=113, NotChecked=174, Total=1056 [2022-11-22 01:57:07,932 INFO L87 Difference]: Start difference. First operand 47985 states and 147418 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:57:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:31,004 INFO L93 Difference]: Finished difference Result 54918 states and 163957 transitions. [2022-11-22 01:57:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:57:31,004 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 01:57:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:31,293 INFO L225 Difference]: With dead ends: 54918 [2022-11-22 01:57:31,293 INFO L226 Difference]: Without dead ends: 54917 [2022-11-22 01:57:31,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=352, Invalid=1231, Unknown=151, NotChecked=246, Total=1980 [2022-11-22 01:57:31,295 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 916 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 3978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 795 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:57:31,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 218 Invalid, 3978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2913 Invalid, 0 Unknown, 795 Unchecked, 7.2s Time] [2022-11-22 01:57:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54917 states. [2022-11-22 01:57:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54917 to 48004. [2022-11-22 01:57:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48004 states, 47982 states have (on average 3.0735692551373432) internal successors, (147476), 48003 states have internal predecessors, (147476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:57:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48004 states to 48004 states and 147476 transitions. [2022-11-22 01:57:32,559 INFO L78 Accepts]: Start accepts. Automaton has 48004 states and 147476 transitions. Word has length 34 [2022-11-22 01:57:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:32,559 INFO L495 AbstractCegarLoop]: Abstraction has 48004 states and 147476 transitions. [2022-11-22 01:57:32,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:57:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 48004 states and 147476 transitions. [2022-11-22 01:57:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:57:32,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:32,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:57:32,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-22 01:57:32,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:57:32,784 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:57:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash -45121111, now seen corresponding path program 6 times [2022-11-22 01:57:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:32,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094958464] [2022-11-22 01:57:32,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:32,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:57:32,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440958953] [2022-11-22 01:57:32,809 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:57:32,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:57:32,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:57:32,810 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:57:32,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-22 01:57:33,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:57:33,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:57:33,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 01:57:33,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:57:34,040 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:57:34,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:57:34,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:57:34,237 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:57:34,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:57:34,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,347 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 30 treesize of output 32 [2022-11-22 01:57:34,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:57:34,665 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 17 treesize of output 9 [2022-11-22 01:57:34,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:34,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:34,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:34,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:34,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:34,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:34,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:35,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:35,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:35,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:35,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:35,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:35,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:57:35,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:57:35,278 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4967 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4967 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4967 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4967 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-22 01:57:35,324 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4966) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4966) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4966) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4966) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-11-22 01:57:35,720 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse0)))))) is different from false [2022-11-22 01:57:35,829 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)) (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)) (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))))))) is different from false [2022-11-22 01:57:35,886 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1))))))) is different from false [2022-11-22 01:57:35,939 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1))))))) is different from false [2022-11-22 01:57:35,993 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4 0) .cse3 0) .cse1 0))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2))))))) is different from false [2022-11-22 01:57:36,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:36,019 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 4 case distinctions, treesize of input 41 treesize of output 57 [2022-11-22 01:57:36,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:36,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1132 treesize of output 1062 [2022-11-22 01:57:36,333 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 982 treesize of output 918 [2022-11-22 01:57:36,344 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 918 treesize of output 790 [2022-11-22 01:57:36,356 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 790 treesize of output 758 [2022-11-22 01:57:36,843 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:57:36,844 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 4 case distinctions, treesize of input 39 treesize of output 1 [2022-11-22 01:57:36,852 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:57:36,852 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:57:36,860 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:57:36,860 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:57:37,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:37,130 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-22 01:57:37,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:37,142 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 76 treesize of output 74 [2022-11-22 01:57:37,148 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 28 treesize of output 26 [2022-11-22 01:57:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:57:37,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:37,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094958464] [2022-11-22 01:57:37,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:57:37,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440958953] [2022-11-22 01:57:37,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440958953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:57:37,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [80766969] [2022-11-22 01:57:37,498 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-22 01:57:37,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:57:37,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-22 01:57:37,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675036147] [2022-11-22 01:57:37,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:57:37,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:57:37,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:37,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:57:37,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=534, Unknown=34, NotChecked=378, Total=1056 [2022-11-22 01:57:37,500 INFO L87 Difference]: Start difference. First operand 48004 states and 147476 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:57:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:51,703 INFO L93 Difference]: Finished difference Result 57020 states and 170208 transitions. [2022-11-22 01:57:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 01:57:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 01:57:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:51,878 INFO L225 Difference]: With dead ends: 57020 [2022-11-22 01:57:51,878 INFO L226 Difference]: Without dead ends: 57019 [2022-11-22 01:57:51,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=330, Invalid=1146, Unknown=34, NotChecked=560, Total=2070 [2022-11-22 01:57:51,880 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 640 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 5922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2804 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:57:51,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 211 Invalid, 5922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2836 Invalid, 0 Unknown, 2804 Unchecked, 5.6s Time] [2022-11-22 01:57:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57019 states. [2022-11-22 01:57:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57019 to 48042. [2022-11-22 01:57:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48042 states, 48020 states have (on average 3.0737401082882134) internal successors, (147601), 48041 states have internal predecessors, (147601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:57:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48042 states to 48042 states and 147601 transitions. [2022-11-22 01:57:53,360 INFO L78 Accepts]: Start accepts. Automaton has 48042 states and 147601 transitions. Word has length 34 [2022-11-22 01:57:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:53,361 INFO L495 AbstractCegarLoop]: Abstraction has 48042 states and 147601 transitions. [2022-11-22 01:57:53,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:57:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 48042 states and 147601 transitions. [2022-11-22 01:57:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:57:53,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:53,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:57:53,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-22 01:57:53,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:57:53,574 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:57:53,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2143002393, now seen corresponding path program 7 times [2022-11-22 01:57:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:53,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66992846] [2022-11-22 01:57:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:53,600 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:57:53,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1013026996] [2022-11-22 01:57:53,601 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:57:53,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:57:53,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:57:53,602 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:57:53,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-22 01:57:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:54,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-22 01:57:54,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:57:54,272 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:57:54,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:54,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:57:54,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:54,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:57:54,506 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:57:54,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:54,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:57:54,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:54,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:54,648 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 30 treesize of output 32 [2022-11-22 01:57:54,854 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 17 treesize of output 9 [2022-11-22 01:57:54,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:54,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:54,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:54,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:57:55,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:55,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:55,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:55,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:55,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:55,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:55,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:55,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:55,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:55,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:55,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:55,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:55,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:55,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:55,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:55,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:55,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:57:55,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:57:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:57:55,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:57:55,700 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5194 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5194 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5194 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5194 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-22 01:57:56,044 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-11-22 01:57:56,136 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-11-22 01:57:56,171 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-11-22 01:57:56,227 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0))))) is different from false [2022-11-22 01:57:56,257 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-11-22 01:57:56,289 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse4 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0))))) is different from false [2022-11-22 01:57:56,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:56,314 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 4 case distinctions, treesize of input 45 treesize of output 61 [2022-11-22 01:57:56,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:56,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 636 treesize of output 590 [2022-11-22 01:57:56,348 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 542 treesize of output 478 [2022-11-22 01:57:56,355 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 478 treesize of output 446 [2022-11-22 01:57:56,362 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 446 treesize of output 430 [2022-11-22 01:57:56,882 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:57:56,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 1 [2022-11-22 01:57:56,891 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:57:56,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 1 [2022-11-22 01:57:56,900 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:57:56,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 1 [2022-11-22 01:57:56,967 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (forall ((v_ArrVal_5177 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5177) c_~B~0.base) c_~B~0.offset))))) is different from false [2022-11-22 01:57:57,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:57,070 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-22 01:57:57,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:57:57,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:57:57,082 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 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-22 01:57:57,087 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 20 treesize of output 18 [2022-11-22 01:57:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:57:57,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:57,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66992846] [2022-11-22 01:57:57,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:57:57,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013026996] [2022-11-22 01:57:57,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013026996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:57:57,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [8512994] [2022-11-22 01:57:57,368 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-22 01:57:57,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:57:57,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-22 01:57:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097906948] [2022-11-22 01:57:57,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:57:57,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:57:57,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:57,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:57:57,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=505, Unknown=24, NotChecked=424, Total=1056 [2022-11-22 01:57:57,372 INFO L87 Difference]: Start difference. First operand 48042 states and 147601 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:07,661 INFO L93 Difference]: Finished difference Result 57680 states and 172503 transitions. [2022-11-22 01:58:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 01:58:07,663 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 01:58:07,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:07,834 INFO L225 Difference]: With dead ends: 57680 [2022-11-22 01:58:07,834 INFO L226 Difference]: Without dead ends: 57679 [2022-11-22 01:58:07,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 8 IntricatePredicates, 5 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=446, Invalid=1454, Unknown=24, NotChecked=728, Total=2652 [2022-11-22 01:58:07,835 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 613 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 3170 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1900 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:58:07,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 230 Invalid, 5277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3170 Invalid, 0 Unknown, 1900 Unchecked, 7.2s Time] [2022-11-22 01:58:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57679 states. [2022-11-22 01:58:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57679 to 48004. [2022-11-22 01:58:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48004 states, 47982 states have (on average 3.0735692551373432) internal successors, (147476), 48003 states have internal predecessors, (147476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48004 states to 48004 states and 147476 transitions. [2022-11-22 01:58:09,094 INFO L78 Accepts]: Start accepts. Automaton has 48004 states and 147476 transitions. Word has length 34 [2022-11-22 01:58:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:09,095 INFO L495 AbstractCegarLoop]: Abstraction has 48004 states and 147476 transitions. [2022-11-22 01:58:09,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 48004 states and 147476 transitions. [2022-11-22 01:58:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:58:09,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:09,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:58:09,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-22 01:58:09,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:09,319 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:58:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:09,320 INFO L85 PathProgramCache]: Analyzing trace with hash 80373335, now seen corresponding path program 8 times [2022-11-22 01:58:09,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:09,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258470649] [2022-11-22 01:58:09,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:09,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:09,342 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:58:09,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192375598] [2022-11-22 01:58:09,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:58:09,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:09,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:58:09,344 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:58:09,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-22 01:58:10,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:58:10,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:58:10,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-22 01:58:10,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:58:10,498 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-22 01:58:10,499 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 2 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:58:10,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:10,578 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-22 01:58:10,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 01:58:10,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:10,675 INFO L321 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2022-11-22 01:58:10,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 25 [2022-11-22 01:58:10,895 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 11 treesize of output 7 [2022-11-22 01:58:11,253 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 48 treesize of output 48 [2022-11-22 01:58:11,352 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 48 treesize of output 48 [2022-11-22 01:58:11,536 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:58:11,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:11,651 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 21 treesize of output 20 [2022-11-22 01:58:11,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:11,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:11,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:58:12,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:12,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:12,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:12,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:58:12,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-11-22 01:58:12,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:12,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:12,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:12,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:12,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:12,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:12,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:12,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:12,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:12,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:12,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:12,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:13,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:13,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:58:13,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:58:13,177 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5427 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5427 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5427 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5427 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-22 01:58:13,225 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5426) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5426) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5426) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (forall ((v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5426) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-22 01:58:20,475 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0))))))) is different from false [2022-11-22 01:58:20,535 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))))) is different from false [2022-11-22 01:58:22,942 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset)) (.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0) .cse4 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0))))))) is different from false [2022-11-22 01:58:22,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:22,977 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 4 case distinctions, treesize of input 39 treesize of output 55 [2022-11-22 01:58:23,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:23,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 516 treesize of output 478 [2022-11-22 01:58:23,037 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 215 treesize of output 199 [2022-11-22 01:58:23,046 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 414 treesize of output 382 [2022-11-22 01:58:23,055 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 382 treesize of output 374 [2022-11-22 01:58:23,567 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:58:23,568 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:58:23,577 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:58:23,577 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:58:23,586 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-22 01:58:23,587 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-22 01:58:23,736 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (forall ((v_ArrVal_5410 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5410) c_~B~0.base) c_~B~0.offset)))) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-22 01:58:23,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:23,858 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-22 01:58:23,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:23,870 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 76 treesize of output 74 [2022-11-22 01:58:23,875 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 28 treesize of output 26 [2022-11-22 01:58:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:58:24,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:24,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258470649] [2022-11-22 01:58:24,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-22 01:58:24,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192375598] [2022-11-22 01:58:24,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192375598] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:58:24,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [387874953] [2022-11-22 01:58:24,508 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-22 01:58:24,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:58:24,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-22 01:58:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238373890] [2022-11-22 01:58:24,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:58:24,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 01:58:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:24,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 01:58:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=564, Unknown=50, NotChecked=330, Total=1056 [2022-11-22 01:58:24,511 INFO L87 Difference]: Start difference. First operand 48004 states and 147476 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:37,817 INFO L93 Difference]: Finished difference Result 57039 states and 170236 transitions. [2022-11-22 01:58:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 01:58:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 01:58:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:37,981 INFO L225 Difference]: With dead ends: 57039 [2022-11-22 01:58:37,981 INFO L226 Difference]: Without dead ends: 57038 [2022-11-22 01:58:37,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=375, Invalid=1312, Unknown=59, NotChecked=510, Total=2256 [2022-11-22 01:58:37,982 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 541 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 260 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 5240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 2039 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:58:37,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 221 Invalid, 5240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2921 Invalid, 20 Unknown, 2039 Unchecked, 7.0s Time] [2022-11-22 01:58:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57038 states. [2022-11-22 01:58:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57038 to 48084. [2022-11-22 01:58:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48084 states, 48062 states have (on average 3.073946152885856) internal successors, (147740), 48083 states have internal predecessors, (147740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48084 states to 48084 states and 147740 transitions. [2022-11-22 01:58:39,040 INFO L78 Accepts]: Start accepts. Automaton has 48084 states and 147740 transitions. Word has length 34 [2022-11-22 01:58:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:39,041 INFO L495 AbstractCegarLoop]: Abstraction has 48084 states and 147740 transitions. [2022-11-22 01:58:39,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 48084 states and 147740 transitions. [2022-11-22 01:58:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:58:39,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:39,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:58:39,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-22 01:58:39,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:39,255 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-22 01:58:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:39,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2017507947, now seen corresponding path program 9 times [2022-11-22 01:58:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:39,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362140470] [2022-11-22 01:58:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:39,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-22 01:58:39,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155980627] [2022-11-22 01:58:39,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:58:39,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:39,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:58:39,277 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:58:39,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4b263a-4309-4f2a-8241-03b6524896fe/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-22 01:58:42,910 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:58:42,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:58:42,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-22 01:58:42,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:58:43,080 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:58:43,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:43,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-22 01:58:43,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:43,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-22 01:58:43,372 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:58:43,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 01:58:43,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:43,590 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:58:43,766 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-22 01:58:43,766 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 25 treesize of output 12 [2022-11-22 01:58:43,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:43,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 01:58:43,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:43,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:43,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:43,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:43,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:44,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:44,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:44,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:44,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:44,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:44,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:44,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:44,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:44,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:44,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:44,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:44,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:44,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-22 01:58:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:58:44,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:58:44,429 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5654 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5654 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5654 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5654 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-11-22 01:58:44,762 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-11-22 01:58:45,675 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_thread2Thread1of1ForFork1_~i~1 c_~N~0)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) .cse1 v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) .cse1 v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) .cse1 v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) .cse1 v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))))) is different from false [2022-11-22 01:58:45,732 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse3 0))) (.cse1 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (and (forall ((v_thread2Thread1of1ForFork1_~i~1_398 Int)) (or (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) (select .cse1 (+ (* v_thread2Thread1of1ForFork1_~i~1_398 4) c_~B~0.offset)) v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (< v_thread2Thread1of1ForFork1_~i~1_398 c_~N~0)) (not (<= 0 v_thread2Thread1of1ForFork1_~i~1_398)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_398 Int)) (or (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) (select .cse1 (+ (* v_thread2Thread1of1ForFork1_~i~1_398 4) c_~B~0.offset)) v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (< v_thread2Thread1of1ForFork1_~i~1_398 c_~N~0)) (not (<= 0 v_thread2Thread1of1ForFork1_~i~1_398)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_398 Int)) (or (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) (select .cse1 (+ (* v_thread2Thread1of1ForFork1_~i~1_398 4) c_~B~0.offset)) v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (< v_thread2Thread1of1ForFork1_~i~1_398 c_~N~0)) (not (<= 0 v_thread2Thread1of1ForFork1_~i~1_398)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_398 Int)) (or (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) (select .cse1 (+ (* v_thread2Thread1of1ForFork1_~i~1_398 4) c_~B~0.offset)) v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (< v_thread2Thread1of1ForFork1_~i~1_398 c_~N~0)) (not (<= 0 v_thread2Thread1of1ForFork1_~i~1_398))))))) is different from false [2022-11-22 01:58:45,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse3 0) .cse4 0))) (.cse1 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (and (forall ((v_thread2Thread1of1ForFork1_~i~1_398 Int)) (or (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) (select .cse1 (+ (* v_thread2Thread1of1ForFork1_~i~1_398 4) c_~B~0.offset)) v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (< v_thread2Thread1of1ForFork1_~i~1_398 c_~N~0)) (not (<= 0 v_thread2Thread1of1ForFork1_~i~1_398)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_398 Int)) (or (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) (select .cse1 (+ (* v_thread2Thread1of1ForFork1_~i~1_398 4) c_~B~0.offset)) v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (< v_thread2Thread1of1ForFork1_~i~1_398 c_~N~0)) (not (<= 0 v_thread2Thread1of1ForFork1_~i~1_398)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_398 Int)) (or (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) (select .cse1 (+ (* v_thread2Thread1of1ForFork1_~i~1_398 4) c_~B~0.offset)) v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (< v_thread2Thread1of1ForFork1_~i~1_398 c_~N~0)) (not (<= 0 v_thread2Thread1of1ForFork1_~i~1_398)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_398 Int)) (or (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) (select .cse1 (+ (* v_thread2Thread1of1ForFork1_~i~1_398 4) c_~B~0.offset)) v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (< v_thread2Thread1of1ForFork1_~i~1_398 c_~N~0)) (not (<= 0 v_thread2Thread1of1ForFork1_~i~1_398))))))) is different from false [2022-11-22 01:58:45,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:45,837 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 4 case distinctions, treesize of input 49 treesize of output 65 [2022-11-22 01:58:45,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:45,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 400 treesize of output 366 [2022-11-22 01:58:45,863 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 178 treesize of output 170 [2022-11-22 01:58:45,868 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 326 treesize of output 310 [2022-11-22 01:58:45,874 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 310 treesize of output 278 [2022-11-22 01:58:46,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:46,008 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 4 case distinctions, treesize of input 47 treesize of output 63 [2022-11-22 01:58:46,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:58:46,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:58:46,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:46,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 50 [2022-11-22 01:58:46,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:46,047 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 4 case distinctions, treesize of input 49 treesize of output 65 [2022-11-22 01:58:46,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:58:46,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:58:46,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:46,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 52 [2022-11-22 01:58:46,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:46,088 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 4 case distinctions, treesize of input 49 treesize of output 65 [2022-11-22 01:58:46,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:58:46,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:58:46,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:46,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 52 [2022-11-22 01:58:48,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:48,604 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 1 case distinctions, treesize of input 49 treesize of output 50 [2022-11-22 01:58:48,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:58:48,615 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 104 treesize of output 100 [2022-11-22 01:58:48,621 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 83 treesize of output 71 [2022-11-22 01:58:48,626 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 71 treesize of output 65