./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh --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 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 --- 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-2329fc7 [2022-12-14 14:02:26,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:02:26,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:02:26,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:02:26,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:02:26,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:02:26,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:02:26,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:02:26,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:02:26,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:02:26,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:02:26,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:02:26,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:02:26,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:02:26,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:02:26,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:02:26,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:02:26,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:02:26,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:02:26,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:02:26,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:02:26,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:02:26,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:02:26,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:02:26,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:02:26,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:02:26,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:02:26,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:02:26,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:02:26,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:02:26,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:02:26,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:02:26,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:02:26,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:02:26,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:02:26,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:02:26,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:02:26,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:02:26,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:02:26,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:02:26,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:02:26,323 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-12-14 14:02:26,338 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:02:26,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:02:26,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:02:26,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:02:26,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:02:26,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:02:26,339 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:02:26,339 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:02:26,339 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:02:26,340 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:02:26,340 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:02:26,340 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:02:26,340 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:02:26,340 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:02:26,340 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:02:26,340 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:02:26,340 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:02:26,340 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:02:26,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:02:26,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:02:26,341 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:02:26,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:02:26,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:02:26,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:02:26,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 14:02:26,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:02:26,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 14:02:26,342 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-14 14:02:26,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:02:26,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 14:02:26,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:02:26,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 14:02:26,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:02:26,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:02:26,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:02:26,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:02:26,343 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:02:26,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:02:26,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 14:02:26,343 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:02:26,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:02:26,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 14:02:26,344 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:02:26,344 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_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/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_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh 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 -> 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 [2022-12-14 14:02:26,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:02:26,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:02:26,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:02:26,525 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:02:26,525 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:02:26,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-12-14 14:02:29,178 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:02:29,345 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:02:29,345 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-12-14 14:02:29,355 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/data/32fbfc37a/eb455d2e328b425884aeff4b61c2afd8/FLAGee1b3171c [2022-12-14 14:02:29,365 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/data/32fbfc37a/eb455d2e328b425884aeff4b61c2afd8 [2022-12-14 14:02:29,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:02:29,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:02:29,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:02:29,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:02:29,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:02:29,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69559c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29, skipping insertion in model container [2022-12-14 14:02:29,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:02:29,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:02:29,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:02:29,680 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:02:29,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:02:29,740 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:02:29,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29 WrapperNode [2022-12-14 14:02:29,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:02:29,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:02:29,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:02:29,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:02:29,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,775 INFO L138 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-12-14 14:02:29,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:02:29,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:02:29,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:02:29,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:02:29,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,797 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:02:29,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:02:29,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:02:29,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:02:29,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (1/1) ... [2022-12-14 14:02:29,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:02:29,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:29,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:02:29,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:02:29,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 14:02:29,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:02:29,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 14:02:29,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 14:02:29,858 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 14:02:29,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:02:29,858 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-14 14:02:29,858 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-14 14:02:29,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:02:29,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:02:29,859 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 14:02:29,957 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:02:29,959 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:02:30,164 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:02:30,172 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:02:30,172 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 14:02:30,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:02:30 BoogieIcfgContainer [2022-12-14 14:02:30,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:02:30,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:02:30,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:02:30,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:02:30,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:02:29" (1/3) ... [2022-12-14 14:02:30,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b033d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:02:30, skipping insertion in model container [2022-12-14 14:02:30,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:29" (2/3) ... [2022-12-14 14:02:30,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b033d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:02:30, skipping insertion in model container [2022-12-14 14:02:30,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:02:30" (3/3) ... [2022-12-14 14:02:30,184 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-12-14 14:02:30,193 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 14:02:30,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:02:30,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-14 14:02:30,201 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 14:02:30,259 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 14:02:30,292 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 14:02:30,305 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 125 transitions, 255 flow [2022-12-14 14:02:30,307 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 125 transitions, 255 flow [2022-12-14 14:02:30,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 125 transitions, 255 flow [2022-12-14 14:02:30,348 INFO L130 PetriNetUnfolder]: 6/124 cut-off events. [2022-12-14 14:02:30,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 14:02:30,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 124 events. 6/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 216 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-12-14 14:02:30,356 INFO L119 LiptonReduction]: Number of co-enabled transitions 4636 [2022-12-14 14:02:31,986 INFO L134 LiptonReduction]: Checked pairs total: 13675 [2022-12-14 14:02:31,987 INFO L136 LiptonReduction]: Total number of compositions: 74 [2022-12-14 14:02:31,993 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 54 transitions, 113 flow [2022-12-14 14:02:32,031 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:32,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:02:32,049 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;@60abadf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:02:32,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-12-14 14:02:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:02:32,056 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:32,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:32,057 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-12-14 14:02:32,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash 232495955, now seen corresponding path program 1 times [2022-12-14 14:02:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:32,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922298331] [2022-12-14 14:02:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:32,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:32,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922298331] [2022-12-14 14:02:32,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922298331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:32,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:32,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:02:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158059571] [2022-12-14 14:02:32,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:32,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:02:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:02:32,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:02:32,255 INFO L87 Difference]: Start difference. First operand has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 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.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:32,317 INFO L93 Difference]: Finished difference Result 561 states and 1119 transitions. [2022-12-14 14:02:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:02:32,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-14 14:02:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:32,328 INFO L225 Difference]: With dead ends: 561 [2022-12-14 14:02:32,328 INFO L226 Difference]: Without dead ends: 561 [2022-12-14 14:02:32,329 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-12-14 14:02:32,331 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:32,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-12-14 14:02:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2022-12-14 14:02:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 547 states have (on average 2.045703839122486) internal successors, (1119), 560 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1119 transitions. [2022-12-14 14:02:32,378 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1119 transitions. Word has length 10 [2022-12-14 14:02:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:32,378 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 1119 transitions. [2022-12-14 14:02:32,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1119 transitions. [2022-12-14 14:02:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:02:32,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:32,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:32,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:02:32,380 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-12-14 14:02:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash 387942118, now seen corresponding path program 1 times [2022-12-14 14:02:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:32,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937508811] [2022-12-14 14:02:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:32,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:32,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937508811] [2022-12-14 14:02:32,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937508811] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:32,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372261128] [2022-12-14 14:02:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:32,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:32,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:32,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:32,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:02:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:32,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 14:02:32,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:02:32,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:02:32,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372261128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:32,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:02:32,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-14 14:02:32,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849055132] [2022-12-14 14:02:32,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:32,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:02:32,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:02:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:02:32,523 INFO L87 Difference]: Start difference. First operand 561 states and 1119 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-14 14:02:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:32,576 INFO L93 Difference]: Finished difference Result 849 states and 1695 transitions. [2022-12-14 14:02:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:02:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-14 14:02:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:32,581 INFO L225 Difference]: With dead ends: 849 [2022-12-14 14:02:32,581 INFO L226 Difference]: Without dead ends: 849 [2022-12-14 14:02:32,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-12-14 14:02:32,583 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:32,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-12-14 14:02:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 579. [2022-12-14 14:02:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 565 states have (on average 2.0442477876106193) internal successors, (1155), 578 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1155 transitions. [2022-12-14 14:02:32,612 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1155 transitions. Word has length 11 [2022-12-14 14:02:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:32,613 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 1155 transitions. [2022-12-14 14:02:32,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-14 14:02:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1155 transitions. [2022-12-14 14:02:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:02:32,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:32,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:32,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:02:32,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:32,816 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-12-14 14:02:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1420369515, now seen corresponding path program 1 times [2022-12-14 14:02:32,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:32,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435187165] [2022-12-14 14:02:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:32,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:32,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435187165] [2022-12-14 14:02:32,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435187165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:32,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178116388] [2022-12-14 14:02:32,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:32,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:32,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:32,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:32,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:02:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:33,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 14:02:33,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:33,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:02:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:33,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178116388] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:02:33,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1096806929] [2022-12-14 14:02:33,084 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:337) 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-12-14 14:02:33,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:02:33,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-14 14:02:33,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286550001] [2022-12-14 14:02:33,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:02:33,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 14:02:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:33,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 14:02:33,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:02:33,087 INFO L87 Difference]: Start difference. First operand 579 states and 1155 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-12-14 14:02:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:33,137 INFO L93 Difference]: Finished difference Result 582 states and 1158 transitions. [2022-12-14 14:02:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:02:33,137 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-12-14 14:02:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:33,140 INFO L225 Difference]: With dead ends: 582 [2022-12-14 14:02:33,140 INFO L226 Difference]: Without dead ends: 582 [2022-12-14 14:02:33,140 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-12-14 14:02:33,141 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:33,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-12-14 14:02:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2022-12-14 14:02:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 568 states have (on average 2.038732394366197) internal successors, (1158), 581 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1158 transitions. [2022-12-14 14:02:33,163 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1158 transitions. Word has length 12 [2022-12-14 14:02:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:33,163 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1158 transitions. [2022-12-14 14:02:33,163 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-12-14 14:02:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1158 transitions. [2022-12-14 14:02:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 14:02:33,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:33,164 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:33,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 14:02:33,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:33,365 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-12-14 14:02:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:33,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1370433032, now seen corresponding path program 2 times [2022-12-14 14:02:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:33,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521623565] [2022-12-14 14:02:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:33,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:33,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521623565] [2022-12-14 14:02:33,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521623565] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:33,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194518936] [2022-12-14 14:02:33,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:02:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:33,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:33,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:02:33,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:02:33,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:02:33,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 14:02:33,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:33,542 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-12-14 14:02:33,555 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-12-14 14:02:33,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:02:33,575 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-12-14 14:02:33,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:02:33,600 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-12-14 14:02:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 14:02:33,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:02:33,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194518936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:33,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:02:33,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2022-12-14 14:02:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595586359] [2022-12-14 14:02:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:33,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:02:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:33,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:02:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 14:02:33,622 INFO L87 Difference]: Start difference. First operand 582 states and 1158 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-12-14 14:02:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:33,842 INFO L93 Difference]: Finished difference Result 683 states and 1360 transitions. [2022-12-14 14:02:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:02:33,842 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-12-14 14:02:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:33,847 INFO L225 Difference]: With dead ends: 683 [2022-12-14 14:02:33,847 INFO L226 Difference]: Without dead ends: 683 [2022-12-14 14:02:33,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 14:02:33,848 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:33,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 28 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:02:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-12-14 14:02:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 649. [2022-12-14 14:02:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 635 states have (on average 2.0346456692913386) internal successors, (1292), 648 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1292 transitions. [2022-12-14 14:02:33,859 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1292 transitions. Word has length 15 [2022-12-14 14:02:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:33,860 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1292 transitions. [2022-12-14 14:02:33,860 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-12-14 14:02:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1292 transitions. [2022-12-14 14:02:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 14:02:33,860 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:33,860 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:33,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:02:34,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-14 14:02:34,063 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-12-14 14:02:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash 695091170, now seen corresponding path program 1 times [2022-12-14 14:02:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:34,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088963979] [2022-12-14 14:02:34,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:34,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:34,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:34,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088963979] [2022-12-14 14:02:34,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088963979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:34,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964904172] [2022-12-14 14:02:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:34,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:34,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:34,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:02:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:34,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 14:02:34,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:34,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:02:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:34,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964904172] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:02:34,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1536766375] [2022-12-14 14:02:34,354 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:337) 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-12-14 14:02:34,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:02:34,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-14 14:02:34,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782078897] [2022-12-14 14:02:34,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:02:34,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:02:34,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:34,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:02:34,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:02:34,356 INFO L87 Difference]: Start difference. First operand 649 states and 1292 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-12-14 14:02:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:34,404 INFO L93 Difference]: Finished difference Result 655 states and 1298 transitions. [2022-12-14 14:02:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:02:34,404 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-12-14 14:02:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:34,407 INFO L225 Difference]: With dead ends: 655 [2022-12-14 14:02:34,407 INFO L226 Difference]: Without dead ends: 655 [2022-12-14 14:02:34,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:02:34,408 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:34,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-12-14 14:02:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2022-12-14 14:02:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 641 states have (on average 2.0249609984399375) internal successors, (1298), 654 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1298 transitions. [2022-12-14 14:02:34,426 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1298 transitions. Word has length 15 [2022-12-14 14:02:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:34,426 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1298 transitions. [2022-12-14 14:02:34,427 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-12-14 14:02:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1298 transitions. [2022-12-14 14:02:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:02:34,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:34,428 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:34,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 14:02:34,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:34,629 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-12-14 14:02:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1387635906, now seen corresponding path program 2 times [2022-12-14 14:02:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:34,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181474007] [2022-12-14 14:02:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:34,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:34,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181474007] [2022-12-14 14:02:34,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181474007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:34,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:34,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:02:34,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890482822] [2022-12-14 14:02:34,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:34,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:02:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:34,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:02:34,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:02:34,887 INFO L87 Difference]: Start difference. First operand 655 states and 1298 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-12-14 14:02:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:35,284 INFO L93 Difference]: Finished difference Result 822 states and 1632 transitions. [2022-12-14 14:02:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:02:35,285 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-12-14 14:02:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:35,287 INFO L225 Difference]: With dead ends: 822 [2022-12-14 14:02:35,287 INFO L226 Difference]: Without dead ends: 822 [2022-12-14 14:02:35,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-14 14:02:35,288 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:35,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 39 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:02:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-12-14 14:02:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 764. [2022-12-14 14:02:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 751 states have (on average 2.018641810918775) internal successors, (1516), 763 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1516 transitions. [2022-12-14 14:02:35,301 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1516 transitions. Word has length 21 [2022-12-14 14:02:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:35,301 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 1516 transitions. [2022-12-14 14:02:35,301 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-12-14 14:02:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1516 transitions. [2022-12-14 14:02:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:02:35,302 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:35,302 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:35,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:02:35,303 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-12-14 14:02:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1601138714, now seen corresponding path program 1 times [2022-12-14 14:02:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:35,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369495793] [2022-12-14 14:02:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:35,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:35,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:35,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369495793] [2022-12-14 14:02:35,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369495793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:35,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:35,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:02:35,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832279836] [2022-12-14 14:02:35,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:35,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:02:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:35,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:02:35,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:02:35,570 INFO L87 Difference]: Start difference. First operand 764 states and 1516 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-12-14 14:02:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:35,749 INFO L93 Difference]: Finished difference Result 850 states and 1688 transitions. [2022-12-14 14:02:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:02:35,750 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-12-14 14:02:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:35,752 INFO L225 Difference]: With dead ends: 850 [2022-12-14 14:02:35,752 INFO L226 Difference]: Without dead ends: 850 [2022-12-14 14:02:35,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-14 14:02:35,753 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:35,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 27 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:02:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-12-14 14:02:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 830. [2022-12-14 14:02:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 817 states have (on average 2.0171358629130967) internal successors, (1648), 829 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1648 transitions. [2022-12-14 14:02:35,766 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1648 transitions. Word has length 27 [2022-12-14 14:02:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:35,766 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1648 transitions. [2022-12-14 14:02:35,767 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-12-14 14:02:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1648 transitions. [2022-12-14 14:02:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:02:35,767 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:35,767 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:35,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:02:35,768 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-12-14 14:02:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash 201295290, now seen corresponding path program 1 times [2022-12-14 14:02:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:35,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502810019] [2022-12-14 14:02:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:35,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:35,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502810019] [2022-12-14 14:02:35,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502810019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:35,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:35,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:02:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211221858] [2022-12-14 14:02:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:35,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:02:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:02:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:02:35,973 INFO L87 Difference]: Start difference. First operand 830 states and 1648 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-12-14 14:02:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:36,296 INFO L93 Difference]: Finished difference Result 982 states and 1952 transitions. [2022-12-14 14:02:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:02:36,297 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-12-14 14:02:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:36,300 INFO L225 Difference]: With dead ends: 982 [2022-12-14 14:02:36,300 INFO L226 Difference]: Without dead ends: 966 [2022-12-14 14:02:36,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-14 14:02:36,301 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:36,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 36 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:02:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-12-14 14:02:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 931. [2022-12-14 14:02:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 918 states have (on average 2.0130718954248366) internal successors, (1848), 930 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1848 transitions. [2022-12-14 14:02:36,324 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1848 transitions. Word has length 27 [2022-12-14 14:02:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:36,325 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1848 transitions. [2022-12-14 14:02:36,325 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-12-14 14:02:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1848 transitions. [2022-12-14 14:02:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:02:36,326 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:36,326 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-12-14 14:02:36,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:02:36,326 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:02:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash 164888780, now seen corresponding path program 1 times [2022-12-14 14:02:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:36,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20554473] [2022-12-14 14:02:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 14:02:36,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20554473] [2022-12-14 14:02:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20554473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514387339] [2022-12-14 14:02:36,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:36,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:36,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:36,754 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:36,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 14:02:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:36,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:02:36,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:36,881 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-12-14 14:02:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:36,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:02:36,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514387339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:36,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:02:36,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-14 14:02:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45643355] [2022-12-14 14:02:36,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:36,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:02:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:02:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:02:36,934 INFO L87 Difference]: Start difference. First operand 931 states and 1848 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-12-14 14:02:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:37,043 INFO L93 Difference]: Finished difference Result 1799 states and 3558 transitions. [2022-12-14 14:02:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:02:37,043 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-12-14 14:02:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:37,050 INFO L225 Difference]: With dead ends: 1799 [2022-12-14 14:02:37,050 INFO L226 Difference]: Without dead ends: 1799 [2022-12-14 14:02:37,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-14 14:02:37,051 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 154 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:37,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 130 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:02:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2022-12-14 14:02:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 971. [2022-12-14 14:02:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 958 states have (on average 1.9853862212943632) internal successors, (1902), 970 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1902 transitions. [2022-12-14 14:02:37,083 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1902 transitions. Word has length 31 [2022-12-14 14:02:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:37,084 INFO L495 AbstractCegarLoop]: Abstraction has 971 states and 1902 transitions. [2022-12-14 14:02:37,084 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-12-14 14:02:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1902 transitions. [2022-12-14 14:02:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:02:37,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:37,085 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-12-14 14:02:37,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 14:02:37,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:37,287 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:02:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1297880418, now seen corresponding path program 2 times [2022-12-14 14:02:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:37,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432095727] [2022-12-14 14:02:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 14:02:37,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432095727] [2022-12-14 14:02:37,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432095727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546634084] [2022-12-14 14:02:37,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:02:37,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:37,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:37,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:37,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 14:02:37,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:02:37,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:02:37,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:02:37,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:37,772 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-12-14 14:02:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:37,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:02:37,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546634084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:37,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:02:37,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-14 14:02:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097652831] [2022-12-14 14:02:37,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:37,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:02:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:37,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:02:37,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-14 14:02:37,819 INFO L87 Difference]: Start difference. First operand 971 states and 1902 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-12-14 14:02:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:37,953 INFO L93 Difference]: Finished difference Result 2140 states and 4212 transitions. [2022-12-14 14:02:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:02:37,954 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-12-14 14:02:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:37,959 INFO L225 Difference]: With dead ends: 2140 [2022-12-14 14:02:37,959 INFO L226 Difference]: Without dead ends: 2140 [2022-12-14 14:02:37,959 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-12-14 14:02:37,959 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 173 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:37,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 132 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:02:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-12-14 14:02:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 999. [2022-12-14 14:02:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 986 states have (on average 1.9858012170385395) internal successors, (1958), 998 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1958 transitions. [2022-12-14 14:02:37,980 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1958 transitions. Word has length 31 [2022-12-14 14:02:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:37,980 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1958 transitions. [2022-12-14 14:02:37,980 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-12-14 14:02:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1958 transitions. [2022-12-14 14:02:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:02:37,981 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:37,981 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-12-14 14:02:37,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 14:02:38,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 14:02:38,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:02:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash -79947766, now seen corresponding path program 3 times [2022-12-14 14:02:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:38,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080468869] [2022-12-14 14:02:38,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:38,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 14:02:38,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:38,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080468869] [2022-12-14 14:02:38,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080468869] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:38,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954415658] [2022-12-14 14:02:38,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:02:38,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:38,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:38,435 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:38,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 14:02:38,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:02:38,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:02:38,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 14:02:38,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:38,616 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-12-14 14:02:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:38,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:02:38,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954415658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:38,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:02:38,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-14 14:02:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84803816] [2022-12-14 14:02:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:38,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:02:38,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:02:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:02:38,692 INFO L87 Difference]: Start difference. First operand 999 states and 1958 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-12-14 14:02:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:38,864 INFO L93 Difference]: Finished difference Result 2390 states and 4713 transitions. [2022-12-14 14:02:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:02:38,865 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-12-14 14:02:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:38,870 INFO L225 Difference]: With dead ends: 2390 [2022-12-14 14:02:38,870 INFO L226 Difference]: Without dead ends: 2390 [2022-12-14 14:02:38,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-14 14:02:38,871 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 174 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:38,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 144 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:02:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2022-12-14 14:02:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 1012. [2022-12-14 14:02:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 999 states have (on average 1.985985985985986) internal successors, (1984), 1011 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1984 transitions. [2022-12-14 14:02:38,904 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1984 transitions. Word has length 31 [2022-12-14 14:02:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:38,904 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1984 transitions. [2022-12-14 14:02:38,905 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-12-14 14:02:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1984 transitions. [2022-12-14 14:02:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 14:02:38,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:38,905 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] [2022-12-14 14:02:38,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 14:02:39,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:39,106 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-12-14 14:02:39,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1753780235, now seen corresponding path program 1 times [2022-12-14 14:02:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:39,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378723398] [2022-12-14 14:02:39,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:39,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:39,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378723398] [2022-12-14 14:02:39,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378723398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:39,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293647607] [2022-12-14 14:02:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:39,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:39,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:39,149 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:39,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 14:02:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:39,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 14:02:39,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:39,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:02:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:39,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293647607] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:02:39,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2027661997] [2022-12-14 14:02:39,282 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) 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-12-14 14:02:39,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:02:39,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 14:02:39,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057019293] [2022-12-14 14:02:39,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:02:39,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 14:02:39,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:39,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 14:02:39,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:02:39,284 INFO L87 Difference]: Start difference. First operand 1012 states and 1984 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:39,365 INFO L93 Difference]: Finished difference Result 2592 states and 5144 transitions. [2022-12-14 14:02:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:02:39,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 14:02:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:39,370 INFO L225 Difference]: With dead ends: 2592 [2022-12-14 14:02:39,371 INFO L226 Difference]: Without dead ends: 2592 [2022-12-14 14:02:39,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 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-12-14 14:02:39,371 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 186 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:39,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 118 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:02:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-12-14 14:02:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2457. [2022-12-14 14:02:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2444 states have (on average 2.049509001636661) internal successors, (5009), 2456 states have internal predecessors, (5009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 5009 transitions. [2022-12-14 14:02:39,425 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 5009 transitions. Word has length 34 [2022-12-14 14:02:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:39,426 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 5009 transitions. [2022-12-14 14:02:39,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 5009 transitions. [2022-12-14 14:02:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:02:39,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:39,427 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-12-14 14:02:39,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 14:02:39,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 14:02:39,628 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:02:39,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -190955659, now seen corresponding path program 1 times [2022-12-14 14:02:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:39,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717956662] [2022-12-14 14:02:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:40,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717956662] [2022-12-14 14:02:40,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717956662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918044980] [2022-12-14 14:02:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:40,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:40,213 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:40,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 14:02:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:40,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 14:02:40,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:40,610 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-12-14 14:02:40,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,645 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-12-14 14:02:40,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,688 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-12-14 14:02:40,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,740 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-12-14 14:02:40,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:40,803 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-12-14 14:02:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:40,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:02:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:41,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918044980] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:02:41,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929810675] [2022-12-14 14:02:41,695 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:337) 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-12-14 14:02:41,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:02:41,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:02:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006528866] [2022-12-14 14:02:41,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:02:41,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:02:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:41,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:02:41,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:02:41,698 INFO L87 Difference]: Start difference. First operand 2457 states and 5009 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-12-14 14:02:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:49,599 INFO L93 Difference]: Finished difference Result 8929 states and 18092 transitions. [2022-12-14 14:02:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 14:02:49,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-12-14 14:02:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:49,621 INFO L225 Difference]: With dead ends: 8929 [2022-12-14 14:02:49,621 INFO L226 Difference]: Without dead ends: 8929 [2022-12-14 14:02:49,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=615, Invalid=2691, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 14:02:49,622 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 650 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 4110 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 4228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 4110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:49,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 372 Invalid, 4228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 4110 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-12-14 14:02:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8929 states. [2022-12-14 14:02:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8929 to 5347. [2022-12-14 14:02:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5347 states, 5334 states have (on average 2.1434195725534306) internal successors, (11433), 5346 states have internal predecessors, (11433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 11433 transitions. [2022-12-14 14:02:49,724 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 11433 transitions. Word has length 45 [2022-12-14 14:02:49,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:49,725 INFO L495 AbstractCegarLoop]: Abstraction has 5347 states and 11433 transitions. [2022-12-14 14:02:49,725 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-12-14 14:02:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 11433 transitions. [2022-12-14 14:02:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:02:49,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:49,726 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-12-14 14:02:49,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 14:02:49,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:49,928 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:02:49,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1954042231, now seen corresponding path program 1 times [2022-12-14 14:02:49,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:49,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768220498] [2022-12-14 14:02:49,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:49,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:50,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:50,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768220498] [2022-12-14 14:02:50,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768220498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:50,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314734419] [2022-12-14 14:02:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:50,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:50,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:50,508 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:50,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 14:02:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:50,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 14:02:50,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:50,863 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-12-14 14:02:50,897 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-12-14 14:02:50,939 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-12-14 14:02:50,992 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-12-14 14:02:51,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:51,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:51,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:51,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:51,053 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-12-14 14:02:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:51,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:02:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:02:51,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314734419] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:02:51,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1454276147] [2022-12-14 14:02:51,897 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:337) 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-12-14 14:02:51,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:02:51,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:02:51,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114854164] [2022-12-14 14:02:51,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:02:51,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:02:51,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:51,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:02:51,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:02:51,899 INFO L87 Difference]: Start difference. First operand 5347 states and 11433 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-12-14 14:03:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:03:03,375 INFO L93 Difference]: Finished difference Result 8872 states and 17993 transitions. [2022-12-14 14:03:03,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 14:03:03,376 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-12-14 14:03:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:03:03,389 INFO L225 Difference]: With dead ends: 8872 [2022-12-14 14:03:03,389 INFO L226 Difference]: Without dead ends: 8872 [2022-12-14 14:03:03,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=762, Invalid=3398, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 14:03:03,390 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 672 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 4954 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 5026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 4954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:03:03,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 278 Invalid, 5026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 4954 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-12-14 14:03:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8872 states. [2022-12-14 14:03:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8872 to 5646. [2022-12-14 14:03:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5646 states, 5633 states have (on average 2.1418427125865436) internal successors, (12065), 5645 states have internal predecessors, (12065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:03:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 12065 transitions. [2022-12-14 14:03:03,481 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 12065 transitions. Word has length 45 [2022-12-14 14:03:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:03:03,481 INFO L495 AbstractCegarLoop]: Abstraction has 5646 states and 12065 transitions. [2022-12-14 14:03:03,481 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-12-14 14:03:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 12065 transitions. [2022-12-14 14:03:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:03:03,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:03:03,483 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-12-14 14:03:03,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 14:03:03,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:03:03,684 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-12-14 14:03:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:03:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1175224201, now seen corresponding path program 2 times [2022-12-14 14:03:03,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:03:03,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815598024] [2022-12-14 14:03:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:03:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:03:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:03:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:04,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:03:04,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815598024] [2022-12-14 14:03:04,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815598024] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:03:04,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404711281] [2022-12-14 14:03:04,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:03:04,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:03:04,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:03:04,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:03:04,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 14:03:04,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:03:04,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:03:04,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 14:03:04,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:03:04,287 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-12-14 14:03:04,368 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-12-14 14:03:04,400 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-12-14 14:03:04,449 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-12-14 14:03:04,501 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-12-14 14:03:04,574 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:03:04,574 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-12-14 14:03:04,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:04,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:04,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:04,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:04,642 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-12-14 14:03:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:03:04,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:03:05,521 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-12-14 14:03:05,523 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-12-14 14:03:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:03:05,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404711281] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:03:05,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:03:05,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-12-14 14:03:05,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111842309] [2022-12-14 14:03:05,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:03:05,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:03:05,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:03:05,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:03:05,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:03:05,528 INFO L87 Difference]: Start difference. First operand 5646 states and 12065 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-12-14 14:03:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:03:10,626 INFO L93 Difference]: Finished difference Result 7050 states and 14959 transitions. [2022-12-14 14:03:10,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:03:10,627 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-12-14 14:03:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:03:10,637 INFO L225 Difference]: With dead ends: 7050 [2022-12-14 14:03:10,637 INFO L226 Difference]: Without dead ends: 7050 [2022-12-14 14:03:10,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2022-12-14 14:03:10,638 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 119 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:03:10,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 32 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-12-14 14:03:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2022-12-14 14:03:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 5778. [2022-12-14 14:03:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5778 states, 5765 states have (on average 2.1427580225498697) internal successors, (12353), 5777 states have internal predecessors, (12353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:03:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5778 states to 5778 states and 12353 transitions. [2022-12-14 14:03:10,720 INFO L78 Accepts]: Start accepts. Automaton has 5778 states and 12353 transitions. Word has length 45 [2022-12-14 14:03:10,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:03:10,720 INFO L495 AbstractCegarLoop]: Abstraction has 5778 states and 12353 transitions. [2022-12-14 14:03:10,720 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-12-14 14:03:10,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5778 states and 12353 transitions. [2022-12-14 14:03:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:03:10,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:03:10,722 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-12-14 14:03:10,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 14:03:10,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 14:03:10,922 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-12-14 14:03:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:03:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1108194451, now seen corresponding path program 3 times [2022-12-14 14:03:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:03:10,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820207013] [2022-12-14 14:03:10,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:03:10,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:03:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:03:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:11,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:03:11,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820207013] [2022-12-14 14:03:11,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820207013] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:03:11,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990450291] [2022-12-14 14:03:11,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:03:11,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:03:11,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:03:11,375 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:03:11,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 14:03:11,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:03:11,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:03:11,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 14:03:11,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:03:11,764 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-12-14 14:03:11,793 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-12-14 14:03:11,837 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-12-14 14:03:11,939 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-12-14 14:03:11,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:11,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:11,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:11,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:11,992 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-12-14 14:03:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:12,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:03:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:12,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990450291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:03:12,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [799051581] [2022-12-14 14:03:12,922 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:337) 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-12-14 14:03:12,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:03:12,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:03:12,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949439837] [2022-12-14 14:03:12,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:03:12,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:03:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:03:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:03:12,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:03:12,926 INFO L87 Difference]: Start difference. First operand 5778 states and 12353 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-12-14 14:03:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:03:26,063 INFO L93 Difference]: Finished difference Result 7577 states and 15401 transitions. [2022-12-14 14:03:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 14:03:26,064 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-12-14 14:03:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:03:26,072 INFO L225 Difference]: With dead ends: 7577 [2022-12-14 14:03:26,072 INFO L226 Difference]: Without dead ends: 7577 [2022-12-14 14:03:26,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=576, Invalid=2394, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 14:03:26,073 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 540 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 5056 mSolverCounterSat, 84 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 5141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 5056 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:03:26,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 385 Invalid, 5141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 5056 Invalid, 1 Unknown, 0 Unchecked, 11.5s Time] [2022-12-14 14:03:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2022-12-14 14:03:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5775. [2022-12-14 14:03:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5775 states, 5762 states have (on average 2.1428323498785145) internal successors, (12347), 5774 states have internal predecessors, (12347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:03:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 12347 transitions. [2022-12-14 14:03:26,151 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 12347 transitions. Word has length 45 [2022-12-14 14:03:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:03:26,152 INFO L495 AbstractCegarLoop]: Abstraction has 5775 states and 12347 transitions. [2022-12-14 14:03:26,152 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-12-14 14:03:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 12347 transitions. [2022-12-14 14:03:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:03:26,153 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:03:26,153 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-12-14 14:03:26,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 14:03:26,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 14:03:26,354 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-12-14 14:03:26,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:03:26,354 INFO L85 PathProgramCache]: Analyzing trace with hash 997433429, now seen corresponding path program 4 times [2022-12-14 14:03:26,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:03:26,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939882491] [2022-12-14 14:03:26,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:03:26,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:03:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:03:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:26,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:03:26,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939882491] [2022-12-14 14:03:26,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939882491] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:03:26,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128761252] [2022-12-14 14:03:26,760 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:03:26,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:03:26,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:03:26,761 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:03:26,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 14:03:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:03:26,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 14:03:26,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:03:27,030 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-12-14 14:03:27,061 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-12-14 14:03:27,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-12-14 14:03:27,168 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-12-14 14:03:27,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:27,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:27,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:27,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:27,231 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-12-14 14:03:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:27,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:03:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:28,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128761252] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:03:28,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1790108155] [2022-12-14 14:03:28,143 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:337) 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-12-14 14:03:28,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:03:28,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:03:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167990128] [2022-12-14 14:03:28,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:03:28,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:03:28,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:03:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:03:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:03:28,145 INFO L87 Difference]: Start difference. First operand 5775 states and 12347 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-12-14 14:03:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:03:41,939 INFO L93 Difference]: Finished difference Result 7639 states and 15524 transitions. [2022-12-14 14:03:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 14:03:41,940 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-12-14 14:03:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:03:41,947 INFO L225 Difference]: With dead ends: 7639 [2022-12-14 14:03:41,947 INFO L226 Difference]: Without dead ends: 7639 [2022-12-14 14:03:41,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=576, Invalid=2504, Unknown=0, NotChecked=0, Total=3080 [2022-12-14 14:03:41,948 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 468 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 5023 mSolverCounterSat, 97 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 5121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 5023 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:03:41,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 365 Invalid, 5121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 5023 Invalid, 1 Unknown, 0 Unchecked, 12.0s Time] [2022-12-14 14:03:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2022-12-14 14:03:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 5775. [2022-12-14 14:03:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5775 states, 5762 states have (on average 2.1428323498785145) internal successors, (12347), 5774 states have internal predecessors, (12347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:03:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 12347 transitions. [2022-12-14 14:03:42,026 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 12347 transitions. Word has length 45 [2022-12-14 14:03:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:03:42,027 INFO L495 AbstractCegarLoop]: Abstraction has 5775 states and 12347 transitions. [2022-12-14 14:03:42,027 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-12-14 14:03:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 12347 transitions. [2022-12-14 14:03:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:03:42,028 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:03:42,028 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-12-14 14:03:42,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 14:03:42,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:03:42,229 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-12-14 14:03:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:03:42,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1588704497, now seen corresponding path program 5 times [2022-12-14 14:03:42,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:03:42,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482727784] [2022-12-14 14:03:42,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:03:42,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:03:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:03:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:42,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:03:42,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482727784] [2022-12-14 14:03:42,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482727784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:03:42,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741073651] [2022-12-14 14:03:42,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:03:42,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:03:42,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:03:42,664 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:03:42,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 14:03:42,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:03:42,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:03:42,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 14:03:42,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:03:42,809 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-12-14 14:03:42,876 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-12-14 14:03:42,912 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:03:42,912 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-12-14 14:03:42,940 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-12-14 14:03:42,977 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-12-14 14:03:43,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-14 14:03:43,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:43,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:43,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:43,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:43,094 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-12-14 14:03:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:03:43,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:03:43,983 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-12-14 14:03:43,985 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-12-14 14:03:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:03:43,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741073651] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:03:43,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:03:43,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-12-14 14:03:43,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996228389] [2022-12-14 14:03:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:03:43,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:03:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:03:43,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:03:43,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:03:43,989 INFO L87 Difference]: Start difference. First operand 5775 states and 12347 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-12-14 14:03:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:03:48,862 INFO L93 Difference]: Finished difference Result 7019 states and 14884 transitions. [2022-12-14 14:03:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:03:48,863 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-12-14 14:03:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:03:48,870 INFO L225 Difference]: With dead ends: 7019 [2022-12-14 14:03:48,870 INFO L226 Difference]: Without dead ends: 7019 [2022-12-14 14:03:48,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:03:48,871 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:03:48,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 34 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-12-14 14:03:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7019 states. [2022-12-14 14:03:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7019 to 5838. [2022-12-14 14:03:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5838 states, 5825 states have (on average 2.1411158798283263) internal successors, (12472), 5837 states have internal predecessors, (12472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:03:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 12472 transitions. [2022-12-14 14:03:48,974 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 12472 transitions. Word has length 45 [2022-12-14 14:03:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:03:48,974 INFO L495 AbstractCegarLoop]: Abstraction has 5838 states and 12472 transitions. [2022-12-14 14:03:48,974 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-12-14 14:03:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 12472 transitions. [2022-12-14 14:03:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:03:48,976 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:03:48,976 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-12-14 14:03:48,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 14:03:49,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 14:03:49,177 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:03:49,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:03:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1076782545, now seen corresponding path program 1 times [2022-12-14 14:03:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:03:49,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094624347] [2022-12-14 14:03:49,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:03:49,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:03:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:03:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:49,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:03:49,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094624347] [2022-12-14 14:03:49,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094624347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:03:49,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304407898] [2022-12-14 14:03:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:03:49,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:03:49,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:03:49,862 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:03:49,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 14:03:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:03:49,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:03:49,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:03:50,169 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-12-14 14:03:50,194 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-12-14 14:03:50,223 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-12-14 14:03:50,265 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-12-14 14:03:50,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,353 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-12-14 14:03:50,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,372 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-12-14 14:03:50,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,394 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-12-14 14:03:50,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,418 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-12-14 14:03:50,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:03:50,455 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-12-14 14:03:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:50,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:03:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:03:51,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304407898] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:03:51,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897667757] [2022-12-14 14:03:51,993 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:337) 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-12-14 14:03:51,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:03:51,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:03:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256504235] [2022-12-14 14:03:51,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:03:51,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:03:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:03:51,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:03:51,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:03:51,996 INFO L87 Difference]: Start difference. First operand 5838 states and 12472 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-12-14 14:04:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:04:04,560 INFO L93 Difference]: Finished difference Result 7839 states and 15929 transitions. [2022-12-14 14:04:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 14:04:04,561 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-12-14 14:04:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:04:04,568 INFO L225 Difference]: With dead ends: 7839 [2022-12-14 14:04:04,568 INFO L226 Difference]: Without dead ends: 7839 [2022-12-14 14:04:04,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=563, Invalid=2299, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 14:04:04,569 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 531 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4314 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 4469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 4314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:04:04,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 431 Invalid, 4469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 4314 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-12-14 14:04:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7839 states. [2022-12-14 14:04:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7839 to 5886. [2022-12-14 14:04:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5886 states, 5873 states have (on average 2.1399625404392983) internal successors, (12568), 5885 states have internal predecessors, (12568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:04:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5886 states to 5886 states and 12568 transitions. [2022-12-14 14:04:04,647 INFO L78 Accepts]: Start accepts. Automaton has 5886 states and 12568 transitions. Word has length 45 [2022-12-14 14:04:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:04:04,647 INFO L495 AbstractCegarLoop]: Abstraction has 5886 states and 12568 transitions. [2022-12-14 14:04:04,647 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-12-14 14:04:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5886 states and 12568 transitions. [2022-12-14 14:04:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:04:04,649 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:04:04,649 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-12-14 14:04:04,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 14:04:04,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:04:04,849 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:04:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:04:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash -216011015, now seen corresponding path program 2 times [2022-12-14 14:04:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:04:04,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354194704] [2022-12-14 14:04:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:04:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:04:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:04:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:04:05,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:04:05,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354194704] [2022-12-14 14:04:05,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354194704] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:04:05,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665047631] [2022-12-14 14:04:05,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:04:05,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:04:05,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:04:05,629 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:04:05,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 14:04:05,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:04:05,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:04:05,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 14:04:05,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:04:05,826 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-12-14 14:04:05,863 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-12-14 14:04:05,891 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-12-14 14:04:05,934 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-12-14 14:04:05,984 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:04:05,984 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-12-14 14:04:06,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-14 14:04:06,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,110 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-12-14 14:04:06,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,135 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 48 treesize of output 56 [2022-12-14 14:04:06,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,160 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 48 treesize of output 56 [2022-12-14 14:04:06,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,187 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 48 treesize of output 56 [2022-12-14 14:04:06,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:06,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 111 [2022-12-14 14:04:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:04:14,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:04:17,288 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-12-14 14:04:17,290 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-12-14 14:04:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:04:17,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665047631] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:04:17,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:04:17,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 11] total 32 [2022-12-14 14:04:17,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849925258] [2022-12-14 14:04:17,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:04:17,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:04:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:04:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:04:17,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=876, Unknown=3, NotChecked=0, Total=1056 [2022-12-14 14:04:17,294 INFO L87 Difference]: Start difference. First operand 5886 states and 12568 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-12-14 14:04:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:04:50,803 INFO L93 Difference]: Finished difference Result 9852 states and 20983 transitions. [2022-12-14 14:04:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:04:50,804 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-12-14 14:04:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:04:50,814 INFO L225 Difference]: With dead ends: 9852 [2022-12-14 14:04:50,814 INFO L226 Difference]: Without dead ends: 9852 [2022-12-14 14:04:50,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=278, Invalid=1441, Unknown=3, NotChecked=0, Total=1722 [2022-12-14 14:04:50,815 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 163 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:04:50,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 41 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 28.2s Time] [2022-12-14 14:04:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9852 states. [2022-12-14 14:04:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9852 to 6051. [2022-12-14 14:04:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6051 states, 6038 states have (on average 2.1361377939715136) internal successors, (12898), 6050 states have internal predecessors, (12898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:04:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6051 states to 6051 states and 12898 transitions. [2022-12-14 14:04:50,898 INFO L78 Accepts]: Start accepts. Automaton has 6051 states and 12898 transitions. Word has length 45 [2022-12-14 14:04:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:04:50,898 INFO L495 AbstractCegarLoop]: Abstraction has 6051 states and 12898 transitions. [2022-12-14 14:04:50,898 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-12-14 14:04:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6051 states and 12898 transitions. [2022-12-14 14:04:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:04:50,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:04:50,900 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-12-14 14:04:50,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-14 14:04:51,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:04:51,101 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-12-14 14:04:51,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:04:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash -733392711, now seen corresponding path program 3 times [2022-12-14 14:04:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:04:51,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640613662] [2022-12-14 14:04:51,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:04:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:04:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:04:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:04:51,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:04:51,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640613662] [2022-12-14 14:04:51,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640613662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:04:51,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793768849] [2022-12-14 14:04:51,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:04:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:04:51,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:04:51,844 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:04:51,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 14:04:52,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:04:52,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:04:52,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 14:04:52,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:04:52,318 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-12-14 14:04:52,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:04:52,384 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-12-14 14:04:52,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,479 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-12-14 14:04:52,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,496 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-12-14 14:04:52,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,509 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-12-14 14:04:52,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,526 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-12-14 14:04:52,548 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-12-14 14:04:52,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:04:52,596 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-12-14 14:04:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:04:52,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:04:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:04:56,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793768849] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:04:56,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1987754656] [2022-12-14 14:04:56,337 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:337) 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-12-14 14:04:56,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:04:56,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:04:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926459428] [2022-12-14 14:04:56,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:04:56,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:04:56,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:04:56,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:04:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:04:56,340 INFO L87 Difference]: Start difference. First operand 6051 states and 12898 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-12-14 14:05:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:05:21,728 INFO L93 Difference]: Finished difference Result 8138 states and 16535 transitions. [2022-12-14 14:05:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 14:05:21,729 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-12-14 14:05:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:05:21,737 INFO L225 Difference]: With dead ends: 8138 [2022-12-14 14:05:21,737 INFO L226 Difference]: Without dead ends: 8138 [2022-12-14 14:05:21,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=635, Invalid=2787, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 14:05:21,738 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 598 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 4420 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 4566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 4420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:05:21,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 303 Invalid, 4566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 4420 Invalid, 0 Unknown, 0 Unchecked, 20.5s Time] [2022-12-14 14:05:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8138 states. [2022-12-14 14:05:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8138 to 6059. [2022-12-14 14:05:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6059 states, 6046 states have (on average 2.136123056566325) internal successors, (12915), 6058 states have internal predecessors, (12915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:05:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6059 states to 6059 states and 12915 transitions. [2022-12-14 14:05:21,815 INFO L78 Accepts]: Start accepts. Automaton has 6059 states and 12915 transitions. Word has length 45 [2022-12-14 14:05:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:05:21,815 INFO L495 AbstractCegarLoop]: Abstraction has 6059 states and 12915 transitions. [2022-12-14 14:05:21,816 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-12-14 14:05:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6059 states and 12915 transitions. [2022-12-14 14:05:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:05:21,817 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:05:21,817 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-12-14 14:05:21,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 14:05:22,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 14:05:22,018 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-12-14 14:05:22,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:05:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash 288128367, now seen corresponding path program 4 times [2022-12-14 14:05:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:05:22,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358234160] [2022-12-14 14:05:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:05:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:05:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:05:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:05:22,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:05:22,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358234160] [2022-12-14 14:05:22,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358234160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:05:22,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110090296] [2022-12-14 14:05:22,797 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:05:22,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:05:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:05:22,799 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:05:22,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 14:05:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:05:22,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:05:22,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:05:23,136 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-12-14 14:05:23,169 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-12-14 14:05:23,253 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-12-14 14:05:23,303 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-12-14 14:05:23,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,376 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-12-14 14:05:23,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,402 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-12-14 14:05:23,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,427 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-12-14 14:05:23,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,448 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-12-14 14:05:23,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:23,502 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-12-14 14:05:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:05:23,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:05:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:05:25,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110090296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:05:25,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1495892568] [2022-12-14 14:05:25,419 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:337) 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-12-14 14:05:25,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:05:25,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:05:25,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685675136] [2022-12-14 14:05:25,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:05:25,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:05:25,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:05:25,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:05:25,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:05:25,420 INFO L87 Difference]: Start difference. First operand 6059 states and 12915 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-12-14 14:05:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:05:48,566 INFO L93 Difference]: Finished difference Result 8254 states and 16772 transitions. [2022-12-14 14:05:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 14:05:48,567 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-12-14 14:05:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:05:48,578 INFO L225 Difference]: With dead ends: 8254 [2022-12-14 14:05:48,578 INFO L226 Difference]: Without dead ends: 8254 [2022-12-14 14:05:48,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=631, Invalid=2909, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 14:05:48,579 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 622 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 4194 mSolverCounterSat, 213 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 4409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 4194 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:05:48,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 383 Invalid, 4409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 4194 Invalid, 2 Unknown, 0 Unchecked, 20.0s Time] [2022-12-14 14:05:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8254 states. [2022-12-14 14:05:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8254 to 6131. [2022-12-14 14:05:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6131 states, 6118 states have (on average 2.1353383458646618) internal successors, (13064), 6130 states have internal predecessors, (13064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:05:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6131 states to 6131 states and 13064 transitions. [2022-12-14 14:05:48,662 INFO L78 Accepts]: Start accepts. Automaton has 6131 states and 13064 transitions. Word has length 45 [2022-12-14 14:05:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:05:48,662 INFO L495 AbstractCegarLoop]: Abstraction has 6131 states and 13064 transitions. [2022-12-14 14:05:48,662 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-12-14 14:05:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6131 states and 13064 transitions. [2022-12-14 14:05:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:05:48,663 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:05:48,663 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-12-14 14:05:48,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 14:05:48,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 14:05:48,864 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-12-14 14:05:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:05:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1685905701, now seen corresponding path program 5 times [2022-12-14 14:05:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:05:48,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189091153] [2022-12-14 14:05:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:05:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:05:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:05:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:05:49,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:05:49,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189091153] [2022-12-14 14:05:49,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189091153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:05:49,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561593006] [2022-12-14 14:05:49,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:05:49,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:05:49,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:05:49,703 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:05:49,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 14:05:49,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:05:49,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:05:49,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 14:05:49,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:05:49,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 13 treesize of output 9 [2022-12-14 14:05:49,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-12-14 14:05:50,020 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:05:50,021 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-12-14 14:05:50,051 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-12-14 14:05:50,096 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-12-14 14:05:50,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-14 14:05:50,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,218 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-12-14 14:05:50,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,246 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 48 treesize of output 56 [2022-12-14 14:05:50,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-12-14 14:05:50,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-12-14 14:05:50,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:05:50,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2022-12-14 14:05:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:05:50,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:05:53,329 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-12-14 14:05:53,332 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-12-14 14:05:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:05:53,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561593006] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:05:53,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:05:53,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 12] total 33 [2022-12-14 14:05:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429834410] [2022-12-14 14:05:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:05:53,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:05:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:05:53,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:05:53,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:05:53,336 INFO L87 Difference]: Start difference. First operand 6131 states and 13064 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-12-14 14:06:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:06:36,914 INFO L93 Difference]: Finished difference Result 9708 states and 20585 transitions. [2022-12-14 14:06:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 14:06:36,915 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-12-14 14:06:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:06:36,926 INFO L225 Difference]: With dead ends: 9708 [2022-12-14 14:06:36,926 INFO L226 Difference]: Without dead ends: 9708 [2022-12-14 14:06:36,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 14:06:36,927 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 172 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:06:36,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 57 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 34.4s Time] [2022-12-14 14:06:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9708 states. [2022-12-14 14:06:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9708 to 6323. [2022-12-14 14:06:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6323 states, 6310 states have (on average 2.13122028526149) internal successors, (13448), 6322 states have internal predecessors, (13448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:06:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 13448 transitions. [2022-12-14 14:06:37,017 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 13448 transitions. Word has length 45 [2022-12-14 14:06:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:06:37,017 INFO L495 AbstractCegarLoop]: Abstraction has 6323 states and 13448 transitions. [2022-12-14 14:06:37,017 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-12-14 14:06:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 13448 transitions. [2022-12-14 14:06:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:06:37,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:06:37,018 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-12-14 14:06:37,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 14:06:37,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 14:06:37,219 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:06:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:06:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2091679899, now seen corresponding path program 6 times [2022-12-14 14:06:37,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:06:37,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126642695] [2022-12-14 14:06:37,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:06:37,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:06:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:06:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:06:37,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:06:37,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126642695] [2022-12-14 14:06:37,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126642695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:06:37,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843040332] [2022-12-14 14:06:37,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:06:37,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:06:37,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:06:37,954 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:06:37,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 14:06:38,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:06:38,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:06:38,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 14:06:38,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:06:38,413 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-12-14 14:06:38,456 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-12-14 14:06:38,486 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-12-14 14:06:38,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,527 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-12-14 14:06:38,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,547 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-12-14 14:06:38,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,562 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-12-14 14:06:38,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,580 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-12-14 14:06:38,606 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-12-14 14:06:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:06:38,672 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-12-14 14:06:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:06:38,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:06:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:06:42,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843040332] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:06:42,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2124758595] [2022-12-14 14:06:42,711 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:337) 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-12-14 14:06:42,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:06:42,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:06:42,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982965652] [2022-12-14 14:06:42,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:06:42,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:06:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:06:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:06:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:06:42,712 INFO L87 Difference]: Start difference. First operand 6323 states and 13448 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-12-14 14:07:34,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:07:34,049 INFO L93 Difference]: Finished difference Result 8514 states and 17298 transitions. [2022-12-14 14:07:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 14:07:34,050 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-12-14 14:07:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:07:34,058 INFO L225 Difference]: With dead ends: 8514 [2022-12-14 14:07:34,058 INFO L226 Difference]: Without dead ends: 8514 [2022-12-14 14:07:34,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=693, Invalid=3213, Unknown=0, NotChecked=0, Total=3906 [2022-12-14 14:07:34,059 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 640 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 4106 mSolverCounterSat, 203 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 4310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 4106 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:07:34,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 279 Invalid, 4310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 4106 Invalid, 1 Unknown, 0 Unchecked, 40.7s Time] [2022-12-14 14:07:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8514 states. [2022-12-14 14:07:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8514 to 6287. [2022-12-14 14:07:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6287 states, 6274 states have (on average 2.132770162575709) internal successors, (13381), 6286 states have internal predecessors, (13381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:07:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6287 states to 6287 states and 13381 transitions. [2022-12-14 14:07:34,167 INFO L78 Accepts]: Start accepts. Automaton has 6287 states and 13381 transitions. Word has length 45 [2022-12-14 14:07:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:07:34,167 INFO L495 AbstractCegarLoop]: Abstraction has 6287 states and 13381 transitions. [2022-12-14 14:07:34,167 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-12-14 14:07:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6287 states and 13381 transitions. [2022-12-14 14:07:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:07:34,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:07:34,168 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-12-14 14:07:34,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 14:07:34,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:07:34,369 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-12-14 14:07:34,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:07:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1331392013, now seen corresponding path program 7 times [2022-12-14 14:07:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:07:34,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143472244] [2022-12-14 14:07:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:07:34,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:07:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:07:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:07:35,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:07:35,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143472244] [2022-12-14 14:07:35,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143472244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:07:35,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879630252] [2022-12-14 14:07:35,309 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:07:35,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:07:35,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:07:35,310 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:07:35,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 14:07:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:07:35,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:07:35,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:07:35,636 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-12-14 14:07:35,668 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-12-14 14:07:35,703 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-12-14 14:07:35,747 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-12-14 14:07:35,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,815 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-12-14 14:07:35,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,835 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-12-14 14:07:35,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,851 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-12-14 14:07:35,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,873 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-12-14 14:07:35,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:35,920 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-12-14 14:07:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:07:35,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:07:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:07:37,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879630252] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:07:37,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1940214545] [2022-12-14 14:07:37,575 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:337) 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-12-14 14:07:37,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:07:37,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:07:37,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547629273] [2022-12-14 14:07:37,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:07:37,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:07:37,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:07:37,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:07:37,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:07:37,577 INFO L87 Difference]: Start difference. First operand 6287 states and 13381 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-12-14 14:07:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:07:50,693 INFO L93 Difference]: Finished difference Result 9502 states and 19280 transitions. [2022-12-14 14:07:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 14:07:50,694 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-12-14 14:07:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:07:50,703 INFO L225 Difference]: With dead ends: 9502 [2022-12-14 14:07:50,703 INFO L226 Difference]: Without dead ends: 9502 [2022-12-14 14:07:50,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=772, Invalid=3518, Unknown=0, NotChecked=0, Total=4290 [2022-12-14 14:07:50,704 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 727 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 3332 mSolverCounterSat, 162 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 3495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3332 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:07:50,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 297 Invalid, 3495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3332 Invalid, 1 Unknown, 0 Unchecked, 10.3s Time] [2022-12-14 14:07:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9502 states. [2022-12-14 14:07:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9502 to 6158. [2022-12-14 14:07:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6158 states, 6145 states have (on average 2.1352318958502847) internal successors, (13121), 6157 states have internal predecessors, (13121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:07:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6158 states to 6158 states and 13121 transitions. [2022-12-14 14:07:50,791 INFO L78 Accepts]: Start accepts. Automaton has 6158 states and 13121 transitions. Word has length 45 [2022-12-14 14:07:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:07:50,791 INFO L495 AbstractCegarLoop]: Abstraction has 6158 states and 13121 transitions. [2022-12-14 14:07:50,791 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-12-14 14:07:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6158 states and 13121 transitions. [2022-12-14 14:07:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:07:50,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:07:50,793 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-12-14 14:07:50,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 14:07:50,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:07:50,994 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:07:50,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:07:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1083878445, now seen corresponding path program 1 times [2022-12-14 14:07:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:07:50,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576198333] [2022-12-14 14:07:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:07:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:07:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:07:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:07:51,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:07:51,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576198333] [2022-12-14 14:07:51,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576198333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:07:51,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820234903] [2022-12-14 14:07:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:07:51,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:07:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:07:51,470 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:07:51,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 14:07:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:07:51,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:07:51,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:07:51,802 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-12-14 14:07:51,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,829 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-12-14 14:07:51,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,863 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-12-14 14:07:51,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,905 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-12-14 14:07:51,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:51,930 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-12-14 14:07:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:07:51,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:07:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:07:52,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820234903] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:07:52,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1530090894] [2022-12-14 14:07:52,466 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:337) 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-12-14 14:07:52,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:07:52,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-14 14:07:52,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176414235] [2022-12-14 14:07:52,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:07:52,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:07:52,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:07:52,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:07:52,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:07:52,468 INFO L87 Difference]: Start difference. First operand 6158 states and 13121 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-12-14 14:07:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:07:57,816 INFO L93 Difference]: Finished difference Result 8982 states and 18218 transitions. [2022-12-14 14:07:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 14:07:57,816 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-12-14 14:07:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:07:57,825 INFO L225 Difference]: With dead ends: 8982 [2022-12-14 14:07:57,825 INFO L226 Difference]: Without dead ends: 8982 [2022-12-14 14:07:57,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=635, Invalid=2787, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 14:07:57,826 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 666 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 3551 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 3670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:07:57,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 384 Invalid, 3670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3551 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-12-14 14:07:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8982 states. [2022-12-14 14:07:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8982 to 6129. [2022-12-14 14:07:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6129 states, 6116 states have (on average 2.133747547416612) internal successors, (13050), 6128 states have internal predecessors, (13050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:07:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 13050 transitions. [2022-12-14 14:07:57,908 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 13050 transitions. Word has length 45 [2022-12-14 14:07:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:07:57,908 INFO L495 AbstractCegarLoop]: Abstraction has 6129 states and 13050 transitions. [2022-12-14 14:07:57,908 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-12-14 14:07:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 13050 transitions. [2022-12-14 14:07:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:07:57,909 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:07:57,910 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-12-14 14:07:57,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 14:07:58,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 14:07:58,111 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:07:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:07:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash 732353337, now seen corresponding path program 2 times [2022-12-14 14:07:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:07:58,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013440239] [2022-12-14 14:07:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:07:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:07:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:07:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:07:58,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:07:58,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013440239] [2022-12-14 14:07:58,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013440239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:07:58,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428129951] [2022-12-14 14:07:58,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:07:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:07:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:07:58,580 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:07:58,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 14:07:58,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:07:58,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:07:58,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 14:07:58,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:07:58,938 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-12-14 14:07:58,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:07:59,000 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-12-14 14:07:59,031 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-12-14 14:07:59,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:59,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:59,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:59,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:07:59,083 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-12-14 14:07:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:07:59,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:07:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:07:59,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428129951] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:07:59,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [230303376] [2022-12-14 14:07:59,901 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:337) 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-12-14 14:07:59,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:07:59,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:07:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296291154] [2022-12-14 14:07:59,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:07:59,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:07:59,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:07:59,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:07:59,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:07:59,903 INFO L87 Difference]: Start difference. First operand 6129 states and 13050 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-12-14 14:08:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:08:05,115 INFO L93 Difference]: Finished difference Result 11634 states and 23611 transitions. [2022-12-14 14:08:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:08:05,116 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-12-14 14:08:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:08:05,127 INFO L225 Difference]: With dead ends: 11634 [2022-12-14 14:08:05,127 INFO L226 Difference]: Without dead ends: 11634 [2022-12-14 14:08:05,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=759, Invalid=3147, Unknown=0, NotChecked=0, Total=3906 [2022-12-14 14:08:05,128 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 958 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 2971 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 2971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:08:05,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 293 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 2971 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-12-14 14:08:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2022-12-14 14:08:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 6492. [2022-12-14 14:08:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6492 states, 6479 states have (on average 2.1325821886093532) internal successors, (13817), 6491 states have internal predecessors, (13817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:08:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 13817 transitions. [2022-12-14 14:08:05,225 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 13817 transitions. Word has length 45 [2022-12-14 14:08:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:08:05,225 INFO L495 AbstractCegarLoop]: Abstraction has 6492 states and 13817 transitions. [2022-12-14 14:08:05,225 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-12-14 14:08:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 13817 transitions. [2022-12-14 14:08:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:08:05,226 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:08:05,226 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-12-14 14:08:05,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-14 14:08:05,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 14:08:05,427 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-12-14 14:08:05,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:08:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1417616069, now seen corresponding path program 6 times [2022-12-14 14:08:05,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:08:05,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145928413] [2022-12-14 14:08:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:08:05,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:08:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:08:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:05,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:08:05,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145928413] [2022-12-14 14:08:05,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145928413] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:08:05,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052329154] [2022-12-14 14:08:05,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:08:05,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:08:05,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:08:05,909 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:08:05,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 14:08:06,179 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:08:06,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:08:06,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 14:08:06,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:08:06,384 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-12-14 14:08:06,421 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-12-14 14:08:06,457 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-12-14 14:08:06,505 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-12-14 14:08:06,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:06,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:06,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:06,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:06,567 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-12-14 14:08:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:06,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:08:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:07,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052329154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:08:07,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [62044942] [2022-12-14 14:08:07,453 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:337) 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-12-14 14:08:07,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:08:07,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:08:07,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354167859] [2022-12-14 14:08:07,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:08:07,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:08:07,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:08:07,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:08:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:08:07,454 INFO L87 Difference]: Start difference. First operand 6492 states and 13817 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-12-14 14:08:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:08:14,501 INFO L93 Difference]: Finished difference Result 11209 states and 22779 transitions. [2022-12-14 14:08:14,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 14:08:14,502 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-12-14 14:08:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:08:14,513 INFO L225 Difference]: With dead ends: 11209 [2022-12-14 14:08:14,513 INFO L226 Difference]: Without dead ends: 11209 [2022-12-14 14:08:14,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1134, Invalid=4566, Unknown=0, NotChecked=0, Total=5700 [2022-12-14 14:08:14,514 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 826 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 4603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:08:14,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 282 Invalid, 4603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4505 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-12-14 14:08:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11209 states. [2022-12-14 14:08:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11209 to 6867. [2022-12-14 14:08:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6867 states, 6854 states have (on average 2.136124890574847) internal successors, (14641), 6866 states have internal predecessors, (14641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:08:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6867 states to 6867 states and 14641 transitions. [2022-12-14 14:08:14,616 INFO L78 Accepts]: Start accepts. Automaton has 6867 states and 14641 transitions. Word has length 45 [2022-12-14 14:08:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:08:14,616 INFO L495 AbstractCegarLoop]: Abstraction has 6867 states and 14641 transitions. [2022-12-14 14:08:14,616 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-12-14 14:08:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6867 states and 14641 transitions. [2022-12-14 14:08:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:08:14,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:08:14,618 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-12-14 14:08:14,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-14 14:08:14,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:08:14,818 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:08:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:08:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash 965589011, now seen corresponding path program 8 times [2022-12-14 14:08:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:08:14,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487661486] [2022-12-14 14:08:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:08:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:08:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:08:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:15,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:08:15,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487661486] [2022-12-14 14:08:15,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487661486] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:08:15,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928042602] [2022-12-14 14:08:15,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:08:15,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:08:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:08:15,578 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:08:15,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 14:08:15,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:08:15,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:08:15,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 14:08:15,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:08:15,970 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-12-14 14:08:16,001 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-12-14 14:08:16,036 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-12-14 14:08:16,080 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-12-14 14:08:16,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,145 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-12-14 14:08:16,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,168 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-12-14 14:08:16,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,184 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-12-14 14:08:16,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,204 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-12-14 14:08:16,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:16,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2022-12-14 14:08:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:16,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:08:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:18,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928042602] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:08:18,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [396615821] [2022-12-14 14:08:18,912 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) 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-12-14 14:08:18,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:08:18,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 37 [2022-12-14 14:08:18,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805820956] [2022-12-14 14:08:18,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:08:18,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 14:08:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:08:18,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 14:08:18,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 14:08:18,914 INFO L87 Difference]: Start difference. First operand 6867 states and 14641 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:08:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:08:34,325 INFO L93 Difference]: Finished difference Result 11227 states and 22807 transitions. [2022-12-14 14:08:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 14:08:34,326 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-12-14 14:08:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:08:34,337 INFO L225 Difference]: With dead ends: 11227 [2022-12-14 14:08:34,337 INFO L226 Difference]: Without dead ends: 11227 [2022-12-14 14:08:34,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2199 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1365, Invalid=5441, Unknown=0, NotChecked=0, Total=6806 [2022-12-14 14:08:34,338 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 833 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 5541 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 5715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 5541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:08:34,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 299 Invalid, 5715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 5541 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2022-12-14 14:08:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11227 states. [2022-12-14 14:08:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11227 to 7081. [2022-12-14 14:08:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7081 states, 7068 states have (on average 2.1359649122807016) internal successors, (15097), 7080 states have internal predecessors, (15097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:08:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 15097 transitions. [2022-12-14 14:08:34,448 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 15097 transitions. Word has length 45 [2022-12-14 14:08:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:08:34,448 INFO L495 AbstractCegarLoop]: Abstraction has 7081 states and 15097 transitions. [2022-12-14 14:08:34,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:08:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 15097 transitions. [2022-12-14 14:08:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:08:34,449 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:08:34,449 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-12-14 14:08:34,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 14:08:34,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 14:08:34,651 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:08:34,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:08:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash 718075443, now seen corresponding path program 2 times [2022-12-14 14:08:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:08:34,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893291673] [2022-12-14 14:08:34,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:08:34,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:08:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:08:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:35,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:08:35,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893291673] [2022-12-14 14:08:35,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893291673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:08:35,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935160383] [2022-12-14 14:08:35,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:08:35,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:08:35,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:08:35,084 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:08:35,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 14:08:35,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:08:35,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:08:35,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 14:08:35,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:08:35,395 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-12-14 14:08:35,416 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-12-14 14:08:35,443 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-12-14 14:08:35,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:35,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:35,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:35,475 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-12-14 14:08:35,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:08:35,501 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-12-14 14:08:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:35,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:08:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:35,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935160383] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:08:35,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [184547956] [2022-12-14 14:08:35,977 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:337) 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-12-14 14:08:35,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:08:35,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-14 14:08:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005698508] [2022-12-14 14:08:35,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:08:35,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:08:35,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:08:35,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:08:35,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:08:35,979 INFO L87 Difference]: Start difference. First operand 7081 states and 15097 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-12-14 14:08:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:08:39,088 INFO L93 Difference]: Finished difference Result 11308 states and 22962 transitions. [2022-12-14 14:08:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:08:39,089 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-12-14 14:08:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:08:39,100 INFO L225 Difference]: With dead ends: 11308 [2022-12-14 14:08:39,100 INFO L226 Difference]: Without dead ends: 11308 [2022-12-14 14:08:39,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=746, Invalid=3036, Unknown=0, NotChecked=0, Total=3782 [2022-12-14 14:08:39,101 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 916 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 3715 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 3893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 3715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:08:39,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 424 Invalid, 3893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 3715 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 14:08:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11308 states. [2022-12-14 14:08:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11308 to 7272. [2022-12-14 14:08:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7272 states, 7259 states have (on average 2.1427193828351014) internal successors, (15554), 7271 states have internal predecessors, (15554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:08:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7272 states to 7272 states and 15554 transitions. [2022-12-14 14:08:39,209 INFO L78 Accepts]: Start accepts. Automaton has 7272 states and 15554 transitions. Word has length 45 [2022-12-14 14:08:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:08:39,209 INFO L495 AbstractCegarLoop]: Abstraction has 7272 states and 15554 transitions. [2022-12-14 14:08:39,209 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-12-14 14:08:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7272 states and 15554 transitions. [2022-12-14 14:08:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:08:39,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:08:39,210 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-12-14 14:08:39,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 14:08:39,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:08:39,411 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:08:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:08:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1029380261, now seen corresponding path program 3 times [2022-12-14 14:08:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:08:39,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483110291] [2022-12-14 14:08:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:08:39,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:08:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:08:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:40,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:08:40,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483110291] [2022-12-14 14:08:40,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483110291] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:08:40,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359937980] [2022-12-14 14:08:40,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:08:40,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:08:40,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:08:40,159 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:08:40,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 14:08:40,472 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:08:40,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:08:40,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 14:08:40,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:08:40,675 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-12-14 14:08:40,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,727 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-12-14 14:08:40,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,736 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-12-14 14:08:40,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,744 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-12-14 14:08:40,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,753 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-12-14 14:08:40,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,787 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-12-14 14:08:40,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,827 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-12-14 14:08:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,866 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-12-14 14:08:40,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:40,901 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-12-14 14:08:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:40,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:08:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:48,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359937980] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:08:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1453636423] [2022-12-14 14:08:48,266 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:337) 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-12-14 14:08:48,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:08:48,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:08:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236581789] [2022-12-14 14:08:48,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:08:48,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:08:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:08:48,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:08:48,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:08:48,268 INFO L87 Difference]: Start difference. First operand 7272 states and 15554 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-12-14 14:08:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:08:57,774 INFO L93 Difference]: Finished difference Result 11438 states and 23312 transitions. [2022-12-14 14:08:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 14:08:57,775 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-12-14 14:08:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:08:57,787 INFO L225 Difference]: With dead ends: 11438 [2022-12-14 14:08:57,787 INFO L226 Difference]: Without dead ends: 11438 [2022-12-14 14:08:57,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=622, Invalid=2684, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 14:08:57,787 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 540 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 3917 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 4094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 3917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:08:57,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 448 Invalid, 4094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 3917 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-12-14 14:08:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11438 states. [2022-12-14 14:08:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11438 to 7226. [2022-12-14 14:08:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7226 states, 7213 states have (on average 2.143490919173714) internal successors, (15461), 7225 states have internal predecessors, (15461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:08:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7226 states to 7226 states and 15461 transitions. [2022-12-14 14:08:57,888 INFO L78 Accepts]: Start accepts. Automaton has 7226 states and 15461 transitions. Word has length 45 [2022-12-14 14:08:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:08:57,888 INFO L495 AbstractCegarLoop]: Abstraction has 7226 states and 15461 transitions. [2022-12-14 14:08:57,888 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-12-14 14:08:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7226 states and 15461 transitions. [2022-12-14 14:08:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:08:57,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:08:57,889 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-12-14 14:08:57,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-14 14:08:58,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:08:58,090 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:08:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:08:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash 253339381, now seen corresponding path program 4 times [2022-12-14 14:08:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:08:58,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259041387] [2022-12-14 14:08:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:08:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:08:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:08:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:58,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:08:58,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259041387] [2022-12-14 14:08:58,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259041387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:08:58,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131231995] [2022-12-14 14:08:58,765 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:08:58,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:08:58,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:08:58,766 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:08:58,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 14:08:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:08:58,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:08:58,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:08:59,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:08:59,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,170 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-12-14 14:08:59,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,200 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-12-14 14:08:59,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,240 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-12-14 14:08:59,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,328 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-12-14 14:08:59,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,345 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-12-14 14:08:59,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,363 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-12-14 14:08:59,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,381 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-12-14 14:08:59,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:08:59,424 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-12-14 14:08:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:08:59,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:09:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:19,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131231995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:09:19,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2090633352] [2022-12-14 14:09:19,228 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:337) 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-12-14 14:09:19,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:09:19,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:09:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073091711] [2022-12-14 14:09:19,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:09:19,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:09:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:09:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:09:19,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=872, Unknown=6, NotChecked=0, Total=1056 [2022-12-14 14:09:19,230 INFO L87 Difference]: Start difference. First operand 7226 states and 15461 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-12-14 14:09:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:09:26,118 INFO L93 Difference]: Finished difference Result 10467 states and 21330 transitions. [2022-12-14 14:09:26,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 14:09:26,118 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-12-14 14:09:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:09:26,129 INFO L225 Difference]: With dead ends: 10467 [2022-12-14 14:09:26,129 INFO L226 Difference]: Without dead ends: 10467 [2022-12-14 14:09:26,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=599, Invalid=2475, Unknown=6, NotChecked=0, Total=3080 [2022-12-14 14:09:26,129 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 573 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 3154 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:09:26,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 427 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3154 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-12-14 14:09:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10467 states. [2022-12-14 14:09:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10467 to 7226. [2022-12-14 14:09:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7226 states, 7213 states have (on average 2.143490919173714) internal successors, (15461), 7225 states have internal predecessors, (15461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:09:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7226 states to 7226 states and 15461 transitions. [2022-12-14 14:09:26,225 INFO L78 Accepts]: Start accepts. Automaton has 7226 states and 15461 transitions. Word has length 45 [2022-12-14 14:09:26,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:09:26,225 INFO L495 AbstractCegarLoop]: Abstraction has 7226 states and 15461 transitions. [2022-12-14 14:09:26,226 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-12-14 14:09:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7226 states and 15461 transitions. [2022-12-14 14:09:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:09:26,226 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:09:26,227 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-12-14 14:09:26,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 14:09:26,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 14:09:26,428 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-12-14 14:09:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:09:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash 12422835, now seen corresponding path program 3 times [2022-12-14 14:09:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:09:26,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771866836] [2022-12-14 14:09:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:09:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:09:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:09:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:26,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:09:26,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771866836] [2022-12-14 14:09:26,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771866836] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:09:26,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830587297] [2022-12-14 14:09:26,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:09:26,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:09:26,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:09:26,856 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:09:26,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 14:09:27,181 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:09:27,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:09:27,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 14:09:27,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:09:27,393 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-12-14 14:09:27,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,423 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-12-14 14:09:27,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,452 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-12-14 14:09:27,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,534 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-12-14 14:09:27,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:27,561 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-12-14 14:09:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:27,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:09:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:32,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830587297] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:09:32,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [224409758] [2022-12-14 14:09:32,939 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) 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-12-14 14:09:32,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:09:32,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-14 14:09:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065133120] [2022-12-14 14:09:32,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:09:32,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:09:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:09:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:09:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:09:32,941 INFO L87 Difference]: Start difference. First operand 7226 states and 15461 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-12-14 14:09:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:09:36,261 INFO L93 Difference]: Finished difference Result 10153 states and 20692 transitions. [2022-12-14 14:09:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 14:09:36,261 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-12-14 14:09:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:09:36,271 INFO L225 Difference]: With dead ends: 10153 [2022-12-14 14:09:36,271 INFO L226 Difference]: Without dead ends: 10153 [2022-12-14 14:09:36,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=642, Invalid=2438, Unknown=0, NotChecked=0, Total=3080 [2022-12-14 14:09:36,271 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 586 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 3456 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:09:36,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 467 Invalid, 3537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3456 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-12-14 14:09:36,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2022-12-14 14:09:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 7224. [2022-12-14 14:09:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7224 states, 7211 states have (on average 2.1432533629177644) internal successors, (15455), 7223 states have internal predecessors, (15455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:09:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7224 states to 7224 states and 15455 transitions. [2022-12-14 14:09:36,362 INFO L78 Accepts]: Start accepts. Automaton has 7224 states and 15455 transitions. Word has length 45 [2022-12-14 14:09:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:09:36,362 INFO L495 AbstractCegarLoop]: Abstraction has 7224 states and 15455 transitions. [2022-12-14 14:09:36,362 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-12-14 14:09:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7224 states and 15455 transitions. [2022-12-14 14:09:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:09:36,363 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:09:36,364 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-12-14 14:09:36,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 14:09:36,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-14 14:09:36,565 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-12-14 14:09:36,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:09:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash -182111221, now seen corresponding path program 4 times [2022-12-14 14:09:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:09:36,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149962348] [2022-12-14 14:09:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:09:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:09:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:09:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:36,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:09:36,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149962348] [2022-12-14 14:09:36,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149962348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:09:36,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388221255] [2022-12-14 14:09:36,934 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:09:36,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:09:36,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:09:36,935 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:09:36,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 14:09:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:09:37,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 14:09:37,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:09:37,270 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-12-14 14:09:37,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,300 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-12-14 14:09:37,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,362 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-12-14 14:09:37,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,407 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-12-14 14:09:37,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:37,441 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-12-14 14:09:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:37,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:09:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:38,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388221255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:09:38,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [795001174] [2022-12-14 14:09:38,359 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:337) 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-12-14 14:09:38,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:09:38,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-14 14:09:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444917638] [2022-12-14 14:09:38,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:09:38,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:09:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:09:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:09:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:09:38,361 INFO L87 Difference]: Start difference. First operand 7224 states and 15455 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-12-14 14:09:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:09:41,453 INFO L93 Difference]: Finished difference Result 10213 states and 20810 transitions. [2022-12-14 14:09:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 14:09:41,454 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-12-14 14:09:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:09:41,463 INFO L225 Difference]: With dead ends: 10213 [2022-12-14 14:09:41,463 INFO L226 Difference]: Without dead ends: 10213 [2022-12-14 14:09:41,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=674, Invalid=2632, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 14:09:41,464 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 554 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 3501 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 3645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:09:41,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 401 Invalid, 3645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3501 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 14:09:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10213 states. [2022-12-14 14:09:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10213 to 7223. [2022-12-14 14:09:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7223 states, 7210 states have (on average 2.1431345353675453) internal successors, (15452), 7222 states have internal predecessors, (15452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:09:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7223 states to 7223 states and 15452 transitions. [2022-12-14 14:09:41,562 INFO L78 Accepts]: Start accepts. Automaton has 7223 states and 15452 transitions. Word has length 45 [2022-12-14 14:09:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:09:41,562 INFO L495 AbstractCegarLoop]: Abstraction has 7223 states and 15452 transitions. [2022-12-14 14:09:41,562 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-12-14 14:09:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7223 states and 15452 transitions. [2022-12-14 14:09:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:09:41,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:09:41,563 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-12-14 14:09:41,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-14 14:09:41,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 14:09:41,764 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:09:41,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:09:41,765 INFO L85 PathProgramCache]: Analyzing trace with hash -482946317, now seen corresponding path program 5 times [2022-12-14 14:09:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:09:41,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282481869] [2022-12-14 14:09:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:09:41,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:09:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:09:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:42,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:09:42,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282481869] [2022-12-14 14:09:42,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282481869] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:09:42,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343298426] [2022-12-14 14:09:42,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:09:42,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:09:42,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:09:42,191 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:09:42,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 14:09:42,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:09:42,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:09:42,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:09:42,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:09:42,580 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-12-14 14:09:42,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,641 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-12-14 14:09:42,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,680 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-12-14 14:09:42,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,722 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-12-14 14:09:42,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:42,756 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-12-14 14:09:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:42,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:09:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:43,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343298426] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:09:43,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [757862657] [2022-12-14 14:09:43,495 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:337) 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-12-14 14:09:43,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:09:43,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-14 14:09:43,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792251201] [2022-12-14 14:09:43,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:09:43,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:09:43,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:09:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:09:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:09:43,497 INFO L87 Difference]: Start difference. First operand 7223 states and 15452 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-12-14 14:09:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:09:48,691 INFO L93 Difference]: Finished difference Result 10255 states and 20889 transitions. [2022-12-14 14:09:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 14:09:48,692 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-12-14 14:09:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:09:48,702 INFO L225 Difference]: With dead ends: 10255 [2022-12-14 14:09:48,702 INFO L226 Difference]: Without dead ends: 10255 [2022-12-14 14:09:48,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=624, Invalid=2568, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 14:09:48,703 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 657 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 4176 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 4327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 4176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:09:48,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 482 Invalid, 4327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 4176 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-12-14 14:09:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2022-12-14 14:09:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 7131. [2022-12-14 14:09:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7131 states, 7118 states have (on average 2.1410508569822984) internal successors, (15240), 7130 states have internal predecessors, (15240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:09:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7131 states to 7131 states and 15240 transitions. [2022-12-14 14:09:48,795 INFO L78 Accepts]: Start accepts. Automaton has 7131 states and 15240 transitions. Word has length 45 [2022-12-14 14:09:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:09:48,795 INFO L495 AbstractCegarLoop]: Abstraction has 7131 states and 15240 transitions. [2022-12-14 14:09:48,796 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-12-14 14:09:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7131 states and 15240 transitions. [2022-12-14 14:09:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:09:48,796 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:09:48,797 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-12-14 14:09:48,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 14:09:48,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:09:48,998 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:09:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:09:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2026166683, now seen corresponding path program 5 times [2022-12-14 14:09:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:09:49,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555056079] [2022-12-14 14:09:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:09:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:09:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:09:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:49,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:09:49,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555056079] [2022-12-14 14:09:49,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555056079] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:09:49,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292698157] [2022-12-14 14:09:49,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:09:49,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:09:49,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:09:49,773 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:09:49,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 14:09:50,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:09:50,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:09:50,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 14:09:50,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:09:50,210 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-12-14 14:09:50,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:09:50,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,290 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-12-14 14:09:50,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,398 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-12-14 14:09:50,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,474 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-12-14 14:09:50,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,498 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-12-14 14:09:50,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,519 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-12-14 14:09:50,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,550 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-12-14 14:09:50,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:09:50,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2022-12-14 14:09:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:09:56,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:10:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:10:19,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292698157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:10:19,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1708631729] [2022-12-14 14:10:19,138 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) 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-12-14 14:10:19,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:10:19,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 37 [2022-12-14 14:10:19,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230269769] [2022-12-14 14:10:19,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:10:19,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 14:10:19,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:10:19,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 14:10:19,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1194, Unknown=8, NotChecked=0, Total=1406 [2022-12-14 14:10:19,140 INFO L87 Difference]: Start difference. First operand 7131 states and 15240 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:10:27,955 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-12-14 14:10:29,991 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-12-14 14:10:32,180 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-12-14 14:10:34,195 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-12-14 14:10:39,628 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-12-14 14:10:41,682 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-12-14 14:10:45,330 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-12-14 14:10:47,357 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-12-14 14:10:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:10:50,952 INFO L93 Difference]: Finished difference Result 10592 states and 21567 transitions. [2022-12-14 14:10:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 14:10:50,952 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-12-14 14:10:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:10:50,962 INFO L225 Difference]: With dead ends: 10592 [2022-12-14 14:10:50,963 INFO L226 Difference]: Without dead ends: 10592 [2022-12-14 14:10:50,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=806, Invalid=3343, Unknown=11, NotChecked=0, Total=4160 [2022-12-14 14:10:50,963 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 766 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 191 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:10:50,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 311 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 3050 Invalid, 8 Unknown, 0 Unchecked, 23.4s Time] [2022-12-14 14:10:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10592 states. [2022-12-14 14:10:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10592 to 7130. [2022-12-14 14:10:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7130 states, 7117 states have (on average 2.140930167205283) internal successors, (15237), 7129 states have internal predecessors, (15237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:10:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7130 states to 7130 states and 15237 transitions. [2022-12-14 14:10:51,060 INFO L78 Accepts]: Start accepts. Automaton has 7130 states and 15237 transitions. Word has length 45 [2022-12-14 14:10:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:10:51,060 INFO L495 AbstractCegarLoop]: Abstraction has 7130 states and 15237 transitions. [2022-12-14 14:10:51,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:10:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 7130 states and 15237 transitions. [2022-12-14 14:10:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:10:51,061 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:10:51,061 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-12-14 14:10:51,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 14:10:51,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:10:51,262 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:10:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:10:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash -986100875, now seen corresponding path program 6 times [2022-12-14 14:10:51,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:10:51,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156666496] [2022-12-14 14:10:51,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:10:51,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:10:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:10:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:10:52,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:10:52,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156666496] [2022-12-14 14:10:52,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156666496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:10:52,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566869046] [2022-12-14 14:10:52,069 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:10:52,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:10:52,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:10:52,070 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:10:52,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 14:10:52,524 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:10:52,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:10:52,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 14:10:52,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:10:52,688 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-12-14 14:10:52,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,716 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-12-14 14:10:52,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,792 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-12-14 14:10:52,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,833 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-12-14 14:10:52,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,882 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-12-14 14:10:52,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,907 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-12-14 14:10:52,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,926 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-12-14 14:10:52,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:52,950 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-12-14 14:10:53,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:10:53,088 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 64 treesize of output 78 [2022-12-14 14:10:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:10:59,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:11:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:11:12,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566869046] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:11:12,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108250996] [2022-12-14 14:11:12,047 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:337) 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-12-14 14:11:12,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:11:12,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 37 [2022-12-14 14:11:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374632422] [2022-12-14 14:11:12,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:11:12,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 14:11:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:11:12,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 14:11:12,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1201, Unknown=3, NotChecked=0, Total=1406 [2022-12-14 14:11:12,049 INFO L87 Difference]: Start difference. First operand 7130 states and 15237 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:11:20,124 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-12-14 14:11:26,523 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-12-14 14:11:28,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-12-14 14:11:30,669 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-12-14 14:11:32,676 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-12-14 14:11:35,312 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-12-14 14:11:40,950 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-12-14 14:11:43,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-12-14 14:11:47,020 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-12-14 14:11:49,389 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-12-14 14:11:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:11:56,631 INFO L93 Difference]: Finished difference Result 10752 states and 21886 transitions. [2022-12-14 14:11:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 14:11:56,632 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-12-14 14:11:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:11:56,642 INFO L225 Difference]: With dead ends: 10752 [2022-12-14 14:11:56,642 INFO L226 Difference]: Without dead ends: 10752 [2022-12-14 14:11:56,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=796, Invalid=3358, Unknown=6, NotChecked=0, Total=4160 [2022-12-14 14:11:56,643 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 632 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 4751 mSolverCounterSat, 173 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 4934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 4751 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:11:56,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 414 Invalid, 4934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 4751 Invalid, 10 Unknown, 0 Unchecked, 36.2s Time] [2022-12-14 14:11:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10752 states. [2022-12-14 14:11:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10752 to 6987. [2022-12-14 14:11:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6987 states, 6974 states have (on average 2.1406653283624895) internal successors, (14929), 6986 states have internal predecessors, (14929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:11:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6987 states to 6987 states and 14929 transitions. [2022-12-14 14:11:56,739 INFO L78 Accepts]: Start accepts. Automaton has 6987 states and 14929 transitions. Word has length 45 [2022-12-14 14:11:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:11:56,739 INFO L495 AbstractCegarLoop]: Abstraction has 6987 states and 14929 transitions. [2022-12-14 14:11:56,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:11:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6987 states and 14929 transitions. [2022-12-14 14:11:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:11:56,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:11:56,740 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-12-14 14:11:56,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-14 14:11:56,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 14:11:56,942 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:11:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:11:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 221046990, now seen corresponding path program 1 times [2022-12-14 14:11:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:11:56,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654363849] [2022-12-14 14:11:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:11:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:11:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:11:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:11:57,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:11:57,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654363849] [2022-12-14 14:11:57,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654363849] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:11:57,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031874001] [2022-12-14 14:11:57,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:11:57,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:11:57,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:11:57,443 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:11:57,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 14:11:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:11:57,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 14:11:57,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:11:57,829 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-12-14 14:11:57,861 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-12-14 14:11:57,907 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-12-14 14:11:57,955 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-12-14 14:11:58,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:11:58,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:11:58,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:11:58,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:11:58,017 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-12-14 14:11:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:11:58,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:11:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:11:58,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031874001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:11:58,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1334957620] [2022-12-14 14:11:58,856 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:337) 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-12-14 14:11:58,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:11:58,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:11:58,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352052667] [2022-12-14 14:11:58,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:11:58,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:11:58,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:11:58,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:11:58,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:11:58,858 INFO L87 Difference]: Start difference. First operand 6987 states and 14929 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-12-14 14:12:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:12:03,494 INFO L93 Difference]: Finished difference Result 21887 states and 45149 transitions. [2022-12-14 14:12:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-14 14:12:03,495 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-12-14 14:12:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:12:03,525 INFO L225 Difference]: With dead ends: 21887 [2022-12-14 14:12:03,525 INFO L226 Difference]: Without dead ends: 21887 [2022-12-14 14:12:03,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2366 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1598, Invalid=6058, Unknown=0, NotChecked=0, Total=7656 [2022-12-14 14:12:03,526 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1811 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1811 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 2761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:12:03,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1811 Valid, 292 Invalid, 2761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 14:12:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21887 states. [2022-12-14 14:12:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21887 to 10420. [2022-12-14 14:12:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10420 states, 10407 states have (on average 2.1565292591524936) internal successors, (22443), 10419 states have internal predecessors, (22443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10420 states to 10420 states and 22443 transitions. [2022-12-14 14:12:03,715 INFO L78 Accepts]: Start accepts. Automaton has 10420 states and 22443 transitions. Word has length 45 [2022-12-14 14:12:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:12:03,715 INFO L495 AbstractCegarLoop]: Abstraction has 10420 states and 22443 transitions. [2022-12-14 14:12:03,715 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-12-14 14:12:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 10420 states and 22443 transitions. [2022-12-14 14:12:03,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:12:03,716 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:03,716 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-12-14 14:12:03,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-14 14:12:03,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 14:12:03,917 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:12:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1928922416, now seen corresponding path program 1 times [2022-12-14 14:12:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:03,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925739970] [2022-12-14 14:12:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:04,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:12:04,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925739970] [2022-12-14 14:12:04,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925739970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:12:04,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549211298] [2022-12-14 14:12:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:04,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:12:04,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:12:04,488 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:12:04,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 14:12:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:04,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:12:04,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:12:04,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:12:04,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:04,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:12:05,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,007 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-12-14 14:12:05,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,045 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-12-14 14:12:05,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:05,093 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-12-14 14:12:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:05,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:12:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:05,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549211298] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:12:05,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1734557450] [2022-12-14 14:12:05,928 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:337) 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-12-14 14:12:05,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:12:05,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:12:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878135852] [2022-12-14 14:12:05,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:12:05,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:12:05,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:12:05,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:12:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:12:05,929 INFO L87 Difference]: Start difference. First operand 10420 states and 22443 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-12-14 14:12:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:12:10,008 INFO L93 Difference]: Finished difference Result 19580 states and 40504 transitions. [2022-12-14 14:12:10,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 14:12:10,009 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-12-14 14:12:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:12:10,044 INFO L225 Difference]: With dead ends: 19580 [2022-12-14 14:12:10,044 INFO L226 Difference]: Without dead ends: 19576 [2022-12-14 14:12:10,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=768, Invalid=3264, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 14:12:10,044 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1708 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 3237 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 3237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:12:10,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 273 Invalid, 3451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 3237 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-14 14:12:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19576 states. [2022-12-14 14:12:10,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19576 to 11915. [2022-12-14 14:12:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11915 states, 11902 states have (on average 2.157452528986725) internal successors, (25678), 11914 states have internal predecessors, (25678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11915 states to 11915 states and 25678 transitions. [2022-12-14 14:12:10,208 INFO L78 Accepts]: Start accepts. Automaton has 11915 states and 25678 transitions. Word has length 45 [2022-12-14 14:12:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:12:10,209 INFO L495 AbstractCegarLoop]: Abstraction has 11915 states and 25678 transitions. [2022-12-14 14:12:10,209 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-12-14 14:12:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 11915 states and 25678 transitions. [2022-12-14 14:12:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:12:10,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:10,210 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-12-14 14:12:10,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-14 14:12:10,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:12:10,412 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:12:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash -696191802, now seen corresponding path program 2 times [2022-12-14 14:12:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:10,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978824482] [2022-12-14 14:12:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:10,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:12:10,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978824482] [2022-12-14 14:12:10,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978824482] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:12:10,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669721760] [2022-12-14 14:12:10,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:12:10,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:12:10,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:12:10,867 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:12:10,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 14:12:11,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:12:11,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:12:11,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 14:12:11,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:12:11,267 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-12-14 14:12:11,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,304 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-12-14 14:12:11,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,348 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-12-14 14:12:11,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,427 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-12-14 14:12:11,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:11,476 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-12-14 14:12:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:11,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:12:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669721760] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:12:12,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2032283699] [2022-12-14 14:12:12,631 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:337) 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-12-14 14:12:12,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:12:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:12:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052731490] [2022-12-14 14:12:12,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:12:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:12:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:12:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:12:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:12:12,633 INFO L87 Difference]: Start difference. First operand 11915 states and 25678 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-12-14 14:12:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:12:35,424 INFO L93 Difference]: Finished difference Result 26565 states and 55912 transitions. [2022-12-14 14:12:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-12-14 14:12:35,425 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-12-14 14:12:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:12:35,463 INFO L225 Difference]: With dead ends: 26565 [2022-12-14 14:12:35,463 INFO L226 Difference]: Without dead ends: 26565 [2022-12-14 14:12:35,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3546 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1765, Invalid=8135, Unknown=0, NotChecked=0, Total=9900 [2022-12-14 14:12:35,464 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 1142 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 6232 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 6359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 6232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:12:35,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 697 Invalid, 6359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 6232 Invalid, 0 Unknown, 0 Unchecked, 16.5s Time] [2022-12-14 14:12:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26565 states. [2022-12-14 14:12:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26565 to 19205. [2022-12-14 14:12:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19205 states, 19192 states have (on average 2.1662671946644436) internal successors, (41575), 19204 states have internal predecessors, (41575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 41575 transitions. [2022-12-14 14:12:35,777 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 41575 transitions. Word has length 45 [2022-12-14 14:12:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:12:35,777 INFO L495 AbstractCegarLoop]: Abstraction has 19205 states and 41575 transitions. [2022-12-14 14:12:35,777 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-12-14 14:12:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 41575 transitions. [2022-12-14 14:12:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:12:35,779 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:35,779 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-12-14 14:12:35,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-14 14:12:35,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 14:12:35,980 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:12:35,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1409436078, now seen corresponding path program 3 times [2022-12-14 14:12:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:35,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387121525] [2022-12-14 14:12:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:36,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:12:36,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387121525] [2022-12-14 14:12:36,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387121525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:12:36,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272338244] [2022-12-14 14:12:36,430 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:12:36,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:12:36,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:12:36,431 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:12:36,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 14:12:36,833 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:12:36,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:12:36,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 14:12:36,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:12:37,018 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-12-14 14:12:37,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:12:37,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,137 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-12-14 14:12:37,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,177 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-12-14 14:12:37,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:37,226 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-12-14 14:12:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:37,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:12:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:39,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272338244] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:12:39,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835628627] [2022-12-14 14:12:39,433 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:337) 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-12-14 14:12:39,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:12:39,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:12:39,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071771614] [2022-12-14 14:12:39,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:12:39,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:12:39,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:12:39,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:12:39,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:12:39,434 INFO L87 Difference]: Start difference. First operand 19205 states and 41575 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-12-14 14:12:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:12:47,069 INFO L93 Difference]: Finished difference Result 23916 states and 50566 transitions. [2022-12-14 14:12:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 14:12:47,069 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-12-14 14:12:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:12:47,110 INFO L225 Difference]: With dead ends: 23916 [2022-12-14 14:12:47,110 INFO L226 Difference]: Without dead ends: 23913 [2022-12-14 14:12:47,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=644, Invalid=2662, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 14:12:47,111 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1025 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 3990 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 4259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 3990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:12:47,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 308 Invalid, 4259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 3990 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-12-14 14:12:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23913 states. [2022-12-14 14:12:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23913 to 19184. [2022-12-14 14:12:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19184 states, 19171 states have (on average 2.166292838140942) internal successors, (41530), 19183 states have internal predecessors, (41530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19184 states to 19184 states and 41530 transitions. [2022-12-14 14:12:47,476 INFO L78 Accepts]: Start accepts. Automaton has 19184 states and 41530 transitions. Word has length 45 [2022-12-14 14:12:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:12:47,477 INFO L495 AbstractCegarLoop]: Abstraction has 19184 states and 41530 transitions. [2022-12-14 14:12:47,477 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-12-14 14:12:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19184 states and 41530 transitions. [2022-12-14 14:12:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:12:47,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:47,479 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-12-14 14:12:47,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-14 14:12:47,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:12:47,680 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:12:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1488785194, now seen corresponding path program 1 times [2022-12-14 14:12:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:47,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398357227] [2022-12-14 14:12:47,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:48,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:12:48,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398357227] [2022-12-14 14:12:48,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398357227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:12:48,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329866619] [2022-12-14 14:12:48,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:48,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:12:48,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:12:48,403 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:12:48,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 14:12:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:48,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:12:48,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:12:48,792 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-12-14 14:12:48,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,818 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-12-14 14:12:48,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,854 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-12-14 14:12:48,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,890 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-12-14 14:12:48,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,983 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-12-14 14:12:48,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:48,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,003 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-12-14 14:12:49,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,020 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-12-14 14:12:49,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,044 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-12-14 14:12:49,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:12:49,086 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-12-14 14:12:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:49,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:12:52,525 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| Int)) (or (forall ((v_ArrVal_5381 Int) (v_ArrVal_5384 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312|) v_ArrVal_5381) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| v_ArrVal_5384)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| .cse2))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| .cse2) (forall ((v_ArrVal_5381 Int) (v_ArrVal_5384 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312|) v_ArrVal_5381) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| v_ArrVal_5384)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| Int)) (or (forall ((v_ArrVal_5381 Int) (v_ArrVal_5384 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312|) v_ArrVal_5381) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| v_ArrVal_5384)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| .cse2))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| Int)) (or (forall ((v_ArrVal_5381 Int) (v_ArrVal_5384 Int)) (= 0 (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312|) v_ArrVal_5381) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| v_ArrVal_5384)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| .cse2))))))) is different from false [2022-12-14 14:12:57,138 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse3 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| Int)) (or (forall ((v_ArrVal_5381 Int) (v_ArrVal_5384 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312|) v_ArrVal_5381) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| v_ArrVal_5384)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| .cse2))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| Int)) (or (forall ((v_ArrVal_5381 Int) (v_ArrVal_5384 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312|) v_ArrVal_5381) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| v_ArrVal_5384)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| .cse2))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| Int)) (or (forall ((v_ArrVal_5381 Int) (v_ArrVal_5384 Int)) (= 0 (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312|) v_ArrVal_5381) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| v_ArrVal_5384)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_312| .cse2))))))) is different from false [2022-12-14 14:12:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:12:57,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329866619] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:12:57,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1604963] [2022-12-14 14:12:57,818 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:337) 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-12-14 14:12:57,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:12:57,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:12:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958244242] [2022-12-14 14:12:57,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:12:57,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:12:57,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:12:57,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:12:57,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=769, Unknown=3, NotChecked=118, Total=1056 [2022-12-14 14:12:57,819 INFO L87 Difference]: Start difference. First operand 19184 states and 41530 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-12-14 14:13:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:11,333 INFO L93 Difference]: Finished difference Result 23993 states and 50735 transitions. [2022-12-14 14:13:11,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:13:11,334 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-12-14 14:13:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:11,364 INFO L225 Difference]: With dead ends: 23993 [2022-12-14 14:13:11,364 INFO L226 Difference]: Without dead ends: 23987 [2022-12-14 14:13:11,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 4 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=719, Invalid=2708, Unknown=3, NotChecked=230, Total=3660 [2022-12-14 14:13:11,364 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 921 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 2975 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 4148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 776 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:11,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 371 Invalid, 4148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2975 Invalid, 0 Unknown, 776 Unchecked, 8.9s Time] [2022-12-14 14:13:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23987 states. [2022-12-14 14:13:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23987 to 19410. [2022-12-14 14:13:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19410 states, 19397 states have (on average 2.165025519410218) internal successors, (41995), 19409 states have internal predecessors, (41995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19410 states to 19410 states and 41995 transitions. [2022-12-14 14:13:11,651 INFO L78 Accepts]: Start accepts. Automaton has 19410 states and 41995 transitions. Word has length 45 [2022-12-14 14:13:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:11,651 INFO L495 AbstractCegarLoop]: Abstraction has 19410 states and 41995 transitions. [2022-12-14 14:13:11,651 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-12-14 14:13:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 19410 states and 41995 transitions. [2022-12-14 14:13:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:13:11,653 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:11,653 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-12-14 14:13:11,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 14:13:11,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:13:11,854 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:13:11,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -321390062, now seen corresponding path program 2 times [2022-12-14 14:13:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:11,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181526249] [2022-12-14 14:13:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:13:12,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:12,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181526249] [2022-12-14 14:13:12,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181526249] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:13:12,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843007849] [2022-12-14 14:13:12,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:13:12,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:13:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:13:12,552 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:13:12,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 14:13:12,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:13:12,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:13:12,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:13:12,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:13:12,955 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-12-14 14:13:12,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:12,988 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-12-14 14:13:13,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,026 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-12-14 14:13:13,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,125 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-12-14 14:13:13,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,144 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-12-14 14:13:13,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,165 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-12-14 14:13:13,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,185 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-12-14 14:13:13,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,212 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-12-14 14:13:13,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:13,274 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-12-14 14:13:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:13:13,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:13:17,410 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| .cse0) (forall ((v_ArrVal_5539 Int) (v_ArrVal_5543 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#race| |c_~#cache~0.base| (store .cse4 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314|) v_ArrVal_5539)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| v_ArrVal_5543))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| .cse0) (forall ((v_ArrVal_5539 Int) (v_ArrVal_5543 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_~#cache~0.base| (store .cse4 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314|) v_ArrVal_5539)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| v_ArrVal_5543))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| Int)) (or (forall ((v_ArrVal_5539 Int) (v_ArrVal_5543 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store .cse4 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314|) v_ArrVal_5539)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| v_ArrVal_5543))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| Int)) (or (forall ((v_ArrVal_5539 Int) (v_ArrVal_5543 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_~#cache~0.base| (store .cse4 (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314|) v_ArrVal_5539)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| v_ArrVal_5543))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_314| .cse0))))) is different from false [2022-12-14 14:13:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-12-14 14:13:39,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843007849] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:13:39,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [164773510] [2022-12-14 14:13:39,762 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:337) 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-12-14 14:13:39,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:13:39,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:13:39,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476390357] [2022-12-14 14:13:39,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:13:39,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:13:39,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:39,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:13:39,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=832, Unknown=6, NotChecked=60, Total=1056 [2022-12-14 14:13:39,764 INFO L87 Difference]: Start difference. First operand 19410 states and 41995 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-12-14 14:13:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:56,667 INFO L93 Difference]: Finished difference Result 24250 states and 51273 transitions. [2022-12-14 14:13:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:13:56,667 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-12-14 14:13:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:56,698 INFO L225 Difference]: With dead ends: 24250 [2022-12-14 14:13:56,698 INFO L226 Difference]: Without dead ends: 24248 [2022-12-14 14:13:56,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=726, Invalid=2812, Unknown=6, NotChecked=116, Total=3660 [2022-12-14 14:13:56,699 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 961 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 4126 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 4879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 4126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 441 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:56,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 367 Invalid, 4879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 4126 Invalid, 0 Unknown, 441 Unchecked, 12.8s Time] [2022-12-14 14:13:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24248 states. [2022-12-14 14:13:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24248 to 19530. [2022-12-14 14:13:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19530 states, 19517 states have (on average 2.1640108623251524) internal successors, (42235), 19529 states have internal predecessors, (42235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19530 states to 19530 states and 42235 transitions. [2022-12-14 14:13:56,982 INFO L78 Accepts]: Start accepts. Automaton has 19530 states and 42235 transitions. Word has length 45 [2022-12-14 14:13:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:56,983 INFO L495 AbstractCegarLoop]: Abstraction has 19530 states and 42235 transitions. [2022-12-14 14:13:56,983 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-12-14 14:13:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 19530 states and 42235 transitions. [2022-12-14 14:13:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:13:56,985 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:56,985 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-12-14 14:13:56,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-14 14:13:57,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-14 14:13:57,186 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:13:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash 700131016, now seen corresponding path program 3 times [2022-12-14 14:13:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:57,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412864517] [2022-12-14 14:13:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:13:57,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:57,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412864517] [2022-12-14 14:13:57,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412864517] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:13:57,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028599902] [2022-12-14 14:13:57,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:13:57,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:13:57,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:13:57,996 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:13:57,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-14 14:13:58,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:13:58,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:13:58,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:13:58,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:13:58,533 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-12-14 14:13:58,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,565 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-12-14 14:13:58,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,647 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-12-14 14:13:58,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,699 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-12-14 14:13:58,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,762 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-12-14 14:13:58,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,786 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-12-14 14:13:58,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,810 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-12-14 14:13:58,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,832 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-12-14 14:13:58,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:58,884 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-12-14 14:13:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:13:58,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:14:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:14:05,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028599902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:14:05,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [216829671] [2022-12-14 14:14:05,790 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:337) 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-12-14 14:14:05,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:14:05,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:14:05,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410169603] [2022-12-14 14:14:05,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:14:05,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:14:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:14:05,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:14:05,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:14:05,792 INFO L87 Difference]: Start difference. First operand 19530 states and 42235 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-12-14 14:14:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:18,438 INFO L93 Difference]: Finished difference Result 24334 states and 51455 transitions. [2022-12-14 14:14:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 14:14:18,439 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-12-14 14:14:18,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:18,466 INFO L225 Difference]: With dead ends: 24334 [2022-12-14 14:14:18,466 INFO L226 Difference]: Without dead ends: 24331 [2022-12-14 14:14:18,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=652, Invalid=2770, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 14:14:18,467 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 924 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 3174 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 3174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:18,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 333 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 3174 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-12-14 14:14:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24331 states. [2022-12-14 14:14:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24331 to 19650. [2022-12-14 14:14:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19650 states, 19637 states have (on average 2.1630086062025766) internal successors, (42475), 19649 states have internal predecessors, (42475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19650 states to 19650 states and 42475 transitions. [2022-12-14 14:14:18,766 INFO L78 Accepts]: Start accepts. Automaton has 19650 states and 42475 transitions. Word has length 45 [2022-12-14 14:14:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:18,766 INFO L495 AbstractCegarLoop]: Abstraction has 19650 states and 42475 transitions. [2022-12-14 14:14:18,766 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-12-14 14:14:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 19650 states and 42475 transitions. [2022-12-14 14:14:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:14:18,768 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:18,768 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-12-14 14:14:18,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-14 14:14:18,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-14 14:14:18,968 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:14:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1791284748, now seen corresponding path program 4 times [2022-12-14 14:14:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:14:18,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54466533] [2022-12-14 14:14:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:14:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:14:19,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:14:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54466533] [2022-12-14 14:14:19,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54466533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:14:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673768945] [2022-12-14 14:14:19,747 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:14:19,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:14:19,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:14:19,748 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:14:19,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 14:14:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:19,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:14:19,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:20,160 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-12-14 14:14:20,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,219 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-12-14 14:14:20,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,259 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-12-14 14:14:20,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,312 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-12-14 14:14:20,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,327 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-12-14 14:14:20,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,344 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-12-14 14:14:20,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,361 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-12-14 14:14:20,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,383 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-12-14 14:14:20,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:20,440 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-12-14 14:14:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:14:20,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:14:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:14:39,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673768945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:14:39,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1344440736] [2022-12-14 14:14:39,408 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:337) 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-12-14 14:14:39,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:14:39,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:14:39,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708476543] [2022-12-14 14:14:39,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:14:39,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:14:39,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:14:39,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:14:39,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=896, Unknown=3, NotChecked=0, Total=1056 [2022-12-14 14:14:39,409 INFO L87 Difference]: Start difference. First operand 19650 states and 42475 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-12-14 14:14:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:58,884 INFO L93 Difference]: Finished difference Result 24617 states and 52039 transitions. [2022-12-14 14:14:58,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 14:14:58,885 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-12-14 14:14:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:58,917 INFO L225 Difference]: With dead ends: 24617 [2022-12-14 14:14:58,917 INFO L226 Difference]: Without dead ends: 24613 [2022-12-14 14:14:58,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=648, Invalid=2771, Unknown=3, NotChecked=0, Total=3422 [2022-12-14 14:14:58,918 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 854 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 4135 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 4524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 4135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:58,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 455 Invalid, 4524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 4135 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2022-12-14 14:14:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24613 states. [2022-12-14 14:14:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24613 to 19554. [2022-12-14 14:14:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19554 states, 19541 states have (on average 2.1638094263343737) internal successors, (42283), 19553 states have internal predecessors, (42283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19554 states to 19554 states and 42283 transitions. [2022-12-14 14:14:59,199 INFO L78 Accepts]: Start accepts. Automaton has 19554 states and 42283 transitions. Word has length 45 [2022-12-14 14:14:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:59,199 INFO L495 AbstractCegarLoop]: Abstraction has 19554 states and 42283 transitions. [2022-12-14 14:14:59,199 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-12-14 14:14:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 19554 states and 42283 transitions. [2022-12-14 14:14:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:14:59,201 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:59,201 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-12-14 14:14:59,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-14 14:14:59,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-14 14:14:59,402 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:14:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1743394662, now seen corresponding path program 5 times [2022-12-14 14:14:59,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:14:59,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653752422] [2022-12-14 14:14:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:14:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:15:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:15:00,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:15:00,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653752422] [2022-12-14 14:15:00,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653752422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:15:00,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242871477] [2022-12-14 14:15:00,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:15:00,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:15:00,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:15:00,281 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:15:00,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-14 14:15:00,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:15:00,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:15:00,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-14 14:15:00,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:15:00,742 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-12-14 14:15:00,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,775 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-12-14 14:15:00,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,811 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-12-14 14:15:00,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,868 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-12-14 14:15:00,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,938 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-12-14 14:15:00,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,958 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-12-14 14:15:00,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:00,981 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-12-14 14:15:01,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,006 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-12-14 14:15:01,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:15:01,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2022-12-14 14:15:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:15:07,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:15:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:15:10,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242871477] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:15:10,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1585493656] [2022-12-14 14:15:10,136 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:337) 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-12-14 14:15:10,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:15:10,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 37 [2022-12-14 14:15:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364088969] [2022-12-14 14:15:10,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:15:10,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 14:15:10,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:15:10,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 14:15:10,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1163, Unknown=2, NotChecked=0, Total=1406 [2022-12-14 14:15:10,137 INFO L87 Difference]: Start difference. First operand 19554 states and 42283 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:15:14,326 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-12-14 14:15:20,818 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-12-14 14:15:23,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 [0] [2022-12-14 14:15:28,108 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-12-14 14:15:31,248 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-12-14 14:15:33,443 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-12-14 14:15:37,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-12-14 14:15:39,532 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-12-14 14:15:50,919 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-12-14 14:15:53,213 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-12-14 14:15:55,241 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-12-14 14:15:58,051 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-12-14 14:16:00,117 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-12-14 14:16:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:16:00,188 INFO L93 Difference]: Finished difference Result 25543 states and 53753 transitions. [2022-12-14 14:16:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 14:16:00,189 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-12-14 14:16:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:16:00,223 INFO L225 Difference]: With dead ends: 25543 [2022-12-14 14:16:00,223 INFO L226 Difference]: Without dead ends: 25539 [2022-12-14 14:16:00,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=976, Invalid=3847, Unknown=7, NotChecked=0, Total=4830 [2022-12-14 14:16:00,224 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 990 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 5023 mSolverCounterSat, 226 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 5262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 5023 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:16:00,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 355 Invalid, 5262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 5023 Invalid, 13 Unknown, 0 Unchecked, 34.0s Time] [2022-12-14 14:16:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25539 states. [2022-12-14 14:16:00,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25539 to 19062. [2022-12-14 14:16:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19062 states, 19049 states have (on average 2.1649430416294817) internal successors, (41240), 19061 states have internal predecessors, (41240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:16:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19062 states to 19062 states and 41240 transitions. [2022-12-14 14:16:00,518 INFO L78 Accepts]: Start accepts. Automaton has 19062 states and 41240 transitions. Word has length 45 [2022-12-14 14:16:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:16:00,518 INFO L495 AbstractCegarLoop]: Abstraction has 19062 states and 41240 transitions. [2022-12-14 14:16:00,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:16:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 19062 states and 41240 transitions. [2022-12-14 14:16:00,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:16:00,520 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:16:00,520 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-12-14 14:16:00,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-14 14:16:00,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:00,721 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:16:00,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:16:00,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1495881094, now seen corresponding path program 1 times [2022-12-14 14:16:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:16:00,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612129170] [2022-12-14 14:16:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:16:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:16:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:16:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:01,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:16:01,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612129170] [2022-12-14 14:16:01,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612129170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:16:01,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843209434] [2022-12-14 14:16:01,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:16:01,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:16:01,191 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:16:01,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-14 14:16:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:16:01,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 14:16:01,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:16:01,682 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-12-14 14:16:01,724 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-12-14 14:16:01,765 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-12-14 14:16:01,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:01,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:01,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:01,829 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-12-14 14:16:01,868 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-12-14 14:16:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:01,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:16:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:02,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843209434] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:16:02,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [907291748] [2022-12-14 14:16:02,519 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:337) 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-12-14 14:16:02,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:16:02,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-14 14:16:02,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921042372] [2022-12-14 14:16:02,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:16:02,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:16:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:16:02,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:16:02,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:16:02,520 INFO L87 Difference]: Start difference. First operand 19062 states and 41240 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-12-14 14:16:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:16:06,879 INFO L93 Difference]: Finished difference Result 23796 states and 50147 transitions. [2022-12-14 14:16:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-14 14:16:06,880 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-12-14 14:16:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:16:06,910 INFO L225 Difference]: With dead ends: 23796 [2022-12-14 14:16:06,910 INFO L226 Difference]: Without dead ends: 23796 [2022-12-14 14:16:06,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1284, Invalid=5036, Unknown=0, NotChecked=0, Total=6320 [2022-12-14 14:16:06,911 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 1435 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 3059 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:16:06,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 317 Invalid, 3194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 3059 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-14 14:16:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23796 states. [2022-12-14 14:16:07,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23796 to 18986. [2022-12-14 14:16:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18986 states, 18973 states have (on average 2.1639171454171717) internal successors, (41056), 18985 states have internal predecessors, (41056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:16:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18986 states to 18986 states and 41056 transitions. [2022-12-14 14:16:07,233 INFO L78 Accepts]: Start accepts. Automaton has 18986 states and 41056 transitions. Word has length 45 [2022-12-14 14:16:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:16:07,233 INFO L495 AbstractCegarLoop]: Abstraction has 18986 states and 41056 transitions. [2022-12-14 14:16:07,233 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-12-14 14:16:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 18986 states and 41056 transitions. [2022-12-14 14:16:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:16:07,234 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:16:07,234 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-12-14 14:16:07,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-14 14:16:07,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:07,435 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:16:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:16:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1144355986, now seen corresponding path program 2 times [2022-12-14 14:16:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:16:07,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111936470] [2022-12-14 14:16:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:16:07,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:16:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:16:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:08,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:16:08,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111936470] [2022-12-14 14:16:08,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111936470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:16:08,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368765106] [2022-12-14 14:16:08,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:16:08,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:16:08,068 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:16:08,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-14 14:16:08,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:16:08,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:16:08,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 14:16:08,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:16:08,344 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-12-14 14:16:08,392 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:16:08,393 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-12-14 14:16:08,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:16:08,511 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-12-14 14:16:08,557 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-12-14 14:16:08,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-14 14:16:08,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:08,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:08,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:08,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:08,665 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-12-14 14:16:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:16:08,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:16:09,467 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-12-14 14:16:09,470 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-12-14 14:16:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:16:09,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368765106] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:16:09,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:16:09,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-12-14 14:16:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115996802] [2022-12-14 14:16:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:16:09,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:16:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:16:09,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:16:09,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:16:09,474 INFO L87 Difference]: Start difference. First operand 18986 states and 41056 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-12-14 14:16:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:16:13,404 INFO L93 Difference]: Finished difference Result 30446 states and 65693 transitions. [2022-12-14 14:16:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:16:13,405 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-12-14 14:16:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:16:13,447 INFO L225 Difference]: With dead ends: 30446 [2022-12-14 14:16:13,447 INFO L226 Difference]: Without dead ends: 30446 [2022-12-14 14:16:13,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:16:13,447 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 163 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:16:13,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 52 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 14:16:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30446 states. [2022-12-14 14:16:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30446 to 20053. [2022-12-14 14:16:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20053 states, 20040 states have (on average 2.1559880239520957) internal successors, (43206), 20052 states have internal predecessors, (43206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:16:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20053 states to 20053 states and 43206 transitions. [2022-12-14 14:16:13,761 INFO L78 Accepts]: Start accepts. Automaton has 20053 states and 43206 transitions. Word has length 45 [2022-12-14 14:16:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:16:13,761 INFO L495 AbstractCegarLoop]: Abstraction has 20053 states and 43206 transitions. [2022-12-14 14:16:13,761 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-12-14 14:16:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 20053 states and 43206 transitions. [2022-12-14 14:16:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:16:13,763 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:16:13,763 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-12-14 14:16:13,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-14 14:16:13,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-14 14:16:13,964 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:16:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:16:13,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1005613420, now seen corresponding path program 4 times [2022-12-14 14:16:13,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:16:13,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221530673] [2022-12-14 14:16:13,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:16:13,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:16:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:16:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:14,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:16:14,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221530673] [2022-12-14 14:16:14,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221530673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:16:14,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990196120] [2022-12-14 14:16:14,477 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:16:14,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:16:14,478 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:16:14,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-14 14:16:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:16:14,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:16:14,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:16:14,984 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-12-14 14:16:15,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:16:15,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,062 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-12-14 14:16:15,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,111 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-12-14 14:16:15,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:15,171 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-12-14 14:16:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:15,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:16:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:16,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990196120] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:16:16,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1943590742] [2022-12-14 14:16:16,137 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:337) 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-12-14 14:16:16,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:16:16,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:16:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247206711] [2022-12-14 14:16:16,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:16:16,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:16:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:16:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:16:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:16:16,139 INFO L87 Difference]: Start difference. First operand 20053 states and 43206 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-12-14 14:16:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:16:29,736 INFO L93 Difference]: Finished difference Result 28071 states and 58974 transitions. [2022-12-14 14:16:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 14:16:29,737 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-12-14 14:16:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:16:29,773 INFO L225 Difference]: With dead ends: 28071 [2022-12-14 14:16:29,773 INFO L226 Difference]: Without dead ends: 28067 [2022-12-14 14:16:29,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=685, Invalid=3097, Unknown=0, NotChecked=0, Total=3782 [2022-12-14 14:16:29,773 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1129 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 4529 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 4655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 4529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:16:29,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 300 Invalid, 4655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 4529 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2022-12-14 14:16:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28067 states. [2022-12-14 14:16:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28067 to 19677. [2022-12-14 14:16:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19677 states, 19664 states have (on average 2.15363100081367) internal successors, (42349), 19676 states have internal predecessors, (42349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:16:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19677 states to 19677 states and 42349 transitions. [2022-12-14 14:16:30,058 INFO L78 Accepts]: Start accepts. Automaton has 19677 states and 42349 transitions. Word has length 45 [2022-12-14 14:16:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:16:30,058 INFO L495 AbstractCegarLoop]: Abstraction has 19677 states and 42349 transitions. [2022-12-14 14:16:30,058 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-12-14 14:16:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 19677 states and 42349 transitions. [2022-12-14 14:16:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:16:30,060 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:16:30,060 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-12-14 14:16:30,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-14 14:16:30,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-14 14:16:30,261 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:16:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:16:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1377591660, now seen corresponding path program 6 times [2022-12-14 14:16:30,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:16:30,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363282241] [2022-12-14 14:16:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:16:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:16:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:16:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:31,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:16:31,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363282241] [2022-12-14 14:16:31,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363282241] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:16:31,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190364848] [2022-12-14 14:16:31,216 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:16:31,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:31,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:16:31,217 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:16:31,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-14 14:16:31,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:16:31,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:16:31,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 14:16:31,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:16:31,872 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-12-14 14:16:31,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:31,912 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-12-14 14:16:31,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:31,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:31,965 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-12-14 14:16:32,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,032 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-12-14 14:16:32,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,140 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-12-14 14:16:32,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,168 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-12-14 14:16:32,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,189 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-12-14 14:16:32,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,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-12-14 14:16:32,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:32,283 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-12-14 14:16:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:32,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:16:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:34,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190364848] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:16:34,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1530014103] [2022-12-14 14:16:34,260 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:337) 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-12-14 14:16:34,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:16:34,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-14 14:16:34,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515772473] [2022-12-14 14:16:34,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:16:34,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 14:16:34,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:16:34,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 14:16:34,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:16:34,261 INFO L87 Difference]: Start difference. First operand 19677 states and 42349 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-12-14 14:16:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:16:46,600 INFO L93 Difference]: Finished difference Result 24554 states and 51667 transitions. [2022-12-14 14:16:46,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:16:46,601 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-12-14 14:16:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:16:46,630 INFO L225 Difference]: With dead ends: 24554 [2022-12-14 14:16:46,631 INFO L226 Difference]: Without dead ends: 24550 [2022-12-14 14:16:46,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=659, Invalid=3001, Unknown=0, NotChecked=0, Total=3660 [2022-12-14 14:16:46,631 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 861 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 4907 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 5102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 4907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:16:46,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 352 Invalid, 5102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 4907 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-12-14 14:16:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24550 states. [2022-12-14 14:16:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24550 to 19506. [2022-12-14 14:16:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19506 states, 19493 states have (on average 2.149592161288668) internal successors, (41902), 19505 states have internal predecessors, (41902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:16:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19506 states to 19506 states and 41902 transitions. [2022-12-14 14:16:46,923 INFO L78 Accepts]: Start accepts. Automaton has 19506 states and 41902 transitions. Word has length 45 [2022-12-14 14:16:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:16:46,924 INFO L495 AbstractCegarLoop]: Abstraction has 19506 states and 41902 transitions. [2022-12-14 14:16:46,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-12-14 14:16:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19506 states and 41902 transitions. [2022-12-14 14:16:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:16:46,925 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:16:46,925 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-12-14 14:16:46,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-14 14:16:47,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:47,126 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:16:47,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:16:47,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1130078092, now seen corresponding path program 2 times [2022-12-14 14:16:47,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:16:47,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041264918] [2022-12-14 14:16:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:16:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:16:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:16:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:47,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:16:47,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041264918] [2022-12-14 14:16:47,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041264918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:16:47,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42230751] [2022-12-14 14:16:47,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:16:47,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:47,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:16:47,597 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:16:47,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-14 14:16:47,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:16:47,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:16:47,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 14:16:47,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:16:47,881 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-12-14 14:16:47,930 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:16:47,931 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-12-14 14:16:48,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:16:48,070 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-12-14 14:16:48,118 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-12-14 14:16:48,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:48,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:48,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:48,175 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-12-14 14:16:48,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:16:48,212 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-12-14 14:16:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:16:48,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:16:48,790 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-12-14 14:16:48,793 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-12-14 14:16:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 14:16:48,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42230751] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:16:48,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:16:48,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 25 [2022-12-14 14:16:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643472772] [2022-12-14 14:16:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:16:48,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:16:48,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:16:48,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:16:48,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:16:48,796 INFO L87 Difference]: Start difference. First operand 19506 states and 41902 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-12-14 14:16:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:16:52,445 INFO L93 Difference]: Finished difference Result 30522 states and 65656 transitions. [2022-12-14 14:16:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:16:52,446 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-12-14 14:16:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:16:52,488 INFO L225 Difference]: With dead ends: 30522 [2022-12-14 14:16:52,488 INFO L226 Difference]: Without dead ends: 30522 [2022-12-14 14:16:52,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:16:52,489 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:16:52,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 57 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 14:16:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30522 states. [2022-12-14 14:16:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30522 to 20635. [2022-12-14 14:16:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20635 states, 20622 states have (on average 2.1459121326738435) internal successors, (44253), 20634 states have internal predecessors, (44253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:16:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20635 states to 20635 states and 44253 transitions. [2022-12-14 14:16:52,843 INFO L78 Accepts]: Start accepts. Automaton has 20635 states and 44253 transitions. Word has length 45 [2022-12-14 14:16:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:16:52,843 INFO L495 AbstractCegarLoop]: Abstraction has 20635 states and 44253 transitions. [2022-12-14 14:16:52,843 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-12-14 14:16:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 20635 states and 44253 transitions. [2022-12-14 14:16:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:16:52,845 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:16:52,845 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-12-14 14:16:52,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-14 14:16:53,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:53,046 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:16:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:16:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1130053912, now seen corresponding path program 3 times [2022-12-14 14:16:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:16:53,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342356731] [2022-12-14 14:16:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:16:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:16:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:16:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:53,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:16:53,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342356731] [2022-12-14 14:16:53,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342356731] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:16:53,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063293954] [2022-12-14 14:16:53,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:16:53,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:16:53,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:16:53,710 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:16:53,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-14 14:16:54,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:16:54,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:16:54,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-14 14:16:54,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:16:54,406 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-12-14 14:16:54,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:16:54,500 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-12-14 14:16:54,554 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-12-14 14:16:54,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:54,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:54,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:54,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:16:54,621 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-12-14 14:16:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:54,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:16:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:16:55,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063293954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:16:55,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1836902544] [2022-12-14 14:16:55,599 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:337) 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-12-14 14:16:55,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:16:55,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 14:16:55,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804342113] [2022-12-14 14:16:55,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:16:55,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:16:55,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:16:55,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:16:55,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:16:55,600 INFO L87 Difference]: Start difference. First operand 20635 states and 44253 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-12-14 14:17:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:17:05,788 INFO L93 Difference]: Finished difference Result 25188 states and 53009 transitions. [2022-12-14 14:17:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 14:17:05,789 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-12-14 14:17:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:17:05,826 INFO L225 Difference]: With dead ends: 25188 [2022-12-14 14:17:05,826 INFO L226 Difference]: Without dead ends: 25188 [2022-12-14 14:17:05,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=802, Invalid=3488, Unknown=0, NotChecked=0, Total=4290 [2022-12-14 14:17:05,827 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 852 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 4076 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 4152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:17:05,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 300 Invalid, 4152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 4076 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-12-14 14:17:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25188 states. [2022-12-14 14:17:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25188 to 20675. [2022-12-14 14:17:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20675 states, 20662 states have (on average 2.146065240538186) internal successors, (44342), 20674 states have internal predecessors, (44342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:17:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20675 states to 20675 states and 44342 transitions. [2022-12-14 14:17:06,162 INFO L78 Accepts]: Start accepts. Automaton has 20675 states and 44342 transitions. Word has length 45 [2022-12-14 14:17:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:17:06,162 INFO L495 AbstractCegarLoop]: Abstraction has 20675 states and 44342 transitions. [2022-12-14 14:17:06,162 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-12-14 14:17:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 20675 states and 44342 transitions. [2022-12-14 14:17:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 14:17:06,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:17:06,164 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-12-14 14:17:06,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-14 14:17:06,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:17:06,365 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-14 14:17:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:17:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash -617377612, now seen corresponding path program 3 times [2022-12-14 14:17:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:17:06,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905042354] [2022-12-14 14:17:06,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:17:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:17:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:17:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 14:17:07,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:17:07,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905042354] [2022-12-14 14:17:07,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905042354] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:17:07,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427187596] [2022-12-14 14:17:07,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:17:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:17:07,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:17:07,202 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:17:07,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d474195c-9028-434f-9381-80d5de9e1dd3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-14 14:17:07,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:17:07,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:17:07,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 14:17:07,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:17:07,736 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-12-14 14:17:07,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:07,809 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-12-14 14:17:07,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:07,821 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-12-14 14:17:07,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:07,833 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-12-14 14:17:07,843 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-12-14 14:17:07,883 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-12-14 14:17:07,929 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-12-14 14:17:07,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:07,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:07,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:07,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:07,989 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-12-14 14:17:08,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:08,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:08,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:08,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:08,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:08,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:08,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:08,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:17:08,085 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