./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/barrier_2t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc 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_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/barrier_2t.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 f16bd48636db1837ea8e0ca595ad8610f40d584c5526c4d4feced86ef6fdf308 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:17:22,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:17:22,484 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-12-02 19:17:22,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:17:22,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:17:22,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:17:22,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:17:22,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:17:22,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:17:22,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:17:22,517 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:17:22,517 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:17:22,518 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:17:22,518 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:17:22,519 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:17:22,519 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:17:22,520 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:17:22,520 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:17:22,521 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:17:22,522 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:17:22,522 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:17:22,526 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:17:22,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:17:22,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:17:22,528 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:17:22,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:17:22,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:17:22,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:17:22,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:17:22,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:17:22,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:17:22,531 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-12-02 19:17:22,531 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:17:22,531 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:17:22,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:17:22,532 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:17:22,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:17:22,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:17:22,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:17:22,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:17:22,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:17:22,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:17:22,533 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:17:22,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:17:22,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:17:22,534 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:17:22,535 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:17:22,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:17:22,535 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/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_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> f16bd48636db1837ea8e0ca595ad8610f40d584c5526c4d4feced86ef6fdf308 [2023-12-02 19:17:22,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:17:22,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:17:22,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:17:22,770 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:17:22,770 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:17:22,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-divine/barrier_2t.i [2023-12-02 19:17:25,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:17:25,746 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:17:25,747 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/sv-benchmarks/c/pthread-divine/barrier_2t.i [2023-12-02 19:17:25,763 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/data/953ca5f5e/2f30d522165b4d22be40d2ec3e7cda2e/FLAGdd30f1650 [2023-12-02 19:17:25,777 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/data/953ca5f5e/2f30d522165b4d22be40d2ec3e7cda2e [2023-12-02 19:17:25,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:17:25,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:17:25,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:17:25,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:17:25,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:17:25,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:17:25" (1/1) ... [2023-12-02 19:17:25,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e505ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:25, skipping insertion in model container [2023-12-02 19:17:25,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:17:25" (1/1) ... [2023-12-02 19:17:25,839 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:17:26,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:17:26,169 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:17:26,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:17:26,264 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:17:26,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26 WrapperNode [2023-12-02 19:17:26,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:17:26,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:17:26,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:17:26,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:17:26,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,387 INFO L138 Inliner]: procedures = 174, calls = 94, calls flagged for inlining = 19, calls inlined = 31, statements flattened = 1074 [2023-12-02 19:17:26,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:17:26,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:17:26,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:17:26,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:17:26,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:17:26,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:17:26,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:17:26,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:17:26,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (1/1) ... [2023-12-02 19:17:26,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:17:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:17:26,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:17:26,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:17:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 19:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2023-12-02 19:17:26,568 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2023-12-02 19:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:17:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:17:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:17:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 19:17:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:17:26,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:17:26,571 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 19:17:26,741 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:17:26,743 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:17:28,054 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:17:28,113 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:17:28,113 INFO L309 CfgBuilder]: Removed 20 assume(true) statements. [2023-12-02 19:17:28,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:17:28 BoogieIcfgContainer [2023-12-02 19:17:28,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:17:28,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:17:28,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:17:28,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:17:28,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:17:25" (1/3) ... [2023-12-02 19:17:28,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da657a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:17:28, skipping insertion in model container [2023-12-02 19:17:28,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:17:26" (2/3) ... [2023-12-02 19:17:28,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da657a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:17:28, skipping insertion in model container [2023-12-02 19:17:28,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:17:28" (3/3) ... [2023-12-02 19:17:28,124 INFO L112 eAbstractionObserver]: Analyzing ICFG barrier_2t.i [2023-12-02 19:17:28,133 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 19:17:28,143 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:17:28,143 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2023-12-02 19:17:28,143 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 19:17:28,382 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-02 19:17:28,430 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 1134 places, 1224 transitions, 2455 flow [2023-12-02 19:17:33,308 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 257543 states, 255239 states have (on average 2.1858610948953725) internal successors, (557917), 257542 states have internal predecessors, (557917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:33,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:17:33,338 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=LoopHeads, 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;@29daacde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:17:33,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 143 error locations. [2023-12-02 19:17:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 257543 states, 255239 states have (on average 2.1858610948953725) internal successors, (557917), 257542 states have internal predecessors, (557917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 19:17:33,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:17:33,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:17:33,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:17:33,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:17:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2117681182, now seen corresponding path program 1 times [2023-12-02 19:17:33,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:17:33,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206022899] [2023-12-02 19:17:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:17:33,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:17:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:17:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:17:34,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:17:34,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206022899] [2023-12-02 19:17:34,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206022899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:17:34,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:17:34,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:17:34,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616566862] [2023-12-02 19:17:34,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:17:34,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:17:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:17:34,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:17:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:17:34,716 INFO L87 Difference]: Start difference. First operand has 257543 states, 255239 states have (on average 2.1858610948953725) internal successors, (557917), 257542 states have internal predecessors, (557917), 0 states have call successors, (0), 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 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:17:37,932 INFO L93 Difference]: Finished difference Result 235782 states and 482115 transitions. [2023-12-02 19:17:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:17:37,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-02 19:17:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:17:38,756 INFO L225 Difference]: With dead ends: 235782 [2023-12-02 19:17:38,756 INFO L226 Difference]: Without dead ends: 234035 [2023-12-02 19:17:38,758 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 [2023-12-02 19:17:38,762 INFO L413 NwaCegarLoop]: 1077 mSDtfsCounter, 1 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:17:38,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2949 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 19:17:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234035 states. [2023-12-02 19:17:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234035 to 234035. [2023-12-02 19:17:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234035 states, 230726 states have (on average 2.0745733033988367) internal successors, (478658), 234034 states have internal predecessors, (478658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234035 states to 234035 states and 478658 transitions. [2023-12-02 19:17:45,009 INFO L78 Accepts]: Start accepts. Automaton has 234035 states and 478658 transitions. Word has length 40 [2023-12-02 19:17:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:17:45,009 INFO L495 AbstractCegarLoop]: Abstraction has 234035 states and 478658 transitions. [2023-12-02 19:17:45,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 234035 states and 478658 transitions. [2023-12-02 19:17:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 19:17:45,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:17:45,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:17:45,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:17:45,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:17:45,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:17:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1901273083, now seen corresponding path program 1 times [2023-12-02 19:17:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:17:45,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402571071] [2023-12-02 19:17:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:17:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:17:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:17:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:17:45,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:17:45,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402571071] [2023-12-02 19:17:45,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402571071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:17:45,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:17:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:17:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032462490] [2023-12-02 19:17:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:17:45,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:17:45,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:17:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:17:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:17:45,078 INFO L87 Difference]: Start difference. First operand 234035 states and 478658 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:17:46,699 INFO L93 Difference]: Finished difference Result 234064 states and 478687 transitions. [2023-12-02 19:17:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:17:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-02 19:17:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:17:47,497 INFO L225 Difference]: With dead ends: 234064 [2023-12-02 19:17:47,497 INFO L226 Difference]: Without dead ends: 234064 [2023-12-02 19:17:47,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:17:47,499 INFO L413 NwaCegarLoop]: 1055 mSDtfsCounter, 28 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:17:47,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2105 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:17:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234064 states. [2023-12-02 19:17:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234064 to 234036. [2023-12-02 19:17:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234036 states, 230727 states have (on average 2.0745686460622292) internal successors, (478659), 234035 states have internal predecessors, (478659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234036 states to 234036 states and 478659 transitions. [2023-12-02 19:17:52,868 INFO L78 Accepts]: Start accepts. Automaton has 234036 states and 478659 transitions. Word has length 46 [2023-12-02 19:17:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:17:52,868 INFO L495 AbstractCegarLoop]: Abstraction has 234036 states and 478659 transitions. [2023-12-02 19:17:52,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 234036 states and 478659 transitions. [2023-12-02 19:17:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 19:17:52,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:17:52,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:17:52,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:17:52,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:17:52,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:17:52,872 INFO L85 PathProgramCache]: Analyzing trace with hash 842780391, now seen corresponding path program 1 times [2023-12-02 19:17:52,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:17:52,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176849830] [2023-12-02 19:17:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:17:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:17:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:17:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:17:53,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:17:53,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176849830] [2023-12-02 19:17:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176849830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:17:53,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:17:53,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:17:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154432126] [2023-12-02 19:17:53,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:17:53,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:17:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:17:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:17:53,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:17:53,252 INFO L87 Difference]: Start difference. First operand 234036 states and 478659 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:17:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:17:56,037 INFO L93 Difference]: Finished difference Result 234035 states and 478658 transitions. [2023-12-02 19:17:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:17:56,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2023-12-02 19:17:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:17:56,722 INFO L225 Difference]: With dead ends: 234035 [2023-12-02 19:17:56,722 INFO L226 Difference]: Without dead ends: 234035 [2023-12-02 19:17:56,723 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 [2023-12-02 19:17:56,724 INFO L413 NwaCegarLoop]: 1073 mSDtfsCounter, 1 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3557 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:17:56,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3557 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 19:17:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234035 states. [2023-12-02 19:18:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234035 to 234035. [2023-12-02 19:18:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234035 states, 230727 states have (on average 2.074564311935751) internal successors, (478658), 234034 states have internal predecessors, (478658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234035 states to 234035 states and 478658 transitions. [2023-12-02 19:18:01,761 INFO L78 Accepts]: Start accepts. Automaton has 234035 states and 478658 transitions. Word has length 48 [2023-12-02 19:18:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:18:01,762 INFO L495 AbstractCegarLoop]: Abstraction has 234035 states and 478658 transitions. [2023-12-02 19:18:01,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 234035 states and 478658 transitions. [2023-12-02 19:18:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-02 19:18:01,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:18:01,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:18:01,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 19:18:01,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:18:01,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:18:01,765 INFO L85 PathProgramCache]: Analyzing trace with hash -844519545, now seen corresponding path program 1 times [2023-12-02 19:18:01,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:18:01,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46338290] [2023-12-02 19:18:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:18:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:18:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:18:02,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:18:02,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46338290] [2023-12-02 19:18:02,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46338290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:18:02,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:18:02,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:18:02,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152669789] [2023-12-02 19:18:02,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:18:02,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:18:02,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:18:02,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:18:02,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:18:02,221 INFO L87 Difference]: Start difference. First operand 234035 states and 478658 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 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) [2023-12-02 19:18:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:18:04,752 INFO L93 Difference]: Finished difference Result 234034 states and 478657 transitions. [2023-12-02 19:18:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:18:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 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 56 [2023-12-02 19:18:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:18:05,409 INFO L225 Difference]: With dead ends: 234034 [2023-12-02 19:18:05,409 INFO L226 Difference]: Without dead ends: 234034 [2023-12-02 19:18:05,409 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 [2023-12-02 19:18:05,411 INFO L413 NwaCegarLoop]: 1072 mSDtfsCounter, 2 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:18:05,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2314 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 19:18:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234034 states. [2023-12-02 19:18:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234034 to 234034. [2023-12-02 19:18:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234034 states, 230727 states have (on average 2.0745599778092725) internal successors, (478657), 234033 states have internal predecessors, (478657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234034 states to 234034 states and 478657 transitions. [2023-12-02 19:18:11,500 INFO L78 Accepts]: Start accepts. Automaton has 234034 states and 478657 transitions. Word has length 56 [2023-12-02 19:18:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:18:11,501 INFO L495 AbstractCegarLoop]: Abstraction has 234034 states and 478657 transitions. [2023-12-02 19:18:11,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 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) [2023-12-02 19:18:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 234034 states and 478657 transitions. [2023-12-02 19:18:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-02 19:18:11,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:18:11,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:18:11,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 19:18:11,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:18:11,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:18:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1606773151, now seen corresponding path program 1 times [2023-12-02 19:18:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:18:11,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110018374] [2023-12-02 19:18:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:18:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:18:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:18:11,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:18:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110018374] [2023-12-02 19:18:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110018374] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:18:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962815695] [2023-12-02 19:18:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:11,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:18:11,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:18:11,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:18:11,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:18:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:18:11,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:18:11,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:18:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:18:11,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:18:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:18:12,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962815695] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:18:12,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [419277853] [2023-12-02 19:18:12,081 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:18:12,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:18:12,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-12-02 19:18:12,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069794703] [2023-12-02 19:18:12,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:18:12,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:18:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:18:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:18:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:18:12,089 INFO L87 Difference]: Start difference. First operand 234034 states and 478657 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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) [2023-12-02 19:18:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:18:13,861 INFO L93 Difference]: Finished difference Result 234062 states and 478685 transitions. [2023-12-02 19:18:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:18:13,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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 74 [2023-12-02 19:18:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:18:14,478 INFO L225 Difference]: With dead ends: 234062 [2023-12-02 19:18:14,479 INFO L226 Difference]: Without dead ends: 234062 [2023-12-02 19:18:14,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:18:14,480 INFO L413 NwaCegarLoop]: 1055 mSDtfsCounter, 26 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:18:14,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3149 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:18:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234062 states. [2023-12-02 19:18:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234062 to 234062. [2023-12-02 19:18:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234062 states, 230755 states have (on average 2.074429589824706) internal successors, (478685), 234061 states have internal predecessors, (478685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234062 states to 234062 states and 478685 transitions. [2023-12-02 19:18:21,080 INFO L78 Accepts]: Start accepts. Automaton has 234062 states and 478685 transitions. Word has length 74 [2023-12-02 19:18:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:18:21,080 INFO L495 AbstractCegarLoop]: Abstraction has 234062 states and 478685 transitions. [2023-12-02 19:18:21,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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) [2023-12-02 19:18:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 234062 states and 478685 transitions. [2023-12-02 19:18:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-02 19:18:21,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:18:21,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:18:21,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:18:21,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:18:21,289 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:18:21,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:18:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1317967171, now seen corresponding path program 2 times [2023-12-02 19:18:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:18:21,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397308615] [2023-12-02 19:18:21,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:18:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:18:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:18:22,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:18:22,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397308615] [2023-12-02 19:18:22,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397308615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:18:22,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:18:22,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:18:22,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209890815] [2023-12-02 19:18:22,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:18:22,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:18:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:18:22,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:18:22,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:18:22,052 INFO L87 Difference]: Start difference. First operand 234062 states and 478685 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:18:24,557 INFO L93 Difference]: Finished difference Result 234061 states and 478684 transitions. [2023-12-02 19:18:24,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:18:24,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 102 [2023-12-02 19:18:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:18:25,229 INFO L225 Difference]: With dead ends: 234061 [2023-12-02 19:18:25,229 INFO L226 Difference]: Without dead ends: 234061 [2023-12-02 19:18:25,230 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 [2023-12-02 19:18:25,231 INFO L413 NwaCegarLoop]: 1071 mSDtfsCounter, 3 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:18:25,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2327 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 19:18:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234061 states. [2023-12-02 19:18:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234061 to 234061. [2023-12-02 19:18:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234061 states, 230755 states have (on average 2.0744252562241337) internal successors, (478684), 234060 states have internal predecessors, (478684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234061 states to 234061 states and 478684 transitions. [2023-12-02 19:18:31,094 INFO L78 Accepts]: Start accepts. Automaton has 234061 states and 478684 transitions. Word has length 102 [2023-12-02 19:18:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:18:31,094 INFO L495 AbstractCegarLoop]: Abstraction has 234061 states and 478684 transitions. [2023-12-02 19:18:31,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 234061 states and 478684 transitions. [2023-12-02 19:18:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 19:18:31,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:18:31,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:18:31,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 19:18:31,098 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:18:31,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:18:31,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1404414997, now seen corresponding path program 1 times [2023-12-02 19:18:31,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:18:31,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394530255] [2023-12-02 19:18:31,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:31,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:18:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:18:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:18:31,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:18:31,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394530255] [2023-12-02 19:18:31,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394530255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:18:31,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:18:31,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:18:31,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689253444] [2023-12-02 19:18:31,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:18:31,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:18:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:18:31,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:18:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:18:31,588 INFO L87 Difference]: Start difference. First operand 234061 states and 478684 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:18:34,114 INFO L93 Difference]: Finished difference Result 234060 states and 478683 transitions. [2023-12-02 19:18:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:18:34,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 110 [2023-12-02 19:18:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:18:34,731 INFO L225 Difference]: With dead ends: 234060 [2023-12-02 19:18:34,731 INFO L226 Difference]: Without dead ends: 234060 [2023-12-02 19:18:34,732 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 [2023-12-02 19:18:34,732 INFO L413 NwaCegarLoop]: 1070 mSDtfsCounter, 2 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2954 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:18:34,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2954 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 19:18:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234060 states. [2023-12-02 19:18:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234060 to 234060. [2023-12-02 19:18:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234060 states, 230755 states have (on average 2.074420922623562) internal successors, (478683), 234059 states have internal predecessors, (478683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234060 states to 234060 states and 478683 transitions. [2023-12-02 19:18:41,452 INFO L78 Accepts]: Start accepts. Automaton has 234060 states and 478683 transitions. Word has length 110 [2023-12-02 19:18:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:18:41,452 INFO L495 AbstractCegarLoop]: Abstraction has 234060 states and 478683 transitions. [2023-12-02 19:18:41,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 234060 states and 478683 transitions. [2023-12-02 19:18:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-02 19:18:41,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:18:41,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:18:41,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 19:18:41,456 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:18:41,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:18:41,456 INFO L85 PathProgramCache]: Analyzing trace with hash 437256052, now seen corresponding path program 1 times [2023-12-02 19:18:41,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:18:41,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186444381] [2023-12-02 19:18:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:41,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:18:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:18:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:18:42,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:18:42,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186444381] [2023-12-02 19:18:42,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186444381] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:18:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:18:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:18:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862197666] [2023-12-02 19:18:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:18:42,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:18:42,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:18:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:18:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:18:42,408 INFO L87 Difference]: Start difference. First operand 234060 states and 478683 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:18:44,167 INFO L93 Difference]: Finished difference Result 234059 states and 478682 transitions. [2023-12-02 19:18:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:18:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2023-12-02 19:18:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:18:45,173 INFO L225 Difference]: With dead ends: 234059 [2023-12-02 19:18:45,173 INFO L226 Difference]: Without dead ends: 234059 [2023-12-02 19:18:45,174 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 [2023-12-02 19:18:45,175 INFO L413 NwaCegarLoop]: 1069 mSDtfsCounter, 3 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:18:45,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1697 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 19:18:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234059 states. [2023-12-02 19:18:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234059 to 234059. [2023-12-02 19:18:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234059 states, 230755 states have (on average 2.0744165890229898) internal successors, (478682), 234058 states have internal predecessors, (478682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234059 states to 234059 states and 478682 transitions. [2023-12-02 19:18:51,173 INFO L78 Accepts]: Start accepts. Automaton has 234059 states and 478682 transitions. Word has length 118 [2023-12-02 19:18:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:18:51,174 INFO L495 AbstractCegarLoop]: Abstraction has 234059 states and 478682 transitions. [2023-12-02 19:18:51,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 234059 states and 478682 transitions. [2023-12-02 19:18:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-02 19:18:51,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:18:51,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:18:51,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 19:18:51,176 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:18:51,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:18:51,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1429372299, now seen corresponding path program 1 times [2023-12-02 19:18:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:18:51,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841646105] [2023-12-02 19:18:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:18:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:18:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:18:51,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:18:51,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841646105] [2023-12-02 19:18:51,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841646105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:18:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:18:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:18:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842556710] [2023-12-02 19:18:51,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:18:51,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:18:51,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:18:51,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:18:51,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:18:51,333 INFO L87 Difference]: Start difference. First operand 234059 states and 478682 transitions. Second operand has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:18:53,364 INFO L93 Difference]: Finished difference Result 234058 states and 478681 transitions. [2023-12-02 19:18:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:18:53,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2023-12-02 19:18:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:18:53,979 INFO L225 Difference]: With dead ends: 234058 [2023-12-02 19:18:53,979 INFO L226 Difference]: Without dead ends: 234058 [2023-12-02 19:18:53,979 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 [2023-12-02 19:18:53,980 INFO L413 NwaCegarLoop]: 1071 mSDtfsCounter, 1 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:18:53,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1699 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 19:18:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234058 states. [2023-12-02 19:18:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234058 to 234058. [2023-12-02 19:18:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234058 states, 230755 states have (on average 2.0744122554224176) internal successors, (478681), 234057 states have internal predecessors, (478681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234058 states to 234058 states and 478681 transitions. [2023-12-02 19:18:59,462 INFO L78 Accepts]: Start accepts. Automaton has 234058 states and 478681 transitions. Word has length 123 [2023-12-02 19:18:59,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:18:59,462 INFO L495 AbstractCegarLoop]: Abstraction has 234058 states and 478681 transitions. [2023-12-02 19:18:59,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:18:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 234058 states and 478681 transitions. [2023-12-02 19:18:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-02 19:18:59,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:18:59,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:18:59,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 19:18:59,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:18:59,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:18:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1435080326, now seen corresponding path program 1 times [2023-12-02 19:18:59,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:18:59,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607689411] [2023-12-02 19:18:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:18:59,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:18:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:19:00,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:19:00,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607689411] [2023-12-02 19:19:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607689411] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:19:00,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:19:00,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:19:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271020525] [2023-12-02 19:19:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:19:00,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:19:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:19:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:19:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:19:00,010 INFO L87 Difference]: Start difference. First operand 234058 states and 478681 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:19:04,749 INFO L93 Difference]: Finished difference Result 238430 states and 487533 transitions. [2023-12-02 19:19:04,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:19:04,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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 142 [2023-12-02 19:19:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:19:05,345 INFO L225 Difference]: With dead ends: 238430 [2023-12-02 19:19:05,345 INFO L226 Difference]: Without dead ends: 238430 [2023-12-02 19:19:05,346 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 [2023-12-02 19:19:05,346 INFO L413 NwaCegarLoop]: 2303 mSDtfsCounter, 1673 mSDsluCounter, 3122 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 5425 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 3263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:19:05,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 5425 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 3263 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-02 19:19:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238430 states. [2023-12-02 19:19:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238430 to 235985. [2023-12-02 19:19:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235985 states, 232684 states have (on average 2.073984459610459) internal successors, (482583), 235984 states have internal predecessors, (482583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235985 states to 235985 states and 482583 transitions. [2023-12-02 19:19:11,276 INFO L78 Accepts]: Start accepts. Automaton has 235985 states and 482583 transitions. Word has length 142 [2023-12-02 19:19:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:19:11,276 INFO L495 AbstractCegarLoop]: Abstraction has 235985 states and 482583 transitions. [2023-12-02 19:19:11,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 235985 states and 482583 transitions. [2023-12-02 19:19:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-02 19:19:11,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:19:11,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:19:11,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 19:19:11,278 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:19:11,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:19:11,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2121773965, now seen corresponding path program 1 times [2023-12-02 19:19:11,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:19:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630844865] [2023-12-02 19:19:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:19:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:19:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:19:11,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:19:11,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630844865] [2023-12-02 19:19:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630844865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:19:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:19:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:19:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115202652] [2023-12-02 19:19:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:19:11,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:19:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:19:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:19:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:19:11,412 INFO L87 Difference]: Start difference. First operand 235985 states and 482583 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:19:12,463 INFO L93 Difference]: Finished difference Result 235554 states and 482139 transitions. [2023-12-02 19:19:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:19:12,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 142 [2023-12-02 19:19:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:19:13,487 INFO L225 Difference]: With dead ends: 235554 [2023-12-02 19:19:13,487 INFO L226 Difference]: Without dead ends: 235554 [2023-12-02 19:19:13,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:19:13,488 INFO L413 NwaCegarLoop]: 1068 mSDtfsCounter, 472 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:19:13,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 2129 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:19:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235554 states. [2023-12-02 19:19:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235554 to 235554. [2023-12-02 19:19:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235554 states, 232297 states have (on average 2.07552831074013) internal successors, (482139), 235553 states have internal predecessors, (482139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235554 states to 235554 states and 482139 transitions. [2023-12-02 19:19:19,097 INFO L78 Accepts]: Start accepts. Automaton has 235554 states and 482139 transitions. Word has length 142 [2023-12-02 19:19:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:19:19,098 INFO L495 AbstractCegarLoop]: Abstraction has 235554 states and 482139 transitions. [2023-12-02 19:19:19,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 235554 states and 482139 transitions. [2023-12-02 19:19:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 19:19:19,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:19:19,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:19:19,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 19:19:19,099 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:19:19,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:19:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -515753635, now seen corresponding path program 1 times [2023-12-02 19:19:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:19:19,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256216228] [2023-12-02 19:19:19,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:19:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:19:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:19:19,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:19:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256216228] [2023-12-02 19:19:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256216228] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:19:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015916007] [2023-12-02 19:19:19,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:19:19,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:19:19,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:19:19,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:19:19,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:19:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:19,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:19:19,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:19:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:19:19,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:19:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015916007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:19:19,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:19:19,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-02 19:19:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519704701] [2023-12-02 19:19:19,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:19:19,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:19:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:19:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:19:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:19:19,553 INFO L87 Difference]: Start difference. First operand 235554 states and 482139 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:19:20,557 INFO L93 Difference]: Finished difference Result 233289 states and 477554 transitions. [2023-12-02 19:19:20,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:19:20,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 144 [2023-12-02 19:19:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:19:21,622 INFO L225 Difference]: With dead ends: 233289 [2023-12-02 19:19:21,622 INFO L226 Difference]: Without dead ends: 233289 [2023-12-02 19:19:21,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:19:21,623 INFO L413 NwaCegarLoop]: 1516 mSDtfsCounter, 930 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:19:21,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 3027 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:19:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233289 states. [2023-12-02 19:19:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233289 to 233289. [2023-12-02 19:19:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233289 states, 230086 states have (on average 2.075545665533757) internal successors, (477554), 233288 states have internal predecessors, (477554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233289 states to 233289 states and 477554 transitions. [2023-12-02 19:19:27,076 INFO L78 Accepts]: Start accepts. Automaton has 233289 states and 477554 transitions. Word has length 144 [2023-12-02 19:19:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:19:27,077 INFO L495 AbstractCegarLoop]: Abstraction has 233289 states and 477554 transitions. [2023-12-02 19:19:27,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 233289 states and 477554 transitions. [2023-12-02 19:19:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-02 19:19:27,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:19:27,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:19:27,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:19:27,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 19:19:27,279 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:19:27,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:19:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2034757142, now seen corresponding path program 1 times [2023-12-02 19:19:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:19:27,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002570937] [2023-12-02 19:19:27,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:19:27,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:19:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:19:27,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:19:27,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002570937] [2023-12-02 19:19:27,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002570937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:19:27,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:19:27,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:19:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222341302] [2023-12-02 19:19:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:19:27,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:19:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:19:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:19:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:19:27,494 INFO L87 Difference]: Start difference. First operand 233289 states and 477554 transitions. Second operand has 3 states, 2 states have (on average 60.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:19:29,645 INFO L93 Difference]: Finished difference Result 234273 states and 479546 transitions. [2023-12-02 19:19:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:19:29,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 60.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 148 [2023-12-02 19:19:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:19:30,201 INFO L225 Difference]: With dead ends: 234273 [2023-12-02 19:19:30,201 INFO L226 Difference]: Without dead ends: 234273 [2023-12-02 19:19:30,202 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 [2023-12-02 19:19:30,202 INFO L413 NwaCegarLoop]: 1371 mSDtfsCounter, 413 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:19:30,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1990 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 19:19:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234273 states. [2023-12-02 19:19:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234273 to 233774. [2023-12-02 19:19:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233774 states, 230571 states have (on average 2.0754388019308587) internal successors, (478536), 233773 states have internal predecessors, (478536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233774 states to 233774 states and 478536 transitions. [2023-12-02 19:19:36,093 INFO L78 Accepts]: Start accepts. Automaton has 233774 states and 478536 transitions. Word has length 148 [2023-12-02 19:19:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:19:36,094 INFO L495 AbstractCegarLoop]: Abstraction has 233774 states and 478536 transitions. [2023-12-02 19:19:36,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 60.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 233774 states and 478536 transitions. [2023-12-02 19:19:36,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-02 19:19:36,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:19:36,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:19:36,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 19:19:36,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:19:36,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:19:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1987663721, now seen corresponding path program 1 times [2023-12-02 19:19:36,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:19:36,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291661691] [2023-12-02 19:19:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:19:36,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:19:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 19:19:37,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:19:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291661691] [2023-12-02 19:19:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291661691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:19:37,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:19:37,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:19:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356477829] [2023-12-02 19:19:37,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:19:37,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:19:37,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:19:37,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:19:37,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:19:37,107 INFO L87 Difference]: Start difference. First operand 233774 states and 478536 transitions. Second operand has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:19:41,230 INFO L93 Difference]: Finished difference Result 237714 states and 486515 transitions. [2023-12-02 19:19:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:19:41,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 152 [2023-12-02 19:19:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:19:41,797 INFO L225 Difference]: With dead ends: 237714 [2023-12-02 19:19:41,797 INFO L226 Difference]: Without dead ends: 237714 [2023-12-02 19:19:41,797 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 [2023-12-02 19:19:41,798 INFO L413 NwaCegarLoop]: 2089 mSDtfsCounter, 1433 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 3136 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 4887 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 3136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:19:41,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1433 Valid, 4887 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 3136 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 19:19:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237714 states. [2023-12-02 19:19:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237714 to 235519. [2023-12-02 19:19:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235519 states, 232316 states have (on average 2.0750615540901185) internal successors, (482070), 235518 states have internal predecessors, (482070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235519 states to 235519 states and 482070 transitions. [2023-12-02 19:19:47,370 INFO L78 Accepts]: Start accepts. Automaton has 235519 states and 482070 transitions. Word has length 152 [2023-12-02 19:19:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:19:47,371 INFO L495 AbstractCegarLoop]: Abstraction has 235519 states and 482070 transitions. [2023-12-02 19:19:47,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 235519 states and 482070 transitions. [2023-12-02 19:19:47,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-02 19:19:47,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:19:47,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:19:47,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 19:19:47,373 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:19:47,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:19:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash -232434479, now seen corresponding path program 1 times [2023-12-02 19:19:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:19:47,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085701957] [2023-12-02 19:19:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:19:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:19:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:19:47,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:19:47,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085701957] [2023-12-02 19:19:47,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085701957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:19:47,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:19:47,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:19:47,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196321501] [2023-12-02 19:19:47,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:19:47,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:19:47,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:19:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:19:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:19:47,610 INFO L87 Difference]: Start difference. First operand 235519 states and 482070 transitions. Second operand has 3 states, 2 states have (on average 63.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:19:49,862 INFO L93 Difference]: Finished difference Result 243510 states and 498256 transitions. [2023-12-02 19:19:49,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:19:49,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 63.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 154 [2023-12-02 19:19:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:19:50,429 INFO L225 Difference]: With dead ends: 243510 [2023-12-02 19:19:50,429 INFO L226 Difference]: Without dead ends: 243510 [2023-12-02 19:19:50,429 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 [2023-12-02 19:19:50,430 INFO L413 NwaCegarLoop]: 1364 mSDtfsCounter, 427 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:19:50,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1983 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 19:19:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243510 states. [2023-12-02 19:19:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243510 to 235980. [2023-12-02 19:19:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235980 states, 232778 states have (on average 2.074955537035287) internal successors, (483004), 235979 states have internal predecessors, (483004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235980 states to 235980 states and 483004 transitions. [2023-12-02 19:19:56,057 INFO L78 Accepts]: Start accepts. Automaton has 235980 states and 483004 transitions. Word has length 154 [2023-12-02 19:19:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:19:56,058 INFO L495 AbstractCegarLoop]: Abstraction has 235980 states and 483004 transitions. [2023-12-02 19:19:56,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 63.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 235980 states and 483004 transitions. [2023-12-02 19:19:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-02 19:19:56,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:19:56,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:19:56,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 19:19:56,060 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:19:56,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:19:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1307914664, now seen corresponding path program 1 times [2023-12-02 19:19:56,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:19:56,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932334900] [2023-12-02 19:19:56,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:19:56,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:19:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:19:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 19:19:56,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:19:56,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932334900] [2023-12-02 19:19:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932334900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:19:56,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:19:56,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:19:56,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203930906] [2023-12-02 19:19:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:19:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:19:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:19:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:19:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:19:56,213 INFO L87 Difference]: Start difference. First operand 235980 states and 483004 transitions. Second operand has 3 states, 2 states have (on average 65.0) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:19:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:19:58,297 INFO L93 Difference]: Finished difference Result 236867 states and 484800 transitions. [2023-12-02 19:19:58,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:19:58,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 65.0) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 158 [2023-12-02 19:19:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:19:58,837 INFO L225 Difference]: With dead ends: 236867 [2023-12-02 19:19:58,837 INFO L226 Difference]: Without dead ends: 236867 [2023-12-02 19:19:58,837 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 [2023-12-02 19:19:58,838 INFO L413 NwaCegarLoop]: 1321 mSDtfsCounter, 359 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:19:58,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1938 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 19:19:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236867 states. [2023-12-02 19:20:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236867 to 236416. [2023-12-02 19:20:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236416 states, 233216 states have (on average 2.074844779088913) internal successors, (483887), 236415 states have internal predecessors, (483887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236416 states to 236416 states and 483887 transitions. [2023-12-02 19:20:04,373 INFO L78 Accepts]: Start accepts. Automaton has 236416 states and 483887 transitions. Word has length 158 [2023-12-02 19:20:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:20:04,374 INFO L495 AbstractCegarLoop]: Abstraction has 236416 states and 483887 transitions. [2023-12-02 19:20:04,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 65.0) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 236416 states and 483887 transitions. [2023-12-02 19:20:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-02 19:20:04,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:20:04,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:20:04,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 19:20:04,377 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting worker_fnErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:20:04,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:20:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1494185159, now seen corresponding path program 1 times [2023-12-02 19:20:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:20:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638998408] [2023-12-02 19:20:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:20:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:20:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:20:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:20:04,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:20:04,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638998408] [2023-12-02 19:20:04,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638998408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:20:04,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:20:04,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:20:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156211549] [2023-12-02 19:20:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:20:04,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:20:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:20:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:20:04,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:20:04,503 INFO L87 Difference]: Start difference. First operand 236416 states and 483887 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:20:06,040 INFO L93 Difference]: Finished difference Result 247457 states and 506233 transitions. [2023-12-02 19:20:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:20:06,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 158 [2023-12-02 19:20:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:20:06,635 INFO L225 Difference]: With dead ends: 247457 [2023-12-02 19:20:06,636 INFO L226 Difference]: Without dead ends: 247457 [2023-12-02 19:20:06,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:20:06,636 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 545 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:20:06,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2628 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:20:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247457 states. [2023-12-02 19:20:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247457 to 236934. [2023-12-02 19:20:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236934 states, 233734 states have (on average 2.074730248915434) internal successors, (484935), 236933 states have internal predecessors, (484935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236934 states to 236934 states and 484935 transitions. [2023-12-02 19:20:12,163 INFO L78 Accepts]: Start accepts. Automaton has 236934 states and 484935 transitions. Word has length 158 [2023-12-02 19:20:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:20:12,163 INFO L495 AbstractCegarLoop]: Abstraction has 236934 states and 484935 transitions. [2023-12-02 19:20:12,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 236934 states and 484935 transitions. [2023-12-02 19:20:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-02 19:20:12,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:20:12,165 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:20:12,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 19:20:12,165 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting worker_fnErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:20:12,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:20:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 72460321, now seen corresponding path program 1 times [2023-12-02 19:20:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:20:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100203386] [2023-12-02 19:20:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:20:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:20:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:20:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:20:12,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:20:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100203386] [2023-12-02 19:20:12,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100203386] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:20:12,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:20:12,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:20:12,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857017969] [2023-12-02 19:20:12,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:20:12,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:20:12,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:20:12,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:20:12,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:20:12,336 INFO L87 Difference]: Start difference. First operand 236934 states and 484935 transitions. Second operand has 3 states, 2 states have (on average 65.5) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:20:14,501 INFO L93 Difference]: Finished difference Result 240660 states and 492483 transitions. [2023-12-02 19:20:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:20:14,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 65.5) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 159 [2023-12-02 19:20:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:20:15,094 INFO L225 Difference]: With dead ends: 240660 [2023-12-02 19:20:15,095 INFO L226 Difference]: Without dead ends: 240660 [2023-12-02 19:20:15,095 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 [2023-12-02 19:20:15,095 INFO L413 NwaCegarLoop]: 1368 mSDtfsCounter, 419 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:20:15,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1988 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 19:20:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240660 states. [2023-12-02 19:20:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240660 to 237391. [2023-12-02 19:20:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237391 states, 234193 states have (on average 2.074617943320253) internal successors, (485861), 237390 states have internal predecessors, (485861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237391 states to 237391 states and 485861 transitions. [2023-12-02 19:20:20,622 INFO L78 Accepts]: Start accepts. Automaton has 237391 states and 485861 transitions. Word has length 159 [2023-12-02 19:20:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:20:20,623 INFO L495 AbstractCegarLoop]: Abstraction has 237391 states and 485861 transitions. [2023-12-02 19:20:20,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 65.5) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 237391 states and 485861 transitions. [2023-12-02 19:20:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-02 19:20:20,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:20:20,625 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:20:20,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 19:20:20,626 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:20:20,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:20:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1811515049, now seen corresponding path program 1 times [2023-12-02 19:20:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:20:20,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096206513] [2023-12-02 19:20:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:20:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:20:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:20:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:20:21,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:20:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096206513] [2023-12-02 19:20:21,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096206513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:20:21,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:20:21,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-02 19:20:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463180388] [2023-12-02 19:20:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:20:21,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 19:20:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:20:21,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 19:20:21,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:20:21,275 INFO L87 Difference]: Start difference. First operand 237391 states and 485861 transitions. Second operand has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:20:25,540 INFO L93 Difference]: Finished difference Result 237922 states and 486935 transitions. [2023-12-02 19:20:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:20:25,541 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 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 162 [2023-12-02 19:20:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:20:26,367 INFO L225 Difference]: With dead ends: 237922 [2023-12-02 19:20:26,367 INFO L226 Difference]: Without dead ends: 237922 [2023-12-02 19:20:26,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2023-12-02 19:20:26,369 INFO L413 NwaCegarLoop]: 2272 mSDtfsCounter, 7613 mSDsluCounter, 7825 mSDsCounter, 0 mSdLazyCounter, 3413 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7613 SdHoareTripleChecker+Valid, 10097 SdHoareTripleChecker+Invalid, 3437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:20:26,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7613 Valid, 10097 Invalid, 3437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3413 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 19:20:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237922 states. [2023-12-02 19:20:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237922 to 237401. [2023-12-02 19:20:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237401 states, 234203 states have (on average 2.0746147572832117) internal successors, (485881), 237400 states have internal predecessors, (485881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237401 states to 237401 states and 485881 transitions. [2023-12-02 19:20:32,216 INFO L78 Accepts]: Start accepts. Automaton has 237401 states and 485881 transitions. Word has length 162 [2023-12-02 19:20:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:20:32,216 INFO L495 AbstractCegarLoop]: Abstraction has 237401 states and 485881 transitions. [2023-12-02 19:20:32,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 237401 states and 485881 transitions. [2023-12-02 19:20:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-02 19:20:32,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:20:32,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:20:32,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 19:20:32,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:20:32,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:20:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash 950500185, now seen corresponding path program 2 times [2023-12-02 19:20:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:20:32,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798718820] [2023-12-02 19:20:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:20:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:20:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:20:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 19:20:32,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:20:32,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798718820] [2023-12-02 19:20:32,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798718820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:20:32,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:20:32,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-02 19:20:32,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270297923] [2023-12-02 19:20:32,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:20:32,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 19:20:32,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:20:32,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 19:20:32,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:20:32,897 INFO L87 Difference]: Start difference. First operand 237401 states and 485881 transitions. Second operand has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:38,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:20:38,562 INFO L93 Difference]: Finished difference Result 237902 states and 486895 transitions. [2023-12-02 19:20:38,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 19:20:38,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 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 162 [2023-12-02 19:20:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:20:39,422 INFO L225 Difference]: With dead ends: 237902 [2023-12-02 19:20:39,423 INFO L226 Difference]: Without dead ends: 237902 [2023-12-02 19:20:39,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=371, Invalid=819, Unknown=0, NotChecked=0, Total=1190 [2023-12-02 19:20:39,424 INFO L413 NwaCegarLoop]: 3442 mSDtfsCounter, 11124 mSDsluCounter, 9969 mSDsCounter, 0 mSdLazyCounter, 4908 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11124 SdHoareTripleChecker+Valid, 13411 SdHoareTripleChecker+Invalid, 4933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:20:39,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11124 Valid, 13411 Invalid, 4933 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 4908 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-02 19:20:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237902 states. [2023-12-02 19:20:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237902 to 237369. [2023-12-02 19:20:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237369 states, 234172 states have (on average 2.074616094153016) internal successors, (485817), 237368 states have internal predecessors, (485817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237369 states to 237369 states and 485817 transitions. [2023-12-02 19:20:44,809 INFO L78 Accepts]: Start accepts. Automaton has 237369 states and 485817 transitions. Word has length 162 [2023-12-02 19:20:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:20:44,809 INFO L495 AbstractCegarLoop]: Abstraction has 237369 states and 485817 transitions. [2023-12-02 19:20:44,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.307692307692308) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 237369 states and 485817 transitions. [2023-12-02 19:20:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-02 19:20:44,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:20:44,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:20:44,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 19:20:44,813 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:20:44,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:20:44,814 INFO L85 PathProgramCache]: Analyzing trace with hash 376941492, now seen corresponding path program 1 times [2023-12-02 19:20:44,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:20:44,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536009167] [2023-12-02 19:20:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:20:44,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:20:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:20:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:20:45,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:20:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536009167] [2023-12-02 19:20:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536009167] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:20:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125692366] [2023-12-02 19:20:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:20:45,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:20:45,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:20:45,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:20:45,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:20:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:20:45,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 19:20:45,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:20:45,843 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 19:20:45,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 19:20:45,862 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:20:45,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:20:46,361 INFO L378 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 [2023-12-02 19:20:46,393 INFO L378 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 18 treesize of output 13 [2023-12-02 19:20:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:20:46,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:20:46,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125692366] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:20:46,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:20:46,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 19 [2023-12-02 19:20:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836583435] [2023-12-02 19:20:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:20:46,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 19:20:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:20:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 19:20:46,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2023-12-02 19:20:46,414 INFO L87 Difference]: Start difference. First operand 237369 states and 485817 transitions. Second operand has 13 states, 12 states have (on average 11.166666666666666) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:20:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:20:53,304 INFO L93 Difference]: Finished difference Result 451925 states and 925205 transitions. [2023-12-02 19:20:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 19:20:53,305 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 11.166666666666666) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 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 162 [2023-12-02 19:20:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:20:54,459 INFO L225 Difference]: With dead ends: 451925 [2023-12-02 19:20:54,459 INFO L226 Difference]: Without dead ends: 451925 [2023-12-02 19:20:54,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2023-12-02 19:20:54,461 INFO L413 NwaCegarLoop]: 3051 mSDtfsCounter, 11853 mSDsluCounter, 11430 mSDsCounter, 0 mSdLazyCounter, 4658 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11853 SdHoareTripleChecker+Valid, 14481 SdHoareTripleChecker+Invalid, 4690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:20:54,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11853 Valid, 14481 Invalid, 4690 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 4658 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-02 19:20:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451925 states. [2023-12-02 19:21:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451925 to 237347. [2023-12-02 19:21:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237347 states, 234151 states have (on average 2.0746142446540907) internal successors, (485773), 237346 states have internal predecessors, (485773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237347 states to 237347 states and 485773 transitions. [2023-12-02 19:21:01,593 INFO L78 Accepts]: Start accepts. Automaton has 237347 states and 485773 transitions. Word has length 162 [2023-12-02 19:21:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:21:01,593 INFO L495 AbstractCegarLoop]: Abstraction has 237347 states and 485773 transitions. [2023-12-02 19:21:01,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 11.166666666666666) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 237347 states and 485773 transitions. [2023-12-02 19:21:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-02 19:21:01,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:01,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:21:01,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 19:21:01,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:01,798 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:21:01,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:01,798 INFO L85 PathProgramCache]: Analyzing trace with hash 550374619, now seen corresponding path program 1 times [2023-12-02 19:21:01,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:01,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732052744] [2023-12-02 19:21:01,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 19:21:01,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:01,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732052744] [2023-12-02 19:21:01,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732052744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:21:01,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:21:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:21:01,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382291412] [2023-12-02 19:21:01,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:21:01,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:21:01,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:21:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:21:01,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:21:01,959 INFO L87 Difference]: Start difference. First operand 237347 states and 485773 transitions. Second operand has 3 states, 2 states have (on average 68.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:21:04,175 INFO L93 Difference]: Finished difference Result 244567 states and 500400 transitions. [2023-12-02 19:21:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:21:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 68.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 164 [2023-12-02 19:21:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:21:04,721 INFO L225 Difference]: With dead ends: 244567 [2023-12-02 19:21:04,721 INFO L226 Difference]: Without dead ends: 244567 [2023-12-02 19:21:04,721 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 [2023-12-02 19:21:04,722 INFO L413 NwaCegarLoop]: 1316 mSDtfsCounter, 373 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:21:04,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1933 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 19:21:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244567 states. [2023-12-02 19:21:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244567 to 237760. [2023-12-02 19:21:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237760 states, 234568 states have (on average 2.074494389686573) internal successors, (486610), 237759 states have internal predecessors, (486610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237760 states to 237760 states and 486610 transitions. [2023-12-02 19:21:10,181 INFO L78 Accepts]: Start accepts. Automaton has 237760 states and 486610 transitions. Word has length 164 [2023-12-02 19:21:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:21:10,182 INFO L495 AbstractCegarLoop]: Abstraction has 237760 states and 486610 transitions. [2023-12-02 19:21:10,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 68.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 237760 states and 486610 transitions. [2023-12-02 19:21:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-02 19:21:10,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:10,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:21:10,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 19:21:10,186 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:21:10,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:10,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1339634197, now seen corresponding path program 1 times [2023-12-02 19:21:10,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534217777] [2023-12-02 19:21:10,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:10,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 19:21:11,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:11,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534217777] [2023-12-02 19:21:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534217777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:21:11,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:21:11,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-02 19:21:11,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582339309] [2023-12-02 19:21:11,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:21:11,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 19:21:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:21:11,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 19:21:11,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:21:11,496 INFO L87 Difference]: Start difference. First operand 237760 states and 486610 transitions. Second operand has 14 states, 13 states have (on average 10.538461538461538) internal successors, (137), 14 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:21:17,847 INFO L93 Difference]: Finished difference Result 262534 states and 537511 transitions. [2023-12-02 19:21:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:21:17,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.538461538461538) internal successors, (137), 14 states have internal predecessors, (137), 0 states have call successors, (0), 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 165 [2023-12-02 19:21:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:21:18,432 INFO L225 Difference]: With dead ends: 262534 [2023-12-02 19:21:18,432 INFO L226 Difference]: Without dead ends: 262534 [2023-12-02 19:21:18,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2023-12-02 19:21:18,433 INFO L413 NwaCegarLoop]: 3295 mSDtfsCounter, 10224 mSDsluCounter, 9242 mSDsCounter, 0 mSdLazyCounter, 6025 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10224 SdHoareTripleChecker+Valid, 12537 SdHoareTripleChecker+Invalid, 6392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 6025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:21:18,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10224 Valid, 12537 Invalid, 6392 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [367 Valid, 6025 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-02 19:21:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262534 states. [2023-12-02 19:21:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262534 to 237460. [2023-12-02 19:21:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237460 states, 234273 states have (on average 2.074502823628843) internal successors, (486000), 237459 states have internal predecessors, (486000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237460 states to 237460 states and 486000 transitions. [2023-12-02 19:21:23,952 INFO L78 Accepts]: Start accepts. Automaton has 237460 states and 486000 transitions. Word has length 165 [2023-12-02 19:21:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:21:23,953 INFO L495 AbstractCegarLoop]: Abstraction has 237460 states and 486000 transitions. [2023-12-02 19:21:23,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.538461538461538) internal successors, (137), 14 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:21:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 237460 states and 486000 transitions. [2023-12-02 19:21:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-02 19:21:23,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:21:23,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:21:23,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 19:21:23,956 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2023-12-02 19:21:23,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:21:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1893846732, now seen corresponding path program 1 times [2023-12-02 19:21:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:21:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141947144] [2023-12-02 19:21:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:21:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:21:26,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:21:26,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141947144] [2023-12-02 19:21:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141947144] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:21:26,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211975787] [2023-12-02 19:21:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:21:26,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:21:26,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:21:26,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:21:26,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0b9ea41-5d70-40fb-bcc7-99974c058aa6/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:21:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:21:27,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 19:21:27,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:21:27,276 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 19:21:27,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 19:21:27,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:21:27,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:21:28,040 INFO L378 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 [2023-12-02 19:21:28,091 INFO L378 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 [2023-12-02 19:21:28,143 INFO L378 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 26 treesize of output 28 [2023-12-02 19:21:28,215 INFO L378 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 33 treesize of output 38 [2023-12-02 19:21:28,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,696 INFO L378 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 41 [2023-12-02 19:21:28,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,730 INFO L378 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 42 treesize of output 50 [2023-12-02 19:21:28,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,831 INFO L378 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 53 [2023-12-02 19:21:28,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:21:28,876 INFO L378 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 51 treesize of output 62 [2023-12-02 19:21:39,148 INFO L378 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 55 treesize of output 40 [2023-12-02 19:21:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 19:21:49,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:21:49,272 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3689 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3689 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3689 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_3689 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2023-12-02 19:22:07,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2023-12-02 19:22:09,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0)))) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0))))))) is different from false [2023-12-02 19:22:12,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0) .cse4 0)))) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse0) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0))))))) is different from false [2023-12-02 19:22:12,694 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse5 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0) .cse3 0) .cse5 0)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|)) (.cse2 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse2))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse2))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4) 0) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse2))) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| Int) (v_ArrVal_3686 Int) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3682 Int)) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store .cse1 (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 8) v_ArrVal_3682) (+ 9 |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25|) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 10) v_ArrVal_3686) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| 11) 0)) |c_~#pre~0.base| v_ArrVal_3689) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5) 0) (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_25| .cse2))))))) is different from false [2023-12-02 19:22:13,077 INFO L349 Elim1Store]: treesize reduction 632, result has 21.1 percent of original size [2023-12-02 19:22:13,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 181 [2023-12-02 19:22:13,104 INFO L349 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2023-12-02 19:22:13,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 174 treesize of output 132 [2023-12-02 19:22:13,114 INFO L378 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 7 treesize of output 3 [2023-12-02 19:22:13,341 INFO L349 Elim1Store]: treesize reduction 740, result has 7.6 percent of original size [2023-12-02 19:22:13,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 73 [2023-12-02 19:22:13,350 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:13,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-12-02 19:22:13,532 INFO L349 Elim1Store]: treesize reduction 730, result has 8.9 percent of original size [2023-12-02 19:22:13,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 83 [2023-12-02 19:22:13,540 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:13,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 20 [2023-12-02 19:22:13,753 INFO L349 Elim1Store]: treesize reduction 720, result has 10.1 percent of original size [2023-12-02 19:22:13,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 93 [2023-12-02 19:22:13,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:22:13,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 24 [2023-12-02 19:22:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 1 not checked. [2023-12-02 19:22:14,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211975787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:22:14,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1213561968] [2023-12-02 19:22:14,870 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:22:14,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:22:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 20] total 51 [2023-12-02 19:22:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595656790] [2023-12-02 19:22:14,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:22:14,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 19:22:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:22:14,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 19:22:14,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1827, Unknown=105, NotChecked=470, Total=2652 [2023-12-02 19:22:14,874 INFO L87 Difference]: Start difference. First operand 237460 states and 486000 transitions. Second operand has 52 states, 51 states have (on average 6.019607843137255) internal successors, (307), 52 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:22:31,830 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] [2023-12-02 19:22:34,092 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] [2023-12-02 19:22:41,082 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] [2023-12-02 19:22:43,285 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] [2023-12-02 19:22:46,041 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] [2023-12-02 19:22:48,204 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] [2023-12-02 19:22:52,050 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] [2023-12-02 19:22:54,053 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] [2023-12-02 19:22:56,880 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] [2023-12-02 19:22:59,074 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] [2023-12-02 19:23:01,082 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] [2023-12-02 19:23:03,235 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] [2023-12-02 19:23:09,862 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] [2023-12-02 19:23:11,986 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] [2023-12-02 19:23:13,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] [2023-12-02 19:23:16,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:23:18,476 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] [2023-12-02 19:23:20,480 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] [2023-12-02 19:23:22,490 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] [2023-12-02 19:23:24,603 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] [2023-12-02 19:23:27,244 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] [2023-12-02 19:23:29,249 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] [2023-12-02 19:23:31,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] [2023-12-02 19:23:33,255 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] [2023-12-02 19:23:35,263 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] [2023-12-02 19:23:37,313 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] [2023-12-02 19:23:44,614 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] [2023-12-02 19:23:46,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:23:52,745 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] [2023-12-02 19:23:54,783 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] [2023-12-02 19:23:57,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:23:59,997 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] [2023-12-02 19:24:02,002 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] [2023-12-02 19:24:04,006 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] [2023-12-02 19:24:06,012 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] [2023-12-02 19:24:08,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:24:10,036 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] [2023-12-02 19:24:12,040 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] [2023-12-02 19:24:14,713 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] [2023-12-02 19:24:16,922 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] [2023-12-02 19:24:19,151 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] [2023-12-02 19:24:21,155 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] [2023-12-02 19:24:23,159 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] [2023-12-02 19:24:25,162 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] [2023-12-02 19:24:28,259 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] [2023-12-02 19:24:30,344 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] [2023-12-02 19:24:32,449 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] [2023-12-02 19:24:34,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:24:41,616 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] [2023-12-02 19:24:43,621 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] [2023-12-02 19:24:45,624 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] [2023-12-02 19:24:47,626 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] [2023-12-02 19:24:49,647 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] [2023-12-02 19:24:51,658 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] [2023-12-02 19:24:54,675 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] [2023-12-02 19:24:56,681 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] [2023-12-02 19:24:58,686 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] [2023-12-02 19:25:00,698 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] [2023-12-02 19:25:02,764 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] [2023-12-02 19:25:04,772 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] [2023-12-02 19:25:06,777 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] [2023-12-02 19:25:08,781 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] [2023-12-02 19:25:12,183 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] [2023-12-02 19:25:14,186 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] [2023-12-02 19:25:16,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:25:18,238 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] [2023-12-02 19:25:20,252 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] [2023-12-02 19:25:22,256 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] [2023-12-02 19:25:26,313 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] [2023-12-02 19:25:28,473 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] [2023-12-02 19:25:31,020 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] [2023-12-02 19:25:33,231 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] [2023-12-02 19:25:35,238 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] [2023-12-02 19:25:37,248 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] [2023-12-02 19:25:39,256 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] [2023-12-02 19:25:41,269 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] [2023-12-02 19:25:43,274 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] [2023-12-02 19:25:45,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:25:48,082 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] [2023-12-02 19:25:50,084 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] [2023-12-02 19:25:52,090 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] [2023-12-02 19:25:54,101 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] [2023-12-02 19:25:56,105 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] [2023-12-02 19:25:58,107 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] [2023-12-02 19:26:00,569 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] [2023-12-02 19:26:02,697 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] [2023-12-02 19:26:04,702 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] [2023-12-02 19:26:06,707 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] [2023-12-02 19:26:08,716 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] [2023-12-02 19:26:10,719 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] [2023-12-02 19:26:13,423 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] [2023-12-02 19:26:15,432 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] [2023-12-02 19:26:17,440 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] [2023-12-02 19:26:19,442 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] [2023-12-02 19:26:21,448 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] [2023-12-02 19:26:23,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:26:25,454 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] [2023-12-02 19:26:27,462 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] [2023-12-02 19:26:29,465 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] [2023-12-02 19:26:31,472 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] [2023-12-02 19:26:33,477 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] [2023-12-02 19:26:35,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:26:37,881 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] [2023-12-02 19:26:39,892 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] [2023-12-02 19:26:41,897 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] [2023-12-02 19:26:43,901 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] [2023-12-02 19:26:45,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:26:47,991 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] [2023-12-02 19:26:49,994 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] [2023-12-02 19:26:51,997 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] [2023-12-02 19:26:54,788 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] [2023-12-02 19:26:56,790 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] [2023-12-02 19:26:58,794 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] [2023-12-02 19:27:00,797 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] [2023-12-02 19:27:02,802 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] [2023-12-02 19:27:04,838 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] [2023-12-02 19:27:06,852 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] [2023-12-02 19:27:08,855 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] [2023-12-02 19:27:10,864 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] [2023-12-02 19:27:13,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:27:15,656 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] [2023-12-02 19:27:17,659 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] [2023-12-02 19:27:19,672 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] [2023-12-02 19:27:21,675 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] [2023-12-02 19:27:23,686 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] [2023-12-02 19:27:25,691 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] [2023-12-02 19:27:27,697 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] [2023-12-02 19:27:29,711 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] [2023-12-02 19:27:32,276 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] [2023-12-02 19:27:34,292 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] [2023-12-02 19:27:36,297 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] [2023-12-02 19:27:38,395 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] [2023-12-02 19:27:40,401 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] [2023-12-02 19:27:42,404 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] [2023-12-02 19:27:44,408 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] [2023-12-02 19:27:46,411 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] [2023-12-02 19:27:48,415 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] [2023-12-02 19:27:50,419 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] [2023-12-02 19:27:52,433 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] [2023-12-02 19:27:54,437 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] [2023-12-02 19:27:57,002 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] [2023-12-02 19:27:59,170 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] [2023-12-02 19:28:01,181 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] [2023-12-02 19:28:03,183 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] [2023-12-02 19:28:05,187 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] [2023-12-02 19:28:07,197 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] [2023-12-02 19:28:09,200 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] [2023-12-02 19:28:11,202 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] [2023-12-02 19:28:13,206 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] [2023-12-02 19:28:15,212 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] [2023-12-02 19:28:17,216 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] [2023-12-02 19:28:19,227 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] [2023-12-02 19:28:21,237 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] [2023-12-02 19:28:23,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] [2023-12-02 19:28:26,635 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] [2023-12-02 19:28:28,639 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] [2023-12-02 19:28:30,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:28:32,645 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] [2023-12-02 19:28:34,648 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] [2023-12-02 19:28:36,650 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] [2023-12-02 19:28:38,747 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] [2023-12-02 19:28:40,752 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] [2023-12-02 19:28:42,759 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] [2023-12-02 19:28:44,763 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] [2023-12-02 19:28:48,541 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] [2023-12-02 19:28:50,552 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] [2023-12-02 19:28:52,556 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] [2023-12-02 19:28:54,562 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] [2023-12-02 19:28:56,574 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]