./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 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_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/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_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/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_b560241c-3d6f-49db-b5ed-37ee7086c330/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 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 02:25:49,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:25:49,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:25:49,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:25:49,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:25:49,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:25:49,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:25:49,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:25:49,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:25:49,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:25:49,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:25:49,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:25:49,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:25:49,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:25:49,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:25:49,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:25:49,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:25:49,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:25:49,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:25:49,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:25:49,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:25:49,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:25:49,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:25:49,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:25:49,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:25:49,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:25:49,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:25:49,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:25:49,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:25:49,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:25:49,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:25:49,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:25:49,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:25:49,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:25:49,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:25:49,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:25:49,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:25:49,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:25:49,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:25:49,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:25:49,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:25:49,236 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-22 02:25:49,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:25:49,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:25:49,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:25:49,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:25:49,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:25:49,263 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:25:49,263 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:25:49,263 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:25:49,264 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:25:49,264 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:25:49,264 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:25:49,264 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:25:49,265 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:25:49,265 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:25:49,265 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:25:49,266 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:25:49,266 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:25:49,266 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:25:49,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:25:49,268 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:25:49,268 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:25:49,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:25:49,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:25:49,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:25:49,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:25:49,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:25:49,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:25:49,270 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-22 02:25:49,271 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:25:49,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:25:49,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:25:49,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:25:49,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:25:49,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:25:49,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:25:49,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:25:49,280 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:25:49,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:25:49,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:25:49,281 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:25:49,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:25:49,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:25:49,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:25:49,282 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_b560241c-3d6f-49db-b5ed-37ee7086c330/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_b560241c-3d6f-49db-b5ed-37ee7086c330/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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2022-11-22 02:25:49,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:25:49,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:25:49,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:25:49,627 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:25:49,628 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:25:49,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-11-22 02:25:52,814 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:25:53,101 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:25:53,115 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-11-22 02:25:53,135 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/data/47dd38ca6/657343ae1dcc4962be0020dd5a853488/FLAG88edb72c7 [2022-11-22 02:25:53,149 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/data/47dd38ca6/657343ae1dcc4962be0020dd5a853488 [2022-11-22 02:25:53,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:25:53,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:25:53,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:25:53,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:25:53,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:25:53,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:53,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c61f067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53, skipping insertion in model container [2022-11-22 02:25:53,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:53,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:25:53,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:25:53,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:25:53,757 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:25:53,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:25:53,945 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:25:53,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53 WrapperNode [2022-11-22 02:25:53,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:25:53,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:25:53,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:25:53,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:25:53,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:53,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,041 INFO L138 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2022-11-22 02:25:54,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:25:54,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:25:54,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:25:54,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:25:54,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,114 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:25:54,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:25:54,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:25:54,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:25:54,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (1/1) ... [2022-11-22 02:25:54,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:25:54,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:25:54,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:25:54,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:25:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 02:25:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:25:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:25:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:25:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 02:25:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:25:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-22 02:25:54,235 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-22 02:25:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:25:54,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:25:54,237 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 02:25:54,379 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:25:54,381 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:25:54,803 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:25:54,817 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:25:54,817 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-22 02:25:54,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:25:54 BoogieIcfgContainer [2022-11-22 02:25:54,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:25:54,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:25:54,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:25:54,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:25:54,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:25:53" (1/3) ... [2022-11-22 02:25:54,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472185e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:25:54, skipping insertion in model container [2022-11-22 02:25:54,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:25:53" (2/3) ... [2022-11-22 02:25:54,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472185e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:25:54, skipping insertion in model container [2022-11-22 02:25:54,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:25:54" (3/3) ... [2022-11-22 02:25:54,843 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2022-11-22 02:25:54,855 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 02:25:54,867 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:25:54,868 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-22 02:25:54,868 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 02:25:55,010 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 02:25:55,073 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 02:25:55,107 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 261 flow [2022-11-22 02:25:55,113 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 261 flow [2022-11-22 02:25:55,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 261 flow [2022-11-22 02:25:55,230 INFO L130 PetriNetUnfolder]: 6/127 cut-off events. [2022-11-22 02:25:55,230 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 02:25:55,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 230 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-22 02:25:55,242 INFO L119 LiptonReduction]: Number of co-enabled transitions 4864 [2022-11-22 02:25:58,032 INFO L134 LiptonReduction]: Checked pairs total: 14304 [2022-11-22 02:25:58,032 INFO L136 LiptonReduction]: Total number of compositions: 75 [2022-11-22 02:25:58,041 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 56 transitions, 117 flow [2022-11-22 02:25:58,098 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:58,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:25:58,124 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;@597a9d16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:25:58,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-22 02:25:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:25:58,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:25:58,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:25:58,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:25:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:25:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash -302456189, now seen corresponding path program 1 times [2022-11-22 02:25:58,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:25:58,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802764876] [2022-11-22 02:25:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:25:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:25:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:25:58,377 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 02:25:58,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:25:58,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802764876] [2022-11-22 02:25:58,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802764876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:25:58,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:25:58,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:25:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467103613] [2022-11-22 02:25:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:25:58,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:25:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:25:58,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:25:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:25:58,414 INFO L87 Difference]: Start difference. First operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:25:58,534 INFO L93 Difference]: Finished difference Result 596 states and 1189 transitions. [2022-11-22 02:25:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:25:58,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 02:25:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:25:58,553 INFO L225 Difference]: With dead ends: 596 [2022-11-22 02:25:58,554 INFO L226 Difference]: Without dead ends: 596 [2022-11-22 02:25:58,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:25:58,559 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:25:58,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:25:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-22 02:25:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2022-11-22 02:25:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 582 states have (on average 2.042955326460481) internal successors, (1189), 595 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1189 transitions. [2022-11-22 02:25:58,682 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1189 transitions. Word has length 11 [2022-11-22 02:25:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:25:58,682 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 1189 transitions. [2022-11-22 02:25:58,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1189 transitions. [2022-11-22 02:25:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:25:58,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:25:58,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:25:58,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:25:58,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:25:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:25:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash 335342195, now seen corresponding path program 1 times [2022-11-22 02:25:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:25:58,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797011006] [2022-11-22 02:25:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:25:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:25:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:25:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:25:58,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:25:58,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797011006] [2022-11-22 02:25:58,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797011006] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:25:58,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204121546] [2022-11-22 02:25:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:25:58,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:58,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:25:58,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:25:58,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:25:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:25:58,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:25:58,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:25:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:25:58,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:25:58,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204121546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:25:58,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:25:58,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-11-22 02:25:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188563904] [2022-11-22 02:25:58,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:25:58,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:25:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:25:58,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:25:58,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:25:58,933 INFO L87 Difference]: Start difference. First operand 596 states and 1189 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:25:59,022 INFO L93 Difference]: Finished difference Result 884 states and 1765 transitions. [2022-11-22 02:25:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:25:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 02:25:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:25:59,040 INFO L225 Difference]: With dead ends: 884 [2022-11-22 02:25:59,040 INFO L226 Difference]: Without dead ends: 884 [2022-11-22 02:25:59,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:25:59,042 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:25:59,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:25:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-11-22 02:25:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 614. [2022-11-22 02:25:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 600 states have (on average 2.0416666666666665) internal successors, (1225), 613 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1225 transitions. [2022-11-22 02:25:59,066 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1225 transitions. Word has length 12 [2022-11-22 02:25:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:25:59,067 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 1225 transitions. [2022-11-22 02:25:59,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1225 transitions. [2022-11-22 02:25:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:25:59,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:25:59,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:25:59,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:25:59,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:59,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:25:59,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:25:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1010482750, now seen corresponding path program 1 times [2022-11-22 02:25:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:25:59,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360892842] [2022-11-22 02:25:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:25:59,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:25:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:25:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:25:59,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:25:59,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360892842] [2022-11-22 02:25:59,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360892842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:25:59,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716893817] [2022-11-22 02:25:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:25:59,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:59,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:25:59,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:25:59,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:25:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:25:59,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:25:59,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:25:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:25:59,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:25:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:25:59,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716893817] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:25:59,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929793919] [2022-11-22 02:25:59,566 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 02:25:59,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:25:59,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-22 02:25:59,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050286194] [2022-11-22 02:25:59,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:25:59,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:25:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:25:59,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:25:59,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:25:59,580 INFO L87 Difference]: Start difference. First operand 614 states and 1225 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:25:59,704 INFO L93 Difference]: Finished difference Result 617 states and 1228 transitions. [2022-11-22 02:25:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:25:59,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 02:25:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:25:59,708 INFO L225 Difference]: With dead ends: 617 [2022-11-22 02:25:59,709 INFO L226 Difference]: Without dead ends: 617 [2022-11-22 02:25:59,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:25:59,711 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:25:59,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:25:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-22 02:25:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2022-11-22 02:25:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 603 states have (on average 2.0364842454394694) internal successors, (1228), 616 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1228 transitions. [2022-11-22 02:25:59,744 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1228 transitions. Word has length 12 [2022-11-22 02:25:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:25:59,744 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 1228 transitions. [2022-11-22 02:25:59,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:25:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1228 transitions. [2022-11-22 02:25:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:25:59,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:25:59,746 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:25:59,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:25:59,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:59,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:25:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:25:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2062627406, now seen corresponding path program 2 times [2022-11-22 02:25:59,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:25:59,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456771684] [2022-11-22 02:25:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:25:59,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:25:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:26:00,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:00,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456771684] [2022-11-22 02:26:00,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456771684] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:26:00,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610158116] [2022-11-22 02:26:00,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:26:00,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:00,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:26:00,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:26:00,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:26:00,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:26:00,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:26:00,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-22 02:26:00,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:00,308 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 02:26:00,336 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 02:26:00,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:26:00,368 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 02:26:00,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:26:00,407 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 02:26:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 02:26:00,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:26:00,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610158116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:26:00,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:26:00,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2022-11-22 02:26:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557449606] [2022-11-22 02:26:00,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:26:00,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:26:00,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:00,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:26:00,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:26:00,441 INFO L87 Difference]: Start difference. First operand 617 states and 1228 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:00,894 INFO L93 Difference]: Finished difference Result 718 states and 1430 transitions. [2022-11-22 02:26:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:26:00,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 02:26:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:00,899 INFO L225 Difference]: With dead ends: 718 [2022-11-22 02:26:00,899 INFO L226 Difference]: Without dead ends: 718 [2022-11-22 02:26:00,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:26:00,904 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:00,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 26 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:26:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-11-22 02:26:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 684. [2022-11-22 02:26:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 670 states have (on average 2.032835820895522) internal successors, (1362), 683 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states 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 02:26:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1362 transitions. [2022-11-22 02:26:00,931 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1362 transitions. Word has length 15 [2022-11-22 02:26:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:00,932 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 1362 transitions. [2022-11-22 02:26:00,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1362 transitions. [2022-11-22 02:26:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:26:00,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:00,934 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:00,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:26:01,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:01,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2106876720, now seen corresponding path program 1 times [2022-11-22 02:26:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:01,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729542903] [2022-11-22 02:26:01,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:26:01,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:01,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729542903] [2022-11-22 02:26:01,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729542903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:26:01,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688616783] [2022-11-22 02:26:01,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:01,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:01,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:26:01,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:26:01,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:26:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:01,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:26:01,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:26:01,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:26:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:26:01,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688616783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:26:01,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [558762395] [2022-11-22 02:26:01,511 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 02:26:01,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:26:01,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-22 02:26:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020620249] [2022-11-22 02:26:01,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:26:01,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:26:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:01,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:26:01,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:26:01,515 INFO L87 Difference]: Start difference. First operand 684 states and 1362 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:01,614 INFO L93 Difference]: Finished difference Result 690 states and 1368 transitions. [2022-11-22 02:26:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 02:26:01,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 02:26:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:01,619 INFO L225 Difference]: With dead ends: 690 [2022-11-22 02:26:01,620 INFO L226 Difference]: Without dead ends: 690 [2022-11-22 02:26:01,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:26:01,624 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:01,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:26:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-11-22 02:26:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2022-11-22 02:26:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 676 states have (on average 2.0236686390532546) internal successors, (1368), 689 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states 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 02:26:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1368 transitions. [2022-11-22 02:26:01,646 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1368 transitions. Word has length 15 [2022-11-22 02:26:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:01,647 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1368 transitions. [2022-11-22 02:26:01,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1368 transitions. [2022-11-22 02:26:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:26:01,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:01,652 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:01,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:26:01,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:01,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:01,859 INFO L85 PathProgramCache]: Analyzing trace with hash -198502704, now seen corresponding path program 2 times [2022-11-22 02:26:01,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:01,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83888886] [2022-11-22 02:26:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:01,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:02,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:02,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83888886] [2022-11-22 02:26:02,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83888886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:26:02,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:26:02,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:26:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036713383] [2022-11-22 02:26:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:26:02,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:26:02,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:02,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:26:02,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:26:02,287 INFO L87 Difference]: Start difference. First operand 690 states and 1368 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:02,865 INFO L93 Difference]: Finished difference Result 869 states and 1726 transitions. [2022-11-22 02:26:02,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:26:02,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 02:26:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:02,870 INFO L225 Difference]: With dead ends: 869 [2022-11-22 02:26:02,871 INFO L226 Difference]: Without dead ends: 869 [2022-11-22 02:26:02,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:26:02,875 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:02,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 26 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:26:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-11-22 02:26:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 807. [2022-11-22 02:26:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 794 states have (on average 2.017632241813602) internal successors, (1602), 806 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states 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 02:26:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1602 transitions. [2022-11-22 02:26:02,929 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1602 transitions. Word has length 21 [2022-11-22 02:26:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:02,935 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 1602 transitions. [2022-11-22 02:26:02,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1602 transitions. [2022-11-22 02:26:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-22 02:26:02,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:02,939 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:02,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:26:02,940 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -376671557, now seen corresponding path program 1 times [2022-11-22 02:26:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:02,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092058906] [2022-11-22 02:26:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:03,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:03,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092058906] [2022-11-22 02:26:03,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092058906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:26:03,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:26:03,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:26:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140076119] [2022-11-22 02:26:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:26:03,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:26:03,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:03,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:26:03,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:26:03,328 INFO L87 Difference]: Start difference. First operand 807 states and 1602 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 02:26:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:03,637 INFO L93 Difference]: Finished difference Result 893 states and 1774 transitions. [2022-11-22 02:26:03,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:26:03,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-22 02:26:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:03,642 INFO L225 Difference]: With dead ends: 893 [2022-11-22 02:26:03,643 INFO L226 Difference]: Without dead ends: 893 [2022-11-22 02:26:03,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:26:03,644 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:03,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 27 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:26:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-11-22 02:26:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 873. [2022-11-22 02:26:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 860 states have (on average 2.016279069767442) internal successors, (1734), 872 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states 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 02:26:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1734 transitions. [2022-11-22 02:26:03,687 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1734 transitions. Word has length 27 [2022-11-22 02:26:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:03,688 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1734 transitions. [2022-11-22 02:26:03,688 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 02:26:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1734 transitions. [2022-11-22 02:26:03,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-22 02:26:03,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:03,689 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:03,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:26:03,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:03,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:03,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2086777189, now seen corresponding path program 1 times [2022-11-22 02:26:03,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:03,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772248527] [2022-11-22 02:26:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:03,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:04,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:04,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772248527] [2022-11-22 02:26:04,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772248527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:26:04,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:26:04,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:26:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022891386] [2022-11-22 02:26:04,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:26:04,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:26:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:26:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:26:04,097 INFO L87 Difference]: Start difference. First operand 873 states and 1734 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 02:26:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:04,475 INFO L93 Difference]: Finished difference Result 1035 states and 2058 transitions. [2022-11-22 02:26:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:26:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-22 02:26:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:04,480 INFO L225 Difference]: With dead ends: 1035 [2022-11-22 02:26:04,480 INFO L226 Difference]: Without dead ends: 1003 [2022-11-22 02:26:04,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:26:04,481 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:04,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 26 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:26:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-11-22 02:26:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 967. [2022-11-22 02:26:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 954 states have (on average 2.010482180293501) internal successors, (1918), 966 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states 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 02:26:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1918 transitions. [2022-11-22 02:26:04,509 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1918 transitions. Word has length 27 [2022-11-22 02:26:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:04,510 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1918 transitions. [2022-11-22 02:26:04,510 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 02:26:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1918 transitions. [2022-11-22 02:26:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 02:26:04,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:04,512 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:04,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:26:04,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash -480294653, now seen corresponding path program 1 times [2022-11-22 02:26:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:04,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047255694] [2022-11-22 02:26:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-22 02:26:05,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:05,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047255694] [2022-11-22 02:26:05,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047255694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:26:05,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806129841] [2022-11-22 02:26:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:05,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:05,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:26:05,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:26:05,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:26:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:05,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 02:26:05,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:05,622 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 13 treesize of output 9 [2022-11-22 02:26:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:05,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:26:05,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806129841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:26:05,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:26:05,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-22 02:26:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849969194] [2022-11-22 02:26:05,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:26:05,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:26:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:26:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:26:05,685 INFO L87 Difference]: Start difference. First operand 967 states and 1918 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:05,879 INFO L93 Difference]: Finished difference Result 1835 states and 3628 transitions. [2022-11-22 02:26:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:26:05,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-22 02:26:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:05,893 INFO L225 Difference]: With dead ends: 1835 [2022-11-22 02:26:05,894 INFO L226 Difference]: Without dead ends: 1835 [2022-11-22 02:26:05,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:26:05,895 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 149 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:05,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 130 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:26:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-11-22 02:26:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1007. [2022-11-22 02:26:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 994 states have (on average 1.9839034205231387) internal successors, (1972), 1006 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states 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 02:26:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1972 transitions. [2022-11-22 02:26:05,936 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1972 transitions. Word has length 31 [2022-11-22 02:26:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:05,936 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1972 transitions. [2022-11-22 02:26:05,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1972 transitions. [2022-11-22 02:26:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 02:26:05,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:05,941 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:05,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:26:06,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-22 02:26:06,148 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:06,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1142892563, now seen corresponding path program 2 times [2022-11-22 02:26:06,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:06,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260848610] [2022-11-22 02:26:06,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:06,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-22 02:26:06,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:06,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260848610] [2022-11-22 02:26:06,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260848610] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:26:06,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410846243] [2022-11-22 02:26:06,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:26:06,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:06,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:26:06,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:26:06,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:26:07,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:26:07,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:26:07,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 02:26:07,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:07,109 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 13 treesize of output 9 [2022-11-22 02:26:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:07,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:26:07,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410846243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:26:07,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:26:07,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-22 02:26:07,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708198463] [2022-11-22 02:26:07,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:26:07,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:26:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:07,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:26:07,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:26:07,166 INFO L87 Difference]: Start difference. First operand 1007 states and 1972 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:07,385 INFO L93 Difference]: Finished difference Result 2210 states and 4348 transitions. [2022-11-22 02:26:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:26:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-22 02:26:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:07,395 INFO L225 Difference]: With dead ends: 2210 [2022-11-22 02:26:07,395 INFO L226 Difference]: Without dead ends: 2210 [2022-11-22 02:26:07,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:26:07,396 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 188 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:07,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 132 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:26:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2022-11-22 02:26:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 1036. [2022-11-22 02:26:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1023 states have (on average 1.9843597262952102) internal successors, (2030), 1035 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states 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 02:26:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2030 transitions. [2022-11-22 02:26:07,438 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2030 transitions. Word has length 31 [2022-11-22 02:26:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:07,438 INFO L495 AbstractCegarLoop]: Abstraction has 1036 states and 2030 transitions. [2022-11-22 02:26:07,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2030 transitions. [2022-11-22 02:26:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 02:26:07,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:07,440 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:07,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:26:07,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 02:26:07,646 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 8333467, now seen corresponding path program 3 times [2022-11-22 02:26:07,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:07,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640643199] [2022-11-22 02:26:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:07,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-22 02:26:08,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:08,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640643199] [2022-11-22 02:26:08,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640643199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:26:08,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095061700] [2022-11-22 02:26:08,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:26:08,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:08,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:26:08,249 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:26:08,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:26:08,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:26:08,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:26:08,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-22 02:26:08,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:08,552 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 13 treesize of output 9 [2022-11-22 02:26:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:08,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:26:08,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095061700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:26:08,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:26:08,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-22 02:26:08,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564743564] [2022-11-22 02:26:08,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:26:08,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:26:08,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:08,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:26:08,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:26:08,647 INFO L87 Difference]: Start difference. First operand 1036 states and 2030 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:08,954 INFO L93 Difference]: Finished difference Result 2483 states and 4893 transitions. [2022-11-22 02:26:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:26:08,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-22 02:26:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:08,966 INFO L225 Difference]: With dead ends: 2483 [2022-11-22 02:26:08,967 INFO L226 Difference]: Without dead ends: 2483 [2022-11-22 02:26:08,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:26:08,969 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 170 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:08,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 148 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:26:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2022-11-22 02:26:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1049. [2022-11-22 02:26:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1036 states have (on average 1.9845559845559846) internal successors, (2056), 1048 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states 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 02:26:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2056 transitions. [2022-11-22 02:26:09,026 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2056 transitions. Word has length 31 [2022-11-22 02:26:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:09,026 INFO L495 AbstractCegarLoop]: Abstraction has 1049 states and 2056 transitions. [2022-11-22 02:26:09,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2056 transitions. [2022-11-22 02:26:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:26:09,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:09,029 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:09,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:26:09,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:09,235 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 738751465, now seen corresponding path program 1 times [2022-11-22 02:26:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:09,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401724094] [2022-11-22 02:26:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:09,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:09,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401724094] [2022-11-22 02:26:09,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401724094] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:26:09,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898497569] [2022-11-22 02:26:09,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:09,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:09,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:26:09,331 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:26:09,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:26:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:09,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:26:09,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:09,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:26:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:09,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898497569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:26:09,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [963560198] [2022-11-22 02:26:09,568 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 02:26:09,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:26:09,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-22 02:26:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623093132] [2022-11-22 02:26:09,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:26:09,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:26:09,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:09,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:26:09,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:26:09,572 INFO L87 Difference]: Start difference. First operand 1049 states and 2056 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:09,732 INFO L93 Difference]: Finished difference Result 2629 states and 5216 transitions. [2022-11-22 02:26:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:26:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-22 02:26:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:09,748 INFO L225 Difference]: With dead ends: 2629 [2022-11-22 02:26:09,748 INFO L226 Difference]: Without dead ends: 2629 [2022-11-22 02:26:09,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:26:09,749 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 172 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:09,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 154 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:26:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-11-22 02:26:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2494. [2022-11-22 02:26:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2481 states have (on average 2.047964530431278) internal successors, (5081), 2493 states have internal predecessors, (5081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 5081 transitions. [2022-11-22 02:26:09,837 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 5081 transitions. Word has length 35 [2022-11-22 02:26:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:09,839 INFO L495 AbstractCegarLoop]: Abstraction has 2494 states and 5081 transitions. [2022-11-22 02:26:09,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 5081 transitions. [2022-11-22 02:26:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:26:09,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:09,841 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:09,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:26:10,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 02:26:10,047 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash -319394765, now seen corresponding path program 1 times [2022-11-22 02:26:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:10,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199459060] [2022-11-22 02:26:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:11,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:11,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199459060] [2022-11-22 02:26:11,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199459060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:26:11,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625286685] [2022-11-22 02:26:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:26:11,396 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:26:11,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 02:26:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:11,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-22 02:26:11,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:12,005 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 02:26:12,063 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 02:26:12,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,221 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 28 treesize of output 30 [2022-11-22 02:26:12,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,262 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 02:26:12,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,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 02:26:12,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,331 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 02:26:12,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2022-11-22 02:26:12,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-11-22 02:26:12,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:12,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2022-11-22 02:26:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:12,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:26:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:14,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625286685] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:26:14,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [48729868] [2022-11-22 02:26:14,365 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 02:26:14,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:26:14,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 34 [2022-11-22 02:26:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753766106] [2022-11-22 02:26:14,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:26:14,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 02:26:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:14,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 02:26:14,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2022-11-22 02:26:14,368 INFO L87 Difference]: Start difference. First operand 2494 states and 5081 transitions. Second operand has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 35 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:39,764 INFO L93 Difference]: Finished difference Result 7600 states and 15406 transitions. [2022-11-22 02:26:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-22 02:26:39,764 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 35 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:26:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:39,802 INFO L225 Difference]: With dead ends: 7600 [2022-11-22 02:26:39,802 INFO L226 Difference]: Without dead ends: 7600 [2022-11-22 02:26:39,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=991, Invalid=3839, Unknown=0, NotChecked=0, Total=4830 [2022-11-22 02:26:39,805 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 710 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 5535 mSolverCounterSat, 272 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 5808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 5535 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:39,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 416 Invalid, 5808 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [272 Valid, 5535 Invalid, 1 Unknown, 0 Unchecked, 20.5s Time] [2022-11-22 02:26:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7600 states. [2022-11-22 02:26:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7600 to 5196. [2022-11-22 02:26:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5196 states, 5183 states have (on average 2.1450897163804745) internal successors, (11118), 5195 states have internal predecessors, (11118), 0 states have call successors, (0), 0 states 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 02:26:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5196 states to 5196 states and 11118 transitions. [2022-11-22 02:26:39,999 INFO L78 Accepts]: Start accepts. Automaton has 5196 states and 11118 transitions. Word has length 45 [2022-11-22 02:26:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:39,999 INFO L495 AbstractCegarLoop]: Abstraction has 5196 states and 11118 transitions. [2022-11-22 02:26:39,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 35 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 5196 states and 11118 transitions. [2022-11-22 02:26:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:26:40,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:40,002 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:26:40,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:26:40,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 02:26:40,208 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1521304753, now seen corresponding path program 1 times [2022-11-22 02:26:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:40,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954544148] [2022-11-22 02:26:40,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:41,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:41,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954544148] [2022-11-22 02:26:41,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954544148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:26:41,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289478840] [2022-11-22 02:26:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:41,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:26:41,525 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:26:41,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:26:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:41,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-22 02:26:41,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:42,101 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 02:26:42,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,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 21 treesize of output 20 [2022-11-22 02:26:42,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,210 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 02:26:42,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,289 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 02:26:42,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:26:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:26:42,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:42,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-22 02:26:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:46,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:26:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:26:49,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289478840] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:26:49,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [709260384] [2022-11-22 02:26:49,117 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 02:26:49,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:26:49,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2022-11-22 02:26:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533823796] [2022-11-22 02:26:49,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:26:49,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 02:26:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:49,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 02:26:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1045, Unknown=1, NotChecked=0, Total=1260 [2022-11-22 02:26:49,120 INFO L87 Difference]: Start difference. First operand 5196 states and 11118 transitions. Second operand has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:26:56,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:26:58,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:01,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:05,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:07,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:27:18,056 INFO L93 Difference]: Finished difference Result 9116 states and 18438 transitions. [2022-11-22 02:27:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 02:27:18,057 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:27:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:27:18,080 INFO L225 Difference]: With dead ends: 9116 [2022-11-22 02:27:18,081 INFO L226 Difference]: Without dead ends: 9116 [2022-11-22 02:27:18,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=718, Invalid=3186, Unknown=2, NotChecked=0, Total=3906 [2022-11-22 02:27:18,082 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 822 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 3948 mSolverCounterSat, 165 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 4118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 3948 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:27:18,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 274 Invalid, 4118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 3948 Invalid, 5 Unknown, 0 Unchecked, 23.3s Time] [2022-11-22 02:27:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9116 states. [2022-11-22 02:27:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9116 to 5570. [2022-11-22 02:27:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5557 states have (on average 2.140543458700738) internal successors, (11895), 5569 states have internal predecessors, (11895), 0 states have call successors, (0), 0 states 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 02:27:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 11895 transitions. [2022-11-22 02:27:18,253 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 11895 transitions. Word has length 45 [2022-11-22 02:27:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:27:18,253 INFO L495 AbstractCegarLoop]: Abstraction has 5570 states and 11895 transitions. [2022-11-22 02:27:18,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:27:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 11895 transitions. [2022-11-22 02:27:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:27:18,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:27:18,256 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:27:18,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:27:18,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 02:27:18,463 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:27:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:27:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash -445177318, now seen corresponding path program 1 times [2022-11-22 02:27:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:27:18,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384016294] [2022-11-22 02:27:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:27:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:27:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:27:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:27:19,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:27:19,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384016294] [2022-11-22 02:27:19,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384016294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:27:19,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071636104] [2022-11-22 02:27:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:27:19,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:27:19,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:27:19,223 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:27:19,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 02:27:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:27:19,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 02:27:19,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:27:19,825 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 02:27:19,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 21 treesize of output 20 [2022-11-22 02:27:19,937 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 02:27:20,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:20,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:20,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:20,009 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 37 treesize of output 42 [2022-11-22 02:27:20,058 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 02:27:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:27:20,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:27:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:27:20,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071636104] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:27:20,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2145022437] [2022-11-22 02:27:20,855 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 02:27:20,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:27:20,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-22 02:27:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684863460] [2022-11-22 02:27:20,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:27:20,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:27:20,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:27:20,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:27:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:27:20,860 INFO L87 Difference]: Start difference. First operand 5570 states and 11895 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:27:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:27:31,491 INFO L93 Difference]: Finished difference Result 9023 states and 18283 transitions. [2022-11-22 02:27:31,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-22 02:27:31,492 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:27:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:27:31,513 INFO L225 Difference]: With dead ends: 9023 [2022-11-22 02:27:31,514 INFO L226 Difference]: Without dead ends: 9023 [2022-11-22 02:27:31,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=783, Invalid=3507, Unknown=0, NotChecked=0, Total=4290 [2022-11-22 02:27:31,515 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 723 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 4659 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 4803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 4659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:27:31,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 370 Invalid, 4803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 4659 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-11-22 02:27:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9023 states. [2022-11-22 02:27:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9023 to 5833. [2022-11-22 02:27:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5833 states, 5820 states have (on average 2.138316151202749) internal successors, (12445), 5832 states have internal predecessors, (12445), 0 states have call successors, (0), 0 states 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 02:27:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 12445 transitions. [2022-11-22 02:27:31,764 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 12445 transitions. Word has length 45 [2022-11-22 02:27:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:27:31,764 INFO L495 AbstractCegarLoop]: Abstraction has 5833 states and 12445 transitions. [2022-11-22 02:27:31,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:27:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 12445 transitions. [2022-11-22 02:27:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:27:31,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:27:31,767 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:27:31,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 02:27:31,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:27:31,973 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:27:31,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:27:31,974 INFO L85 PathProgramCache]: Analyzing trace with hash -637358470, now seen corresponding path program 2 times [2022-11-22 02:27:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:27:31,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146028941] [2022-11-22 02:27:31,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:27:31,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:27:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:27:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:27:32,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:27:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146028941] [2022-11-22 02:27:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146028941] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:27:32,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652801511] [2022-11-22 02:27:32,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:27:32,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:27:32,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:27:32,704 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:27:32,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 02:27:32,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:27:32,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:27:32,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-22 02:27:32,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:27:32,996 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 13 treesize of output 9 [2022-11-22 02:27:33,158 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 02:27:33,223 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 02:27:33,295 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 02:27:33,373 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 02:27:33,491 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:27:33,492 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 19 treesize of output 11 [2022-11-22 02:27:33,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:33,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:33,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:33,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:33,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-22 02:27:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:27:33,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:27:34,848 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 21 treesize of output 19 [2022-11-22 02:27:34,852 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 19 treesize of output 12 [2022-11-22 02:27:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:27:34,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652801511] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:27:34,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:27:34,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-11-22 02:27:34,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83069031] [2022-11-22 02:27:34,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:27:34,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:27:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:27:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:27:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2022-11-22 02:27:34,864 INFO L87 Difference]: Start difference. First operand 5833 states and 12445 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:27:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:27:43,526 INFO L93 Difference]: Finished difference Result 7229 states and 15334 transitions. [2022-11-22 02:27:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:27:43,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:27:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:27:43,544 INFO L225 Difference]: With dead ends: 7229 [2022-11-22 02:27:43,544 INFO L226 Difference]: Without dead ends: 7229 [2022-11-22 02:27:43,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2022-11-22 02:27:43,545 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 116 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:27:43,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 28 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1040 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2022-11-22 02:27:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2022-11-22 02:27:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 5974. [2022-11-22 02:27:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5974 states, 5961 states have (on average 2.1390706257339374) internal successors, (12751), 5973 states have internal predecessors, (12751), 0 states have call successors, (0), 0 states 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 02:27:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5974 states to 5974 states and 12751 transitions. [2022-11-22 02:27:43,691 INFO L78 Accepts]: Start accepts. Automaton has 5974 states and 12751 transitions. Word has length 45 [2022-11-22 02:27:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:27:43,692 INFO L495 AbstractCegarLoop]: Abstraction has 5974 states and 12751 transitions. [2022-11-22 02:27:43,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:27:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5974 states and 12751 transitions. [2022-11-22 02:27:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:27:43,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:27:43,694 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:27:43,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 02:27:43,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 02:27:43,904 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:27:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:27:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash -559390060, now seen corresponding path program 3 times [2022-11-22 02:27:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:27:43,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633008853] [2022-11-22 02:27:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:27:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:27:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:27:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:27:44,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:27:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633008853] [2022-11-22 02:27:44,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633008853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:27:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127332030] [2022-11-22 02:27:44,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:27:44,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:27:44,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:27:44,623 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:27:44,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 02:27:45,005 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:27:45,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:27:45,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-22 02:27:45,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:27:45,265 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 02:27:45,302 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 02:27:45,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:27:45,360 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 02:27:45,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:45,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:45,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:27:45,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:27:45,480 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 37 treesize of output 42 [2022-11-22 02:27:45,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:27:45,525 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 02:27:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:27:45,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:27:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:27:46,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127332030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:27:46,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [790978132] [2022-11-22 02:27:46,360 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 02:27:46,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:27:46,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-22 02:27:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678601251] [2022-11-22 02:27:46,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:27:46,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:27:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:27:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:27:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:27:46,365 INFO L87 Difference]: Start difference. First operand 5974 states and 12751 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:27:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:27:58,973 INFO L93 Difference]: Finished difference Result 7857 states and 15965 transitions. [2022-11-22 02:27:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-22 02:27:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:27:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:27:58,992 INFO L225 Difference]: With dead ends: 7857 [2022-11-22 02:27:58,993 INFO L226 Difference]: Without dead ends: 7857 [2022-11-22 02:27:58,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=629, Invalid=2563, Unknown=0, NotChecked=0, Total=3192 [2022-11-22 02:27:58,994 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 635 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 3431 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 3431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:27:58,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 308 Invalid, 3587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 3431 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-11-22 02:27:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7857 states. [2022-11-22 02:27:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7857 to 5971. [2022-11-22 02:27:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5971 states, 5958 states have (on average 2.1391406512252433) internal successors, (12745), 5970 states have internal predecessors, (12745), 0 states have call successors, (0), 0 states 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 02:27:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5971 states to 5971 states and 12745 transitions. [2022-11-22 02:27:59,221 INFO L78 Accepts]: Start accepts. Automaton has 5971 states and 12745 transitions. Word has length 45 [2022-11-22 02:27:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:27:59,222 INFO L495 AbstractCegarLoop]: Abstraction has 5971 states and 12745 transitions. [2022-11-22 02:27:59,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:27:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5971 states and 12745 transitions. [2022-11-22 02:27:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:27:59,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:27:59,224 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:27:59,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 02:27:59,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 02:27:59,436 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:27:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:27:59,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1888536410, now seen corresponding path program 4 times [2022-11-22 02:27:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:27:59,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179914787] [2022-11-22 02:27:59,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:27:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:27:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:28:00,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:00,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179914787] [2022-11-22 02:28:00,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179914787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:28:00,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262550084] [2022-11-22 02:28:00,131 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 02:28:00,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:28:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:28:00,136 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:28:00,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 02:28:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:00,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 02:28:00,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:28:00,623 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 02:28:00,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 21 treesize of output 20 [2022-11-22 02:28:00,777 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 02:28:00,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:28:00,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:28:00,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:28:00,832 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 37 treesize of output 42 [2022-11-22 02:28:00,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:28:00,880 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 02:28:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:28:00,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:28:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:28:02,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262550084] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:28:02,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [731344927] [2022-11-22 02:28:02,162 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 02:28:02,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:28:02,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-22 02:28:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61293394] [2022-11-22 02:28:02,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:28:02,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:28:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:28:02,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:28:02,165 INFO L87 Difference]: Start difference. First operand 5971 states and 12745 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:08,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:20,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:39,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:44,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:47,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:51,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:55,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:57,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:29:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:00,942 INFO L93 Difference]: Finished difference Result 7927 states and 16105 transitions. [2022-11-22 02:29:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-22 02:29:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:29:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:00,962 INFO L225 Difference]: With dead ends: 7927 [2022-11-22 02:29:00,962 INFO L226 Difference]: Without dead ends: 7927 [2022-11-22 02:29:00,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=707, Invalid=3075, Unknown=0, NotChecked=0, Total=3782 [2022-11-22 02:29:00,964 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 630 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 5247 mSolverCounterSat, 134 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 5387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 5247 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:00,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 416 Invalid, 5387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 5247 Invalid, 6 Unknown, 0 Unchecked, 51.0s Time] [2022-11-22 02:29:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2022-11-22 02:29:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 5971. [2022-11-22 02:29:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5971 states, 5958 states have (on average 2.1391406512252433) internal successors, (12745), 5970 states have internal predecessors, (12745), 0 states have call successors, (0), 0 states 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 02:29:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5971 states to 5971 states and 12745 transitions. [2022-11-22 02:29:01,119 INFO L78 Accepts]: Start accepts. Automaton has 5971 states and 12745 transitions. Word has length 45 [2022-11-22 02:29:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:01,120 INFO L495 AbstractCegarLoop]: Abstraction has 5971 states and 12745 transitions. [2022-11-22 02:29:01,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:29:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 5971 states and 12745 transitions. [2022-11-22 02:29:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:29:01,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:01,122 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:29:01,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-22 02:29:01,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:01,329 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:29:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1351425812, now seen corresponding path program 5 times [2022-11-22 02:29:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:01,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903752087] [2022-11-22 02:29:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:29:02,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:02,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903752087] [2022-11-22 02:29:02,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903752087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:02,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339532360] [2022-11-22 02:29:02,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:29:02,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:02,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:29:02,020 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:29:02,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 02:29:02,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:29:02,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:29:02,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-22 02:29:02,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:29:02,327 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 13 treesize of output 9 [2022-11-22 02:29:02,481 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 02:29:02,546 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:29:02,546 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 19 treesize of output 11 [2022-11-22 02:29:02,615 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 02:29:02,685 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 02:29:02,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:02,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:02,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:02,760 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 43 treesize of output 48 [2022-11-22 02:29:02,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:29:02,811 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 02:29:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:29:02,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:29:03,614 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 21 treesize of output 19 [2022-11-22 02:29:03,618 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 19 treesize of output 12 [2022-11-22 02:29:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:29:03,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339532360] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:03,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:29:03,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 25 [2022-11-22 02:29:03,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339731304] [2022-11-22 02:29:03,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:29:03,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:29:03,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:03,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:29:03,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-11-22 02:29:03,625 INFO L87 Difference]: Start difference. First operand 5971 states and 12745 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:29:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:08,030 INFO L93 Difference]: Finished difference Result 7214 states and 15298 transitions. [2022-11-22 02:29:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:29:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:29:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:08,042 INFO L225 Difference]: With dead ends: 7214 [2022-11-22 02:29:08,042 INFO L226 Difference]: Without dead ends: 7214 [2022-11-22 02:29:08,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:29:08,043 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 89 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:08,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 28 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-22 02:29:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7214 states. [2022-11-22 02:29:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7214 to 6005. [2022-11-22 02:29:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6005 states, 5992 states have (on average 2.1378504672897196) internal successors, (12810), 6004 states have internal predecessors, (12810), 0 states have call successors, (0), 0 states 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 02:29:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 12810 transitions. [2022-11-22 02:29:08,205 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 12810 transitions. Word has length 45 [2022-11-22 02:29:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:08,206 INFO L495 AbstractCegarLoop]: Abstraction has 6005 states and 12810 transitions. [2022-11-22 02:29:08,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:29:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 12810 transitions. [2022-11-22 02:29:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:29:08,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:08,208 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:29:08,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-22 02:29:08,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:08,414 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:29:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1351500212, now seen corresponding path program 6 times [2022-11-22 02:29:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:08,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518487996] [2022-11-22 02:29:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:29:09,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:09,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518487996] [2022-11-22 02:29:09,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518487996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:09,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425628861] [2022-11-22 02:29:09,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:29:09,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:09,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:29:09,137 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:29:09,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 02:29:09,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:29:09,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:29:09,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 02:29:09,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:29:09,981 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 02:29:10,076 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 02:29:10,130 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 02:29:10,198 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 02:29:10,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:10,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:10,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:10,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:10,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:29:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:29:10,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:29:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:29:11,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425628861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:29:11,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1695560618] [2022-11-22 02:29:11,657 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 02:29:11,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:29:11,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:29:11,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631146405] [2022-11-22 02:29:11,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:29:11,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:29:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:11,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:29:11,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:29:11,660 INFO L87 Difference]: Start difference. First operand 6005 states and 12810 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:29:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:29,600 INFO L93 Difference]: Finished difference Result 7944 states and 16122 transitions. [2022-11-22 02:29:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-22 02:29:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:29:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:29,609 INFO L225 Difference]: With dead ends: 7944 [2022-11-22 02:29:29,609 INFO L226 Difference]: Without dead ends: 7944 [2022-11-22 02:29:29,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=593, Invalid=2599, Unknown=0, NotChecked=0, Total=3192 [2022-11-22 02:29:29,610 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 510 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 4513 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 4667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 4513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:29,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 453 Invalid, 4667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 4513 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2022-11-22 02:29:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2022-11-22 02:29:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 6019. [2022-11-22 02:29:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6019 states, 6006 states have (on average 2.1358641358641357) internal successors, (12828), 6018 states have internal predecessors, (12828), 0 states have call successors, (0), 0 states 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 02:29:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6019 states to 6019 states and 12828 transitions. [2022-11-22 02:29:29,756 INFO L78 Accepts]: Start accepts. Automaton has 6019 states and 12828 transitions. Word has length 45 [2022-11-22 02:29:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:29,756 INFO L495 AbstractCegarLoop]: Abstraction has 6019 states and 12828 transitions. [2022-11-22 02:29:29,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:29:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 6019 states and 12828 transitions. [2022-11-22 02:29:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:29:29,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:29,761 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:29:29,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 02:29:29,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:29,969 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:29:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash 362659091, now seen corresponding path program 2 times [2022-11-22 02:29:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:29,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004105364] [2022-11-22 02:29:29,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:29:30,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004105364] [2022-11-22 02:29:30,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004105364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421609928] [2022-11-22 02:29:30,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:29:30,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:30,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:29:30,769 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:29:30,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-22 02:29:30,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:29:30,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:29:30,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-22 02:29:30,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:29:31,016 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 13 treesize of output 9 [2022-11-22 02:29:31,048 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 02:29:31,087 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:29:31,087 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 19 treesize of output 11 [2022-11-22 02:29:31,127 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 19 treesize of output 18 [2022-11-22 02:29:31,148 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 02:29:31,148 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 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 02:29:31,207 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 02:29:31,208 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 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-22 02:29:31,282 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-22 02:29:31,282 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 1 case distinctions, treesize of input 32 treesize of output 31 [2022-11-22 02:29:31,420 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-22 02:29:31,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:29:31,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:31,524 INFO L321 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2022-11-22 02:29:31,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:29:33,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:33,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:33,654 INFO L321 Elim1Store]: treesize reduction 94, result has 16.8 percent of original size [2022-11-22 02:29:33,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 68 [2022-11-22 02:29:35,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:35,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:35,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:35,792 INFO L321 Elim1Store]: treesize reduction 114, result has 14.3 percent of original size [2022-11-22 02:29:35,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 66 treesize of output 80 [2022-11-22 02:29:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:29:37,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:29:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:29:38,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421609928] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:38,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:29:38,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 12] total 30 [2022-11-22 02:29:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759524726] [2022-11-22 02:29:38,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:29:38,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:29:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:38,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:29:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:29:38,501 INFO L87 Difference]: Start difference. First operand 6019 states and 12828 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:29:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:44,950 INFO L93 Difference]: Finished difference Result 10519 states and 22261 transitions. [2022-11-22 02:29:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:29:44,951 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:29:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:44,966 INFO L225 Difference]: With dead ends: 10519 [2022-11-22 02:29:44,966 INFO L226 Difference]: Without dead ends: 10519 [2022-11-22 02:29:44,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=260, Invalid=1380, Unknown=0, NotChecked=0, Total=1640 [2022-11-22 02:29:44,968 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 237 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:44,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 37 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-22 02:29:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10519 states. [2022-11-22 02:29:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10519 to 6118. [2022-11-22 02:29:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6118 states, 6105 states have (on average 2.133660933660934) internal successors, (13026), 6117 states have internal predecessors, (13026), 0 states have call successors, (0), 0 states 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 02:29:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6118 states to 6118 states and 13026 transitions. [2022-11-22 02:29:45,143 INFO L78 Accepts]: Start accepts. Automaton has 6118 states and 13026 transitions. Word has length 45 [2022-11-22 02:29:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:45,145 INFO L495 AbstractCegarLoop]: Abstraction has 6118 states and 13026 transitions. [2022-11-22 02:29:45,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:29:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 6118 states and 13026 transitions. [2022-11-22 02:29:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:29:45,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:45,148 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:29:45,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-22 02:29:45,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:45,355 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:29:45,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 321547511, now seen corresponding path program 3 times [2022-11-22 02:29:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:45,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054687147] [2022-11-22 02:29:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:29:46,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:46,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054687147] [2022-11-22 02:29:46,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054687147] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:46,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652900345] [2022-11-22 02:29:46,246 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:29:46,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:46,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:29:46,249 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:29:46,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-22 02:29:46,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:29:46,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:29:46,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-22 02:29:46,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:29:46,942 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 02:29:47,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,033 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 19 treesize of output 18 [2022-11-22 02:29:47,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,056 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 02:29:47,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,068 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 02:29:47,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,089 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 02:29:47,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:29:47,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:47,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-22 02:29:49,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:49,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:49,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:49,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:49,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:49,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:49,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:49,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:49,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-22 02:29:51,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:51,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 80 [2022-11-22 02:29:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:29:53,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:29:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:29:59,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652900345] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:29:59,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1314475207] [2022-11-22 02:29:59,961 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 02:29:59,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:29:59,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 35 [2022-11-22 02:29:59,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887292132] [2022-11-22 02:29:59,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:29:59,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 02:29:59,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 02:29:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1077, Unknown=1, NotChecked=0, Total=1260 [2022-11-22 02:29:59,964 INFO L87 Difference]: Start difference. First operand 6118 states and 13026 transitions. Second operand has 36 states, 35 states have (on average 2.8857142857142857) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:30:12,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:25,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:27,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:35,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:37,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:39,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:41,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:43,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:45,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:47,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:49,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:51,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:53,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:55,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:57,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:30:59,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:08,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:17,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:19,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:21,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:23,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:25,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:27,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:29,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:31,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:34,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:36,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:38,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:40,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:44,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:46,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:48,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:50,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:56,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:31:58,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:00,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:02,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:04,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:13,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:15,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:17,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:19,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:21,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:23,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:25,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:27,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:29,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:32:31,567 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_242| Int)) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_242|) (forall ((v_ArrVal_2271 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_242| 1) 0) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_242|) 0) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_242|) 0)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_242| v_ArrVal_2271))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (= |c_~#cache~0.base| 1) (< .cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)))) is different from false [2022-11-22 02:32:47,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:49,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:51,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:53,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:55,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:06,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:08,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:10,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:12,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:14,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:16,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:18,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:20,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:22,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:24,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:26,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:28,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:30,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:32,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:34,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:36,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:38,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:42,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:44,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:46,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:48,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:52,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:55,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:57,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:34:32,179 WARN L233 SmtUtils]: Spent 30.38s on a formula simplification. DAG size of input: 85 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:34:34,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:34:40,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:34:42,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:34:44,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:34:47,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:34:51,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:34:53,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:34:55,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:03,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:06,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:17,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:20,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:22,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:24,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:26,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:29,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:31,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:35,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:38,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:40,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:42,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:44,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:46,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:49,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:51,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:53,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:55,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:35:57,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:36:02,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:36:04,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:36:08,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:36:10,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:36:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:36:11,672 INFO L93 Difference]: Finished difference Result 15826 states and 32579 transitions. [2022-11-22 02:36:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-22 02:36:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.8857142857142857) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:36:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:36:11,696 INFO L225 Difference]: With dead ends: 15826 [2022-11-22 02:36:11,696 INFO L226 Difference]: Without dead ends: 15826 [2022-11-22 02:36:11,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2610 ImplicationChecksByTransitivity, 136.6s TimeCoverageRelationStatistics Valid=1508, Invalid=6114, Unknown=38, NotChecked=172, Total=7832 [2022-11-22 02:36:11,699 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 1001 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 5209 mSolverCounterSat, 301 mSolverCounterUnsat, 106 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 245.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 5647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 5209 IncrementalHoareTripleChecker+Invalid, 106 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 247.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:36:11,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 352 Invalid, 5647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 5209 Invalid, 106 Unknown, 31 Unchecked, 247.4s Time] [2022-11-22 02:36:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15826 states. [2022-11-22 02:36:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15826 to 10681. [2022-11-22 02:36:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10681 states, 10668 states have (on average 2.166010498687664) internal successors, (23107), 10680 states have internal predecessors, (23107), 0 states have call successors, (0), 0 states 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 02:36:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10681 states to 10681 states and 23107 transitions. [2022-11-22 02:36:11,986 INFO L78 Accepts]: Start accepts. Automaton has 10681 states and 23107 transitions. Word has length 45 [2022-11-22 02:36:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:36:11,986 INFO L495 AbstractCegarLoop]: Abstraction has 10681 states and 23107 transitions. [2022-11-22 02:36:11,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.8857142857142857) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:36:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10681 states and 23107 transitions. [2022-11-22 02:36:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:36:11,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:36:11,989 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:36:11,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-22 02:36:12,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:36:12,198 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:36:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:36:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash 570530271, now seen corresponding path program 4 times [2022-11-22 02:36:12,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:36:12,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900626755] [2022-11-22 02:36:12,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:36:12,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:36:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:36:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:12,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:36:12,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900626755] [2022-11-22 02:36:12,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900626755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:36:12,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334913176] [2022-11-22 02:36:12,713 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 02:36:12,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:36:12,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:36:12,715 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:36:12,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-22 02:36:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:36:12,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 02:36:12,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:36:13,291 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 02:36:13,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:13,353 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 19 treesize of output 18 [2022-11-22 02:36:13,395 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 02:36:13,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:36:13,435 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 02:36:13,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:36:13,481 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 02:36:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:13,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:36:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:13,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334913176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:36:13,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [613859727] [2022-11-22 02:36:13,768 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 02:36:13,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:36:13,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-11-22 02:36:13,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636166662] [2022-11-22 02:36:13,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:36:13,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 02:36:13,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:36:13,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 02:36:13,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-11-22 02:36:13,771 INFO L87 Difference]: Start difference. First operand 10681 states and 23107 transitions. Second operand has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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 02:36:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:36:24,384 INFO L93 Difference]: Finished difference Result 15709 states and 33037 transitions. [2022-11-22 02:36:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-11-22 02:36:24,385 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:36:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:36:24,406 INFO L225 Difference]: With dead ends: 15709 [2022-11-22 02:36:24,406 INFO L226 Difference]: Without dead ends: 15709 [2022-11-22 02:36:24,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2745 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1539, Invalid=7017, Unknown=0, NotChecked=0, Total=8556 [2022-11-22 02:36:24,409 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 939 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 7715 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 7909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 7715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:36:24,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 269 Invalid, 7909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 7715 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-22 02:36:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15709 states. [2022-11-22 02:36:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15709 to 10688. [2022-11-22 02:36:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10688 states, 10675 states have (on average 2.1659016393442623) internal successors, (23121), 10687 states have internal predecessors, (23121), 0 states have call successors, (0), 0 states 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 02:36:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10688 states to 10688 states and 23121 transitions. [2022-11-22 02:36:24,640 INFO L78 Accepts]: Start accepts. Automaton has 10688 states and 23121 transitions. Word has length 45 [2022-11-22 02:36:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:36:24,640 INFO L495 AbstractCegarLoop]: Abstraction has 10688 states and 23121 transitions. [2022-11-22 02:36:24,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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 02:36:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 10688 states and 23121 transitions. [2022-11-22 02:36:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:36:24,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:36:24,643 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:36:24,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-22 02:36:24,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:36:24,849 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:36:24,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:36:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash -599544395, now seen corresponding path program 1 times [2022-11-22 02:36:24,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:36:24,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162160443] [2022-11-22 02:36:24,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:36:24,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:36:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:36:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:25,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:36:25,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162160443] [2022-11-22 02:36:25,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162160443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:36:25,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494152847] [2022-11-22 02:36:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:36:25,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:36:25,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:36:25,587 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:36:25,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-22 02:36:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:36:25,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-22 02:36:25,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:36:26,331 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 02:36:26,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,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 21 treesize of output 20 [2022-11-22 02:36:26,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,434 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 02:36:26,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,514 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 02:36:26,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:26,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:36:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:26,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:36:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:27,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494152847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:36:27,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1791877885] [2022-11-22 02:36:27,923 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 02:36:27,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:36:27,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:36:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169683976] [2022-11-22 02:36:27,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:36:27,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:36:27,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:36:27,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:36:27,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:36:27,926 INFO L87 Difference]: Start difference. First operand 10688 states and 23121 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:36:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:36:40,274 INFO L93 Difference]: Finished difference Result 15197 states and 32007 transitions. [2022-11-22 02:36:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-22 02:36:40,274 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:36:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:36:40,296 INFO L225 Difference]: With dead ends: 15197 [2022-11-22 02:36:40,296 INFO L226 Difference]: Without dead ends: 15197 [2022-11-22 02:36:40,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=634, Invalid=2788, Unknown=0, NotChecked=0, Total=3422 [2022-11-22 02:36:40,297 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 680 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 3604 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 3707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:36:40,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 294 Invalid, 3707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3604 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-11-22 02:36:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15197 states. [2022-11-22 02:36:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15197 to 10863. [2022-11-22 02:36:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10863 states, 10850 states have (on average 2.1658064516129034) internal successors, (23499), 10862 states have internal predecessors, (23499), 0 states have call successors, (0), 0 states 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 02:36:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10863 states to 10863 states and 23499 transitions. [2022-11-22 02:36:40,507 INFO L78 Accepts]: Start accepts. Automaton has 10863 states and 23499 transitions. Word has length 45 [2022-11-22 02:36:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:36:40,508 INFO L495 AbstractCegarLoop]: Abstraction has 10863 states and 23499 transitions. [2022-11-22 02:36:40,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:36:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 10863 states and 23499 transitions. [2022-11-22 02:36:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:36:40,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:36:40,511 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:36:40,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-22 02:36:40,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-22 02:36:40,717 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:36:40,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:36:40,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1826665313, now seen corresponding path program 5 times [2022-11-22 02:36:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:36:40,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155502685] [2022-11-22 02:36:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:36:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:36:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:36:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:41,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:36:41,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155502685] [2022-11-22 02:36:41,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155502685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:36:41,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725198161] [2022-11-22 02:36:41,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:36:41,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:36:41,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:36:41,285 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:36:41,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-22 02:36:41,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 02:36:41,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:36:41,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-22 02:36:41,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:36:41,915 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 02:36:41,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:41,975 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 19 treesize of output 18 [2022-11-22 02:36:42,006 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 02:36:42,043 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 02:36:42,094 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 02:36:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:42,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:36:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:42,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725198161] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:36:42,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [107790201] [2022-11-22 02:36:42,363 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 02:36:42,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:36:42,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-11-22 02:36:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481198152] [2022-11-22 02:36:42,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:36:42,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 02:36:42,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:36:42,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 02:36:42,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2022-11-22 02:36:42,366 INFO L87 Difference]: Start difference. First operand 10863 states and 23499 transitions. Second operand has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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 02:36:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:36:53,906 INFO L93 Difference]: Finished difference Result 19896 states and 42036 transitions. [2022-11-22 02:36:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-22 02:36:53,907 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:36:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:36:53,932 INFO L225 Difference]: With dead ends: 19896 [2022-11-22 02:36:53,932 INFO L226 Difference]: Without dead ends: 19896 [2022-11-22 02:36:53,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4735 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2404, Invalid=11168, Unknown=0, NotChecked=0, Total=13572 [2022-11-22 02:36:53,934 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 922 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 10766 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 10962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 10766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:36:53,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 277 Invalid, 10962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 10766 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-22 02:36:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19896 states. [2022-11-22 02:36:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19896 to 12323. [2022-11-22 02:36:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12323 states, 12310 states have (on average 2.170024370430544) internal successors, (26713), 12322 states have internal predecessors, (26713), 0 states have call successors, (0), 0 states 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 02:36:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12323 states to 12323 states and 26713 transitions. [2022-11-22 02:36:54,244 INFO L78 Accepts]: Start accepts. Automaton has 12323 states and 26713 transitions. Word has length 45 [2022-11-22 02:36:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:36:54,244 INFO L495 AbstractCegarLoop]: Abstraction has 12323 states and 26713 transitions. [2022-11-22 02:36:54,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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 02:36:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 12323 states and 26713 transitions. [2022-11-22 02:36:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:36:54,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:36:54,249 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:36:54,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-22 02:36:54,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-22 02:36:54,455 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:36:54,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:36:54,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1558617423, now seen corresponding path program 2 times [2022-11-22 02:36:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:36:54,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505214797] [2022-11-22 02:36:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:36:54,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:36:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:36:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:55,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:36:55,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505214797] [2022-11-22 02:36:55,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505214797] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:36:55,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861077907] [2022-11-22 02:36:55,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:36:55,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:36:55,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:36:55,830 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:36:55,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-22 02:36:56,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 02:36:56,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:36:56,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-22 02:36:56,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:36:56,495 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 02:36:56,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,548 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 02:36:56,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,607 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 02:36:56,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,674 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 02:36:56,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:36:56,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:36:56,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:36:56,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:36:56,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:36:56,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:36:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:57,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:36:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:36:59,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861077907] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:36:59,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1112871925] [2022-11-22 02:36:59,082 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 02:36:59,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:36:59,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-11-22 02:36:59,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307720740] [2022-11-22 02:36:59,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:36:59,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 02:36:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:36:59,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 02:36:59,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 02:36:59,084 INFO L87 Difference]: Start difference. First operand 12323 states and 26713 transitions. Second operand has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:37:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:37:05,568 INFO L93 Difference]: Finished difference Result 20525 states and 43344 transitions. [2022-11-22 02:37:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-22 02:37:05,569 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:37:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:37:05,597 INFO L225 Difference]: With dead ends: 20525 [2022-11-22 02:37:05,597 INFO L226 Difference]: Without dead ends: 20525 [2022-11-22 02:37:05,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=714, Invalid=3068, Unknown=0, NotChecked=0, Total=3782 [2022-11-22 02:37:05,598 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 899 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 4371 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 4558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 4371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:37:05,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 365 Invalid, 4558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 4371 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-22 02:37:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20525 states. [2022-11-22 02:37:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20525 to 12923. [2022-11-22 02:37:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12923 states, 12910 states have (on average 2.167389620449264) internal successors, (27981), 12922 states have internal predecessors, (27981), 0 states have call successors, (0), 0 states 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 02:37:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12923 states to 12923 states and 27981 transitions. [2022-11-22 02:37:05,923 INFO L78 Accepts]: Start accepts. Automaton has 12923 states and 27981 transitions. Word has length 45 [2022-11-22 02:37:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:37:05,923 INFO L495 AbstractCegarLoop]: Abstraction has 12923 states and 27981 transitions. [2022-11-22 02:37:05,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:37:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 12923 states and 27981 transitions. [2022-11-22 02:37:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:37:05,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:37:05,926 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:37:05,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-22 02:37:06,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:37:06,132 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:37:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:37:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1298227317, now seen corresponding path program 2 times [2022-11-22 02:37:06,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:37:06,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393353321] [2022-11-22 02:37:06,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:37:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:37:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:37:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:37:06,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:37:06,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393353321] [2022-11-22 02:37:06,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393353321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:37:06,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876249177] [2022-11-22 02:37:06,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:37:06,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:37:06,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:37:06,880 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:37:06,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-22 02:37:07,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 02:37:07,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:37:07,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-22 02:37:07,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:37:07,634 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 02:37:07,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,680 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 02:37:07,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:37:07,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,818 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 02:37:07,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:07,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:37:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:37:07,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:37:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:37:09,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876249177] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:37:09,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1572048872] [2022-11-22 02:37:09,019 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 02:37:09,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:37:09,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:37:09,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509789631] [2022-11-22 02:37:09,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:37:09,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:37:09,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:37:09,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:37:09,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:37:09,021 INFO L87 Difference]: Start difference. First operand 12923 states and 27981 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:37:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:37:17,011 INFO L93 Difference]: Finished difference Result 20110 states and 42478 transitions. [2022-11-22 02:37:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-22 02:37:17,012 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:37:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:37:17,040 INFO L225 Difference]: With dead ends: 20110 [2022-11-22 02:37:17,041 INFO L226 Difference]: Without dead ends: 20110 [2022-11-22 02:37:17,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=706, Invalid=2954, Unknown=0, NotChecked=0, Total=3660 [2022-11-22 02:37:17,041 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 950 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 4382 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 4551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 4382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:37:17,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 342 Invalid, 4551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 4382 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-11-22 02:37:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20110 states. [2022-11-22 02:37:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20110 to 13163. [2022-11-22 02:37:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13150 states have (on average 2.1714828897338405) internal successors, (28555), 13162 states have internal predecessors, (28555), 0 states have call successors, (0), 0 states 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 02:37:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 28555 transitions. [2022-11-22 02:37:17,311 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 28555 transitions. Word has length 45 [2022-11-22 02:37:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:37:17,311 INFO L495 AbstractCegarLoop]: Abstraction has 13163 states and 28555 transitions. [2022-11-22 02:37:17,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:37:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 28555 transitions. [2022-11-22 02:37:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:37:17,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:37:17,314 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:37:17,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-22 02:37:17,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-22 02:37:17,514 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:37:17,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:37:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash 262387802, now seen corresponding path program 7 times [2022-11-22 02:37:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:37:17,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258371247] [2022-11-22 02:37:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:37:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:37:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:37:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:37:18,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:37:18,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258371247] [2022-11-22 02:37:18,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258371247] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:37:18,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915617161] [2022-11-22 02:37:18,282 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 02:37:18,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:37:18,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:37:18,283 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:37:18,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-22 02:37:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:37:18,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 02:37:18,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:37:18,838 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 02:37:18,879 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 02:37:18,929 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 02:37:18,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:18,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:18,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:18,989 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 37 treesize of output 42 [2022-11-22 02:37:19,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:37:19,033 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 02:37:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:37:19,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:37:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:37:19,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915617161] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:37:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1186737647] [2022-11-22 02:37:19,814 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 02:37:19,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:37:19,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-22 02:37:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301417805] [2022-11-22 02:37:19,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:37:19,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:37:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:37:19,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:37:19,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:37:19,816 INFO L87 Difference]: Start difference. First operand 13163 states and 28555 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:37:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:37:28,300 INFO L93 Difference]: Finished difference Result 19829 states and 41782 transitions. [2022-11-22 02:37:28,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-22 02:37:28,300 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:37:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:37:28,331 INFO L225 Difference]: With dead ends: 19829 [2022-11-22 02:37:28,332 INFO L226 Difference]: Without dead ends: 19829 [2022-11-22 02:37:28,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1935 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1257, Invalid=5063, Unknown=0, NotChecked=0, Total=6320 [2022-11-22 02:37:28,333 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 991 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 5784 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 5995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 5784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:37:28,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 362 Invalid, 5995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 5784 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-22 02:37:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19829 states. [2022-11-22 02:37:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19829 to 14116. [2022-11-22 02:37:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14116 states, 14103 states have (on average 2.1608877543785012) internal successors, (30475), 14115 states have internal predecessors, (30475), 0 states have call successors, (0), 0 states 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 02:37:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14116 states to 14116 states and 30475 transitions. [2022-11-22 02:37:28,603 INFO L78 Accepts]: Start accepts. Automaton has 14116 states and 30475 transitions. Word has length 45 [2022-11-22 02:37:28,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:37:28,603 INFO L495 AbstractCegarLoop]: Abstraction has 14116 states and 30475 transitions. [2022-11-22 02:37:28,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:37:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14116 states and 30475 transitions. [2022-11-22 02:37:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:37:28,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:37:28,604 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:37:28,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-22 02:37:28,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-22 02:37:28,805 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:37:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:37:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash 281017301, now seen corresponding path program 3 times [2022-11-22 02:37:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:37:28,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892848715] [2022-11-22 02:37:28,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:37:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:37:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:37:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:37:30,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:37:30,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892848715] [2022-11-22 02:37:30,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892848715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:37:30,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916489304] [2022-11-22 02:37:30,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:37:30,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:37:30,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:37:30,216 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:37:30,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-22 02:37:30,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:37:30,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:37:30,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-22 02:37:30,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:37:30,967 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 02:37:31,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,069 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 02:37:31,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,125 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 02:37:31,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,193 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 02:37:31,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:37:31,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:37:31,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:37:31,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:37:31,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:37:31,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-22 02:37:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:37:35,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:37:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:37:40,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916489304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:37:40,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [400246322] [2022-11-22 02:37:40,059 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 02:37:40,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:37:40,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2022-11-22 02:37:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819758641] [2022-11-22 02:37:40,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:37:40,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 02:37:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:37:40,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 02:37:40,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1070, Unknown=1, NotChecked=0, Total=1260 [2022-11-22 02:37:40,061 INFO L87 Difference]: Start difference. First operand 14116 states and 30475 transitions. Second operand has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:37:50,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:37:54,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:37:56,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:37:58,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:38:00,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:38:03,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:38:05,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:38:08,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:38:10,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:38:13,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:38:16,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:38:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:25,557 INFO L93 Difference]: Finished difference Result 20696 states and 43493 transitions. [2022-11-22 02:38:25,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-22 02:38:25,558 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:38:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:25,585 INFO L225 Difference]: With dead ends: 20696 [2022-11-22 02:38:25,585 INFO L226 Difference]: Without dead ends: 20696 [2022-11-22 02:38:25,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=712, Invalid=3067, Unknown=3, NotChecked=0, Total=3782 [2022-11-22 02:38:25,586 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 802 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 3848 mSolverCounterSat, 293 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 4152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 3848 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:25,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 395 Invalid, 4152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 3848 Invalid, 11 Unknown, 0 Unchecked, 39.4s Time] [2022-11-22 02:38:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20696 states. [2022-11-22 02:38:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20696 to 14007. [2022-11-22 02:38:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14007 states, 13994 states have (on average 2.162069458339288) internal successors, (30256), 14006 states have internal predecessors, (30256), 0 states have call successors, (0), 0 states 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 02:38:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14007 states to 14007 states and 30256 transitions. [2022-11-22 02:38:25,875 INFO L78 Accepts]: Start accepts. Automaton has 14007 states and 30256 transitions. Word has length 45 [2022-11-22 02:38:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:25,875 INFO L495 AbstractCegarLoop]: Abstraction has 14007 states and 30256 transitions. [2022-11-22 02:38:25,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:38:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 14007 states and 30256 transitions. [2022-11-22 02:38:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:38:25,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:25,877 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:25,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-22 02:38:26,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:38:26,077 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:38:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash -370816783, now seen corresponding path program 4 times [2022-11-22 02:38:26,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:26,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856941530] [2022-11-22 02:38:26,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:26,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:38:27,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:27,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856941530] [2022-11-22 02:38:27,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856941530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:38:27,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333364494] [2022-11-22 02:38:27,041 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 02:38:27,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:38:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:38:27,043 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:38:27,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-22 02:38:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:27,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-22 02:38:27,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:38:27,603 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 02:38:27,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,650 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 02:38:27,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,716 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 02:38:27,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,789 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 02:38:27,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:38:27,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:27,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:38:28,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:38:28,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:38:28,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:28,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:38:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:38:28,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:38:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:38:55,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333364494] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:38:55,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2083482150] [2022-11-22 02:38:55,634 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 02:38:55,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:38:55,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-11-22 02:38:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562631207] [2022-11-22 02:38:55,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:38:55,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 02:38:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:55,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 02:38:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=870, Unknown=5, NotChecked=0, Total=1056 [2022-11-22 02:38:55,636 INFO L87 Difference]: Start difference. First operand 14007 states and 30256 transitions. Second operand has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:15,882 INFO L93 Difference]: Finished difference Result 19188 states and 40369 transitions. [2022-11-22 02:39:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-22 02:39:15,882 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:39:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:15,909 INFO L225 Difference]: With dead ends: 19188 [2022-11-22 02:39:15,909 INFO L226 Difference]: Without dead ends: 19188 [2022-11-22 02:39:15,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=602, Invalid=2473, Unknown=5, NotChecked=0, Total=3080 [2022-11-22 02:39:15,909 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 743 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 3931 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 4116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 3931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:15,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 396 Invalid, 4116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 3931 Invalid, 0 Unknown, 0 Unchecked, 18.7s Time] [2022-11-22 02:39:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19188 states. [2022-11-22 02:39:16,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19188 to 14031. [2022-11-22 02:39:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14031 states, 14018 states have (on average 2.162862034527037) internal successors, (30319), 14030 states have internal predecessors, (30319), 0 states have call successors, (0), 0 states 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 02:39:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14031 states to 14031 states and 30319 transitions. [2022-11-22 02:39:16,130 INFO L78 Accepts]: Start accepts. Automaton has 14031 states and 30319 transitions. Word has length 45 [2022-11-22 02:39:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:16,131 INFO L495 AbstractCegarLoop]: Abstraction has 14031 states and 30319 transitions. [2022-11-22 02:39:16,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 14031 states and 30319 transitions. [2022-11-22 02:39:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:39:16,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:16,133 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:16,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:16,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:16,333 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:39:16,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash -376762087, now seen corresponding path program 3 times [2022-11-22 02:39:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:16,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338627831] [2022-11-22 02:39:16,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:16,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:39:16,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:16,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338627831] [2022-11-22 02:39:16,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338627831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:16,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301999301] [2022-11-22 02:39:16,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:39:16,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:16,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:16,881 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:16,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-22 02:39:17,327 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:39:17,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:39:17,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-22 02:39:17,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:17,338 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 7 treesize of output 6 [2022-11-22 02:39:17,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:17,439 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 13 treesize of output 15 [2022-11-22 02:39:17,786 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 32 treesize of output 25 [2022-11-22 02:39:17,974 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-22 02:39:18,135 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 02:39:18,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,264 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 02:39:18,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,327 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 02:39:18,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,403 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 02:39:18,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:18,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:39:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:39:18,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:39:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:39:22,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301999301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:39:22,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1900284868] [2022-11-22 02:39:22,223 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 02:39:22,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:39:22,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 11] total 38 [2022-11-22 02:39:22,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494120796] [2022-11-22 02:39:22,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:39:22,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-22 02:39:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:22,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-22 02:39:22,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1285, Unknown=1, NotChecked=0, Total=1482 [2022-11-22 02:39:22,224 INFO L87 Difference]: Start difference. First operand 14031 states and 30319 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:34,732 INFO L93 Difference]: Finished difference Result 19022 states and 40004 transitions. [2022-11-22 02:39:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-22 02:39:34,733 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:39:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:34,758 INFO L225 Difference]: With dead ends: 19022 [2022-11-22 02:39:34,759 INFO L226 Difference]: Without dead ends: 19022 [2022-11-22 02:39:34,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1050, Invalid=5429, Unknown=1, NotChecked=0, Total=6480 [2022-11-22 02:39:34,760 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 895 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 5218 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 5569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 5218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:34,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 721 Invalid, 5569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 5218 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-11-22 02:39:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19022 states. [2022-11-22 02:39:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19022 to 13994. [2022-11-22 02:39:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13994 states, 13981 states have (on average 2.163221514913096) internal successors, (30244), 13993 states have internal predecessors, (30244), 0 states have call successors, (0), 0 states 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 02:39:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13994 states to 13994 states and 30244 transitions. [2022-11-22 02:39:34,994 INFO L78 Accepts]: Start accepts. Automaton has 13994 states and 30244 transitions. Word has length 45 [2022-11-22 02:39:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:34,995 INFO L495 AbstractCegarLoop]: Abstraction has 13994 states and 30244 transitions. [2022-11-22 02:39:34,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 13994 states and 30244 transitions. [2022-11-22 02:39:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:39:34,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:34,996 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:35,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:35,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-22 02:39:35,203 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:39:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash 927288565, now seen corresponding path program 4 times [2022-11-22 02:39:35,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:35,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27579271] [2022-11-22 02:39:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:35,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:39:35,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:35,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27579271] [2022-11-22 02:39:35,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27579271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:35,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70021720] [2022-11-22 02:39:35,749 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 02:39:35,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:35,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:35,750 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:35,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-22 02:39:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:36,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-22 02:39:36,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:36,431 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 02:39:36,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,477 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 02:39:36,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,532 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 02:39:36,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,603 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 02:39:36,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:39:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:39:36,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:39:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:39:51,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70021720] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:39:51,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [448754668] [2022-11-22 02:39:51,435 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 02:39:51,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:39:51,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:39:51,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521271995] [2022-11-22 02:39:51,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:39:51,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:39:51,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:51,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:39:51,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=813, Unknown=7, NotChecked=0, Total=992 [2022-11-22 02:39:51,437 INFO L87 Difference]: Start difference. First operand 13994 states and 30244 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:57,313 INFO L93 Difference]: Finished difference Result 17841 states and 37639 transitions. [2022-11-22 02:39:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-22 02:39:57,315 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:39:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:57,341 INFO L225 Difference]: With dead ends: 17841 [2022-11-22 02:39:57,342 INFO L226 Difference]: Without dead ends: 17841 [2022-11-22 02:39:57,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=609, Invalid=2464, Unknown=7, NotChecked=0, Total=3080 [2022-11-22 02:39:57,343 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 812 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:57,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 296 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-22 02:39:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17841 states. [2022-11-22 02:39:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17841 to 14005. [2022-11-22 02:39:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14005 states, 13992 states have (on average 2.1638793596340764) internal successors, (30277), 14004 states have internal predecessors, (30277), 0 states have call successors, (0), 0 states 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 02:39:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14005 states to 14005 states and 30277 transitions. [2022-11-22 02:39:57,625 INFO L78 Accepts]: Start accepts. Automaton has 14005 states and 30277 transitions. Word has length 45 [2022-11-22 02:39:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:57,626 INFO L495 AbstractCegarLoop]: Abstraction has 14005 states and 30277 transitions. [2022-11-22 02:39:57,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 14005 states and 30277 transitions. [2022-11-22 02:39:57,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:39:57,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:57,628 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:57,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:57,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:57,834 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:39:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1031854975, now seen corresponding path program 5 times [2022-11-22 02:39:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:57,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178227095] [2022-11-22 02:39:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:57,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:39:58,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:58,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178227095] [2022-11-22 02:39:58,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178227095] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:58,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948873852] [2022-11-22 02:39:58,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:39:58,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:58,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:58,348 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:58,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-22 02:39:58,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 02:39:58,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:39:58,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-22 02:39:58,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:58,979 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 02:39:59,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,029 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 02:39:59,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,093 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 02:39:59,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,225 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 02:39:59,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:59,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:39:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:39:59,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:40:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:40:09,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948873852] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:40:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [413485622] [2022-11-22 02:40:09,893 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 02:40:09,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:40:09,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:40:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563651675] [2022-11-22 02:40:09,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:40:09,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:40:09,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:40:09,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:40:09,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=836, Unknown=3, NotChecked=0, Total=992 [2022-11-22 02:40:09,895 INFO L87 Difference]: Start difference. First operand 14005 states and 30277 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:40:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:40:19,325 INFO L93 Difference]: Finished difference Result 17935 states and 37820 transitions. [2022-11-22 02:40:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-22 02:40:19,325 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-22 02:40:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:40:19,351 INFO L225 Difference]: With dead ends: 17935 [2022-11-22 02:40:19,351 INFO L226 Difference]: Without dead ends: 17935 [2022-11-22 02:40:19,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=649, Invalid=2654, Unknown=3, NotChecked=0, Total=3306 [2022-11-22 02:40:19,352 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 654 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 3825 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 3825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:40:19,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 390 Invalid, 3973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 3825 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-11-22 02:40:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17935 states. [2022-11-22 02:40:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17935 to 13989. [2022-11-22 02:40:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13989 states, 13976 states have (on average 2.1635661133371493) internal successors, (30238), 13988 states have internal predecessors, (30238), 0 states have call successors, (0), 0 states 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 02:40:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13989 states to 13989 states and 30238 transitions. [2022-11-22 02:40:19,616 INFO L78 Accepts]: Start accepts. Automaton has 13989 states and 30238 transitions. Word has length 45 [2022-11-22 02:40:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:40:19,617 INFO L495 AbstractCegarLoop]: Abstraction has 13989 states and 30238 transitions. [2022-11-22 02:40:19,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:40:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 13989 states and 30238 transitions. [2022-11-22 02:40:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:40:19,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:40:19,619 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:40:19,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-22 02:40:19,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:40:19,825 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:40:19,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:40:19,825 INFO L85 PathProgramCache]: Analyzing trace with hash 869639349, now seen corresponding path program 6 times [2022-11-22 02:40:19,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:40:19,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098011717] [2022-11-22 02:40:19,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:19,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:40:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:40:20,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:40:20,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098011717] [2022-11-22 02:40:20,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098011717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:40:20,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878338343] [2022-11-22 02:40:20,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:40:20,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:40:20,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:40:20,367 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:40:20,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b560241c-3d6f-49db-b5ed-37ee7086c330/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-22 02:40:20,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:40:20,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:40:20,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 02:40:20,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:40:21,141 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 02:40:21,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,189 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 02:40:21,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,307 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 02:40:21,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,372 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 02:40:21,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:21,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:40:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:40:21,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:40:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:40:23,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878338343] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:40:23,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [311854560] [2022-11-22 02:40:23,936 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 02:40:23,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:40:23,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:40:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455934732] [2022-11-22 02:40:23,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:40:23,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:40:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:40:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:40:23,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:40:23,938 INFO L87 Difference]: Start difference. First operand 13989 states and 30238 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)