./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/array-eq-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/array-eq-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:18:05,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:18:05,153 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:18:05,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:18:05,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:18:05,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:18:05,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:18:05,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:18:05,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:18:05,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:18:05,184 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:18:05,184 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:18:05,185 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:18:05,185 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:18:05,185 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:18:05,185 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:18:05,185 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:18:05,185 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:18:05,185 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:18:05,186 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:18:05,186 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:18:05,186 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:18:05,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:18:05,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:18:05,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:18:05,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:18:05,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:18:05,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:18:05,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:18:05,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:18:05,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:18:05,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:18:05,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:18:05,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:18:05,188 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:18:05,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:18:05,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:18:05,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:18:05,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:18:05,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:18:05,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:18:05,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:18:05,194 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:18:05,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:18:05,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:18:05,194 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:18:05,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:18:05,194 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E 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 ! call(reach_error())) ) 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 -> 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d [2024-11-14 05:18:05,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:18:05,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:18:05,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:18:05,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:18:05,560 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:18:05,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/weaver/array-eq-symm.wvr.c Unable to find full path for "g++" [2024-11-14 05:18:07,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:18:07,715 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:18:07,716 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2024-11-14 05:18:07,750 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/data/d53c58225/2080c10151b04b6484318832da9afe56/FLAG5d54e6bf4 [2024-11-14 05:18:07,792 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/data/d53c58225/2080c10151b04b6484318832da9afe56 [2024-11-14 05:18:07,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:18:07,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:18:07,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:18:07,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:18:07,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:18:07,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:18:07" (1/1) ... [2024-11-14 05:18:07,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f5e673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:07, skipping insertion in model container [2024-11-14 05:18:07,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:18:07" (1/1) ... [2024-11-14 05:18:07,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:18:08,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/sv-benchmarks/c/weaver/array-eq-symm.wvr.c[2277,2290] [2024-11-14 05:18:08,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:18:08,078 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:18:08,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/sv-benchmarks/c/weaver/array-eq-symm.wvr.c[2277,2290] [2024-11-14 05:18:08,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:18:08,129 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:18:08,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08 WrapperNode [2024-11-14 05:18:08,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:18:08,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:18:08,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:18:08,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:18:08,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,168 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2024-11-14 05:18:08,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:18:08,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:18:08,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:18:08,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:18:08,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:18:08,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:18:08,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:18:08,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:18:08,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (1/1) ... [2024-11-14 05:18:08,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:18:08,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:08,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:18:08,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:18:08,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:18:08,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 05:18:08,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 05:18:08,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 05:18:08,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 05:18:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:18:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:18:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:18:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:18:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:18:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:18:08,276 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 05:18:08,381 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:18:08,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:18:08,757 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 05:18:08,757 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:18:08,988 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:18:08,988 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 05:18:08,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:18:08 BoogieIcfgContainer [2024-11-14 05:18:08,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:18:08,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:18:08,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:18:08,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:18:08,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:18:07" (1/3) ... [2024-11-14 05:18:08,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8acadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:18:08, skipping insertion in model container [2024-11-14 05:18:08,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:08" (2/3) ... [2024-11-14 05:18:08,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8acadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:18:08, skipping insertion in model container [2024-11-14 05:18:08,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:18:08" (3/3) ... [2024-11-14 05:18:09,000 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2024-11-14 05:18:09,017 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:18:09,018 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-symm.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-14 05:18:09,019 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 05:18:09,076 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 05:18:09,108 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 28 transitions, 70 flow [2024-11-14 05:18:09,134 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 72 states, 71 states have (on average 2.6338028169014085) internal successors, (187), 71 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:09,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:18:09,182 INFO L333 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, 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;@483a814c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:18:09,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 05:18:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 71 states have (on average 2.6338028169014085) internal successors, (187), 71 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:18:09,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:09,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:09,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:09,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -76964000, now seen corresponding path program 1 times [2024-11-14 05:18:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638251901] [2024-11-14 05:18:09,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:09,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:09,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638251901] [2024-11-14 05:18:09,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638251901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:09,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:09,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:18:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107771289] [2024-11-14 05:18:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:09,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:18:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:09,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:18:09,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:18:09,751 INFO L87 Difference]: Start difference. First operand has 72 states, 71 states have (on average 2.6338028169014085) internal successors, (187), 71 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:09,876 INFO L93 Difference]: Finished difference Result 136 states and 359 transitions. [2024-11-14 05:18:09,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:18:09,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 05:18:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:09,891 INFO L225 Difference]: With dead ends: 136 [2024-11-14 05:18:09,892 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 05:18:09,894 INFO L431 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 [2024-11-14 05:18:09,898 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:09,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 05:18:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-14 05:18:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.6475409836065573) internal successors, (323), 122 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 323 transitions. [2024-11-14 05:18:09,957 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 323 transitions. Word has length 17 [2024-11-14 05:18:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:09,958 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 323 transitions. [2024-11-14 05:18:09,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 323 transitions. [2024-11-14 05:18:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:18:09,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:09,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:09,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:18:09,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:09,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash -936709502, now seen corresponding path program 1 times [2024-11-14 05:18:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:09,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437449078] [2024-11-14 05:18:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:10,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437449078] [2024-11-14 05:18:10,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437449078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:10,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:10,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:18:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220910909] [2024-11-14 05:18:10,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:10,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:18:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:10,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:18:10,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:18:10,237 INFO L87 Difference]: Start difference. First operand 123 states and 323 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:10,421 INFO L93 Difference]: Finished difference Result 296 states and 761 transitions. [2024-11-14 05:18:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:18:10,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-14 05:18:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:10,424 INFO L225 Difference]: With dead ends: 296 [2024-11-14 05:18:10,424 INFO L226 Difference]: Without dead ends: 201 [2024-11-14 05:18:10,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:18:10,426 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:10,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-14 05:18:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 158. [2024-11-14 05:18:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.611464968152866) internal successors, (410), 157 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 410 transitions. [2024-11-14 05:18:10,448 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 410 transitions. Word has length 19 [2024-11-14 05:18:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:10,448 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 410 transitions. [2024-11-14 05:18:10,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 410 transitions. [2024-11-14 05:18:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:18:10,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:10,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:10,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:18:10,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:10,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash 572616254, now seen corresponding path program 1 times [2024-11-14 05:18:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:10,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724786187] [2024-11-14 05:18:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:10,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724786187] [2024-11-14 05:18:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724786187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:10,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:10,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:18:10,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616951354] [2024-11-14 05:18:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:10,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:18:10,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:10,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:18:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:18:10,698 INFO L87 Difference]: Start difference. First operand 158 states and 410 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:10,832 INFO L93 Difference]: Finished difference Result 201 states and 496 transitions. [2024-11-14 05:18:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:18:10,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-14 05:18:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:10,834 INFO L225 Difference]: With dead ends: 201 [2024-11-14 05:18:10,835 INFO L226 Difference]: Without dead ends: 124 [2024-11-14 05:18:10,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:18:10,836 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:10,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-14 05:18:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-14 05:18:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.6341463414634148) internal successors, (324), 123 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 324 transitions. [2024-11-14 05:18:10,851 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 324 transitions. Word has length 19 [2024-11-14 05:18:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:10,851 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 324 transitions. [2024-11-14 05:18:10,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 324 transitions. [2024-11-14 05:18:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:18:10,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:10,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:10,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:18:10,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -110250430, now seen corresponding path program 1 times [2024-11-14 05:18:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684814073] [2024-11-14 05:18:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:11,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684814073] [2024-11-14 05:18:11,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684814073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:18:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513958333] [2024-11-14 05:18:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:11,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:18:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:11,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:18:11,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:18:11,044 INFO L87 Difference]: Start difference. First operand 124 states and 324 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:11,191 INFO L93 Difference]: Finished difference Result 334 states and 866 transitions. [2024-11-14 05:18:11,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:18:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-14 05:18:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:11,195 INFO L225 Difference]: With dead ends: 334 [2024-11-14 05:18:11,195 INFO L226 Difference]: Without dead ends: 239 [2024-11-14 05:18:11,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:18:11,199 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:11,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 12 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-14 05:18:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 158. [2024-11-14 05:18:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.605095541401274) internal successors, (409), 157 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 409 transitions. [2024-11-14 05:18:11,231 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 409 transitions. Word has length 20 [2024-11-14 05:18:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:11,231 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 409 transitions. [2024-11-14 05:18:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 409 transitions. [2024-11-14 05:18:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:18:11,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:11,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:11,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:18:11,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:11,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1399075326, now seen corresponding path program 1 times [2024-11-14 05:18:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414266178] [2024-11-14 05:18:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:11,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:11,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414266178] [2024-11-14 05:18:11,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414266178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:11,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:11,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:18:11,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819899376] [2024-11-14 05:18:11,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:11,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:18:11,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:11,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:18:11,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:18:11,402 INFO L87 Difference]: Start difference. First operand 158 states and 409 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:11,520 INFO L93 Difference]: Finished difference Result 239 states and 601 transitions. [2024-11-14 05:18:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:18:11,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-14 05:18:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:11,523 INFO L225 Difference]: With dead ends: 239 [2024-11-14 05:18:11,524 INFO L226 Difference]: Without dead ends: 164 [2024-11-14 05:18:11,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:18:11,525 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:11,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 11 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-14 05:18:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 125. [2024-11-14 05:18:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.620967741935484) internal successors, (325), 124 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 325 transitions. [2024-11-14 05:18:11,551 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 325 transitions. Word has length 20 [2024-11-14 05:18:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:11,551 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 325 transitions. [2024-11-14 05:18:11,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 325 transitions. [2024-11-14 05:18:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:18:11,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:11,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:11,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:18:11,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:11,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash -874655662, now seen corresponding path program 1 times [2024-11-14 05:18:11,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:11,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299475606] [2024-11-14 05:18:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:11,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:11,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:11,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299475606] [2024-11-14 05:18:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299475606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:11,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904687107] [2024-11-14 05:18:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:11,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:11,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:11,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:11,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:18:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:11,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:18:12,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:12,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904687107] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:12,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:18:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 14 [2024-11-14 05:18:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197708545] [2024-11-14 05:18:12,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:12,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:18:12,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:12,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:18:12,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:18:12,451 INFO L87 Difference]: Start difference. First operand 125 states and 325 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:12,668 INFO L93 Difference]: Finished difference Result 222 states and 549 transitions. [2024-11-14 05:18:12,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:12,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 05:18:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:12,671 INFO L225 Difference]: With dead ends: 222 [2024-11-14 05:18:12,671 INFO L226 Difference]: Without dead ends: 189 [2024-11-14 05:18:12,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:18:12,675 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:12,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 12 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-14 05:18:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 134. [2024-11-14 05:18:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.5789473684210527) internal successors, (343), 133 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 343 transitions. [2024-11-14 05:18:12,706 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 343 transitions. Word has length 21 [2024-11-14 05:18:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:12,707 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 343 transitions. [2024-11-14 05:18:12,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 343 transitions. [2024-11-14 05:18:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:18:12,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:12,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:12,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:12,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:12,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:12,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash 634670094, now seen corresponding path program 1 times [2024-11-14 05:18:12,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:12,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237819023] [2024-11-14 05:18:12,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:13,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237819023] [2024-11-14 05:18:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237819023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718502862] [2024-11-14 05:18:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:13,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:13,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:13,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:13,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:18:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:13,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:18:13,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:13,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718502862] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:13,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:18:13,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2024-11-14 05:18:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185810041] [2024-11-14 05:18:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:13,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:18:13,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:13,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:18:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:18:13,512 INFO L87 Difference]: Start difference. First operand 134 states and 343 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:13,715 INFO L93 Difference]: Finished difference Result 252 states and 609 transitions. [2024-11-14 05:18:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 05:18:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:13,717 INFO L225 Difference]: With dead ends: 252 [2024-11-14 05:18:13,717 INFO L226 Difference]: Without dead ends: 210 [2024-11-14 05:18:13,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:18:13,719 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 83 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:13,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 14 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-14 05:18:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 142. [2024-11-14 05:18:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.5319148936170213) internal successors, (357), 141 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 357 transitions. [2024-11-14 05:18:13,737 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 357 transitions. Word has length 21 [2024-11-14 05:18:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:13,737 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 357 transitions. [2024-11-14 05:18:13,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 357 transitions. [2024-11-14 05:18:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:13,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:13,738 INFO L215 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] [2024-11-14 05:18:13,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:13,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:13,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:13,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1174384345, now seen corresponding path program 1 times [2024-11-14 05:18:13,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:13,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187591534] [2024-11-14 05:18:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:14,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187591534] [2024-11-14 05:18:14,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187591534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241365362] [2024-11-14 05:18:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:14,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:14,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:14,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:14,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:18:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:14,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 05:18:14,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:14,847 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:18:14,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-14 05:18:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:14,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:15,015 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:18:15,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:18:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:15,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241365362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:15,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531398352] [2024-11-14 05:18:15,074 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:15,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:15,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2024-11-14 05:18:15,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505661128] [2024-11-14 05:18:15,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:15,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:18:15,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:15,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:18:15,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:18:15,081 INFO L87 Difference]: Start difference. First operand 142 states and 357 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:15,426 INFO L93 Difference]: Finished difference Result 202 states and 507 transitions. [2024-11-14 05:18:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:18:15,427 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:15,428 INFO L225 Difference]: With dead ends: 202 [2024-11-14 05:18:15,428 INFO L226 Difference]: Without dead ends: 181 [2024-11-14 05:18:15,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:18:15,429 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 64 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:15,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 39 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-14 05:18:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 132. [2024-11-14 05:18:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.633587786259542) internal successors, (345), 131 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 345 transitions. [2024-11-14 05:18:15,455 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 345 transitions. Word has length 22 [2024-11-14 05:18:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:15,456 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 345 transitions. [2024-11-14 05:18:15,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 345 transitions. [2024-11-14 05:18:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:15,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:15,457 INFO L215 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] [2024-11-14 05:18:15,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:15,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:15,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:15,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash -134877283, now seen corresponding path program 1 times [2024-11-14 05:18:15,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:15,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953077511] [2024-11-14 05:18:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:16,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:16,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953077511] [2024-11-14 05:18:16,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953077511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:16,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:16,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:16,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685888367] [2024-11-14 05:18:16,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:16,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:16,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:16,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:18:16,271 INFO L87 Difference]: Start difference. First operand 132 states and 345 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:16,483 INFO L93 Difference]: Finished difference Result 179 states and 439 transitions. [2024-11-14 05:18:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:16,485 INFO L225 Difference]: With dead ends: 179 [2024-11-14 05:18:16,485 INFO L226 Difference]: Without dead ends: 137 [2024-11-14 05:18:16,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:18:16,486 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:16,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 29 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-14 05:18:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2024-11-14 05:18:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.5877862595419847) internal successors, (339), 131 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 339 transitions. [2024-11-14 05:18:16,503 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 339 transitions. Word has length 22 [2024-11-14 05:18:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:16,503 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 339 transitions. [2024-11-14 05:18:16,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 339 transitions. [2024-11-14 05:18:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:16,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:16,504 INFO L215 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] [2024-11-14 05:18:16,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:18:16,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:16,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:16,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2140071935, now seen corresponding path program 2 times [2024-11-14 05:18:16,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:16,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492833872] [2024-11-14 05:18:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:16,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:16,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492833872] [2024-11-14 05:18:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492833872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:16,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833745251] [2024-11-14 05:18:16,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:18:16,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:16,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:16,925 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:16,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:18:17,024 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:18:17,024 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:17,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:18:17,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:17,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-11-14 05:18:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:17,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:17,335 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:18:17,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:18:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:17,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833745251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:17,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [807056243] [2024-11-14 05:18:17,378 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:17,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:17,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 13 [2024-11-14 05:18:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475725238] [2024-11-14 05:18:17,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:17,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 05:18:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 05:18:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:18:17,381 INFO L87 Difference]: Start difference. First operand 132 states and 339 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:17,879 INFO L93 Difference]: Finished difference Result 269 states and 654 transitions. [2024-11-14 05:18:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:18:17,880 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:17,881 INFO L225 Difference]: With dead ends: 269 [2024-11-14 05:18:17,882 INFO L226 Difference]: Without dead ends: 248 [2024-11-14 05:18:17,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:18:17,883 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 65 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:17,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 44 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:18:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-14 05:18:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 134. [2024-11-14 05:18:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.6165413533834587) internal successors, (348), 133 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 348 transitions. [2024-11-14 05:18:17,906 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 348 transitions. Word has length 22 [2024-11-14 05:18:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:17,907 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 348 transitions. [2024-11-14 05:18:17,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 348 transitions. [2024-11-14 05:18:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:17,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:17,908 INFO L215 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] [2024-11-14 05:18:17,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:18,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 05:18:18,113 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:18,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1732252445, now seen corresponding path program 2 times [2024-11-14 05:18:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:18,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850503183] [2024-11-14 05:18:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:18,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850503183] [2024-11-14 05:18:18,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850503183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:18,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:18,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:18,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54588922] [2024-11-14 05:18:18,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:18,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:18,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:18,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:18:18,534 INFO L87 Difference]: Start difference. First operand 134 states and 348 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:18,768 INFO L93 Difference]: Finished difference Result 167 states and 416 transitions. [2024-11-14 05:18:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:18,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:18,770 INFO L225 Difference]: With dead ends: 167 [2024-11-14 05:18:18,770 INFO L226 Difference]: Without dead ends: 139 [2024-11-14 05:18:18,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:18:18,771 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:18,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 21 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-14 05:18:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2024-11-14 05:18:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.601503759398496) internal successors, (346), 133 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 346 transitions. [2024-11-14 05:18:18,791 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 346 transitions. Word has length 22 [2024-11-14 05:18:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:18,791 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 346 transitions. [2024-11-14 05:18:18,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 346 transitions. [2024-11-14 05:18:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:18,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:18,792 INFO L215 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] [2024-11-14 05:18:18,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:18:18,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:18,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash -119134661, now seen corresponding path program 3 times [2024-11-14 05:18:18,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:18,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225801477] [2024-11-14 05:18:18,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:19,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:19,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225801477] [2024-11-14 05:18:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225801477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:19,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:19,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823205745] [2024-11-14 05:18:19,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:19,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:19,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:18:19,203 INFO L87 Difference]: Start difference. First operand 134 states and 346 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:19,451 INFO L93 Difference]: Finished difference Result 170 states and 434 transitions. [2024-11-14 05:18:19,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:19,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:19,453 INFO L225 Difference]: With dead ends: 170 [2024-11-14 05:18:19,453 INFO L226 Difference]: Without dead ends: 147 [2024-11-14 05:18:19,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:18:19,454 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:19,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 26 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-14 05:18:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2024-11-14 05:18:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.627737226277372) internal successors, (360), 137 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 360 transitions. [2024-11-14 05:18:19,471 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 360 transitions. Word has length 22 [2024-11-14 05:18:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:19,472 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 360 transitions. [2024-11-14 05:18:19,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 360 transitions. [2024-11-14 05:18:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:19,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:19,473 INFO L215 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] [2024-11-14 05:18:19,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:18:19,473 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:19,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2104168455, now seen corresponding path program 3 times [2024-11-14 05:18:19,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:19,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430115399] [2024-11-14 05:18:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:19,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:19,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430115399] [2024-11-14 05:18:19,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430115399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:19,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:19,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021928798] [2024-11-14 05:18:19,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:19,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:19,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:18:19,815 INFO L87 Difference]: Start difference. First operand 138 states and 360 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:20,063 INFO L93 Difference]: Finished difference Result 172 states and 428 transitions. [2024-11-14 05:18:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:20,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:20,065 INFO L225 Difference]: With dead ends: 172 [2024-11-14 05:18:20,066 INFO L226 Difference]: Without dead ends: 147 [2024-11-14 05:18:20,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:18:20,067 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:20,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 22 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-14 05:18:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2024-11-14 05:18:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.613138686131387) internal successors, (358), 137 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 358 transitions. [2024-11-14 05:18:20,089 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 358 transitions. Word has length 22 [2024-11-14 05:18:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:20,089 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 358 transitions. [2024-11-14 05:18:20,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 358 transitions. [2024-11-14 05:18:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:20,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:20,091 INFO L215 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] [2024-11-14 05:18:20,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:18:20,091 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:20,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash -744001959, now seen corresponding path program 4 times [2024-11-14 05:18:20,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:20,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507784643] [2024-11-14 05:18:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:20,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507784643] [2024-11-14 05:18:20,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507784643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95055687] [2024-11-14 05:18:20,430 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:18:20,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:20,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:20,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:20,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:18:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:20,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 05:18:20,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:20,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:20,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2024-11-14 05:18:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:20,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:20,821 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:18:20,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:18:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:20,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95055687] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:20,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:18:20,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 14 [2024-11-14 05:18:20,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653174870] [2024-11-14 05:18:20,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:20,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:18:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:18:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:18:20,866 INFO L87 Difference]: Start difference. First operand 138 states and 358 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:21,056 INFO L93 Difference]: Finished difference Result 198 states and 493 transitions. [2024-11-14 05:18:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:18:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:21,059 INFO L225 Difference]: With dead ends: 198 [2024-11-14 05:18:21,059 INFO L226 Difference]: Without dead ends: 177 [2024-11-14 05:18:21,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:18:21,060 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:21,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 17 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-14 05:18:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 138. [2024-11-14 05:18:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.613138686131387) internal successors, (358), 137 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 358 transitions. [2024-11-14 05:18:21,078 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 358 transitions. Word has length 22 [2024-11-14 05:18:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:21,079 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 358 transitions. [2024-11-14 05:18:21,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 358 transitions. [2024-11-14 05:18:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:21,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:21,080 INFO L215 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] [2024-11-14 05:18:21,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:18:21,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 05:18:21,284 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:21,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1166644875, now seen corresponding path program 4 times [2024-11-14 05:18:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997557991] [2024-11-14 05:18:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:21,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997557991] [2024-11-14 05:18:21,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997557991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:21,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:21,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799549291] [2024-11-14 05:18:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:21,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:21,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:18:21,645 INFO L87 Difference]: Start difference. First operand 138 states and 358 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:21,896 INFO L93 Difference]: Finished difference Result 170 states and 424 transitions. [2024-11-14 05:18:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:21,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:21,898 INFO L225 Difference]: With dead ends: 170 [2024-11-14 05:18:21,898 INFO L226 Difference]: Without dead ends: 142 [2024-11-14 05:18:21,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:18:21,899 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:21,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 25 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-14 05:18:21,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-11-14 05:18:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.5985401459854014) internal successors, (356), 137 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 356 transitions. [2024-11-14 05:18:21,924 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 356 transitions. Word has length 22 [2024-11-14 05:18:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:21,925 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 356 transitions. [2024-11-14 05:18:21,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 356 transitions. [2024-11-14 05:18:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:21,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:21,926 INFO L215 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] [2024-11-14 05:18:21,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 05:18:21,926 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:21,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1276935315, now seen corresponding path program 5 times [2024-11-14 05:18:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:21,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665606763] [2024-11-14 05:18:21,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:22,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665606763] [2024-11-14 05:18:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665606763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:22,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:22,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:22,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626019116] [2024-11-14 05:18:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:22,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:22,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:22,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:18:22,274 INFO L87 Difference]: Start difference. First operand 138 states and 356 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:22,469 INFO L93 Difference]: Finished difference Result 173 states and 442 transitions. [2024-11-14 05:18:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:22,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:22,471 INFO L225 Difference]: With dead ends: 173 [2024-11-14 05:18:22,471 INFO L226 Difference]: Without dead ends: 150 [2024-11-14 05:18:22,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:18:22,473 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:22,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-14 05:18:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2024-11-14 05:18:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.5985401459854014) internal successors, (356), 137 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 356 transitions. [2024-11-14 05:18:22,495 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 356 transitions. Word has length 22 [2024-11-14 05:18:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:22,496 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 356 transitions. [2024-11-14 05:18:22,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 356 transitions. [2024-11-14 05:18:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:22,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:22,498 INFO L215 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] [2024-11-14 05:18:22,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:18:22,500 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash -708098479, now seen corresponding path program 5 times [2024-11-14 05:18:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388596230] [2024-11-14 05:18:22,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:22,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:22,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:22,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388596230] [2024-11-14 05:18:22,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388596230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:22,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:22,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308262941] [2024-11-14 05:18:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:22,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:22,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:22,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:18:22,871 INFO L87 Difference]: Start difference. First operand 138 states and 356 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:23,070 INFO L93 Difference]: Finished difference Result 167 states and 414 transitions. [2024-11-14 05:18:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:23,072 INFO L225 Difference]: With dead ends: 167 [2024-11-14 05:18:23,072 INFO L226 Difference]: Without dead ends: 142 [2024-11-14 05:18:23,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:18:23,073 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:23,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 25 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-14 05:18:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2024-11-14 05:18:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.585185185185185) internal successors, (349), 135 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 349 transitions. [2024-11-14 05:18:23,092 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 349 transitions. Word has length 22 [2024-11-14 05:18:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:23,092 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 349 transitions. [2024-11-14 05:18:23,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 349 transitions. [2024-11-14 05:18:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:23,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:23,093 INFO L215 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] [2024-11-14 05:18:23,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:18:23,094 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:23,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1358334371, now seen corresponding path program 6 times [2024-11-14 05:18:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102896674] [2024-11-14 05:18:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:23,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:23,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102896674] [2024-11-14 05:18:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102896674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:23,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253587930] [2024-11-14 05:18:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:23,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:18:23,432 INFO L87 Difference]: Start difference. First operand 136 states and 349 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:23,658 INFO L93 Difference]: Finished difference Result 171 states and 435 transitions. [2024-11-14 05:18:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:18:23,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:23,660 INFO L225 Difference]: With dead ends: 171 [2024-11-14 05:18:23,660 INFO L226 Difference]: Without dead ends: 148 [2024-11-14 05:18:23,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:18:23,661 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:23,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 26 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-14 05:18:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2024-11-14 05:18:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.622047244094488) internal successors, (333), 127 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 333 transitions. [2024-11-14 05:18:23,681 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 333 transitions. Word has length 22 [2024-11-14 05:18:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:23,682 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 333 transitions. [2024-11-14 05:18:23,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 333 transitions. [2024-11-14 05:18:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:18:23,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:23,684 INFO L215 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] [2024-11-14 05:18:23,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 05:18:23,684 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:23,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2067830019, now seen corresponding path program 6 times [2024-11-14 05:18:23,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230927195] [2024-11-14 05:18:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:23,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:24,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230927195] [2024-11-14 05:18:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230927195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:24,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:24,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:24,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552019684] [2024-11-14 05:18:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:18:24,030 INFO L87 Difference]: Start difference. First operand 128 states and 333 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:24,189 INFO L93 Difference]: Finished difference Result 161 states and 399 transitions. [2024-11-14 05:18:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:24,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:18:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:24,191 INFO L225 Difference]: With dead ends: 161 [2024-11-14 05:18:24,191 INFO L226 Difference]: Without dead ends: 128 [2024-11-14 05:18:24,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:18:24,192 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:24,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-14 05:18:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-14 05:18:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.590551181102362) internal successors, (329), 127 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 329 transitions. [2024-11-14 05:18:24,210 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 329 transitions. Word has length 22 [2024-11-14 05:18:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:24,211 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 329 transitions. [2024-11-14 05:18:24,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 329 transitions. [2024-11-14 05:18:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:18:24,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:24,212 INFO L215 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] [2024-11-14 05:18:24,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 05:18:24,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:24,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:24,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1504892240, now seen corresponding path program 1 times [2024-11-14 05:18:24,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:24,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580473533] [2024-11-14 05:18:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:24,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:24,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580473533] [2024-11-14 05:18:24,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580473533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:24,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982399604] [2024-11-14 05:18:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:24,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:24,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:24,313 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:24,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:18:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:24,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:18:24,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:24,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:24,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982399604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:24,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1141334393] [2024-11-14 05:18:24,558 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:24,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:24,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 6 [2024-11-14 05:18:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606313044] [2024-11-14 05:18:24,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:24,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:18:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:24,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:18:24,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:18:24,560 INFO L87 Difference]: Start difference. First operand 128 states and 329 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 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) [2024-11-14 05:18:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:24,752 INFO L93 Difference]: Finished difference Result 278 states and 742 transitions. [2024-11-14 05:18:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:24,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 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 23 [2024-11-14 05:18:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:24,755 INFO L225 Difference]: With dead ends: 278 [2024-11-14 05:18:24,755 INFO L226 Difference]: Without dead ends: 254 [2024-11-14 05:18:24,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:18:24,756 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:24,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 18 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-14 05:18:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 189. [2024-11-14 05:18:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.771276595744681) internal successors, (521), 188 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 521 transitions. [2024-11-14 05:18:24,782 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 521 transitions. Word has length 23 [2024-11-14 05:18:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:24,782 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 521 transitions. [2024-11-14 05:18:24,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 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) [2024-11-14 05:18:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 521 transitions. [2024-11-14 05:18:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:18:24,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:24,784 INFO L215 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] [2024-11-14 05:18:24,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:24,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:24,984 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:24,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash -816019538, now seen corresponding path program 2 times [2024-11-14 05:18:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:24,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067253084] [2024-11-14 05:18:24,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:25,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067253084] [2024-11-14 05:18:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067253084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374411788] [2024-11-14 05:18:25,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:18:25,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:25,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:25,076 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:25,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:18:25,171 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:18:25,171 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:25,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:18:25,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:25,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:18:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374411788] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:25,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:18:25,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2024-11-14 05:18:25,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275345905] [2024-11-14 05:18:25,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:25,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:18:25,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:25,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:18:25,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:18:25,302 INFO L87 Difference]: Start difference. First operand 189 states and 521 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:25,428 INFO L93 Difference]: Finished difference Result 291 states and 803 transitions. [2024-11-14 05:18:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:18:25,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-14 05:18:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:25,431 INFO L225 Difference]: With dead ends: 291 [2024-11-14 05:18:25,431 INFO L226 Difference]: Without dead ends: 278 [2024-11-14 05:18:25,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:18:25,432 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:25,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 12 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:25,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-14 05:18:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 237. [2024-11-14 05:18:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 2.8940677966101696) internal successors, (683), 236 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 683 transitions. [2024-11-14 05:18:25,464 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 683 transitions. Word has length 23 [2024-11-14 05:18:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:25,465 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 683 transitions. [2024-11-14 05:18:25,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 683 transitions. [2024-11-14 05:18:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:18:25,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:25,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:25,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:18:25,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:25,674 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:25,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:25,674 INFO L85 PathProgramCache]: Analyzing trace with hash -334960430, now seen corresponding path program 3 times [2024-11-14 05:18:25,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:25,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653243748] [2024-11-14 05:18:25,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:25,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:25,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653243748] [2024-11-14 05:18:25,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653243748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824837570] [2024-11-14 05:18:25,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:18:25,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:25,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:25,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:18:25,861 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:18:25,861 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:25,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:18:25,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:26,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:26,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824837570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:26,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:18:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2024-11-14 05:18:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046874493] [2024-11-14 05:18:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:26,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:18:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:26,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:18:26,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:18:26,071 INFO L87 Difference]: Start difference. First operand 237 states and 683 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:26,352 INFO L93 Difference]: Finished difference Result 368 states and 952 transitions. [2024-11-14 05:18:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:18:26,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-14 05:18:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:26,356 INFO L225 Difference]: With dead ends: 368 [2024-11-14 05:18:26,356 INFO L226 Difference]: Without dead ends: 355 [2024-11-14 05:18:26,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:18:26,358 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 69 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:26,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 37 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-14 05:18:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 310. [2024-11-14 05:18:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.750809061488673) internal successors, (850), 309 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 850 transitions. [2024-11-14 05:18:26,408 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 850 transitions. Word has length 25 [2024-11-14 05:18:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:26,409 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 850 transitions. [2024-11-14 05:18:26,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 850 transitions. [2024-11-14 05:18:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:18:26,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:26,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:26,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:18:26,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:26,611 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:26,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:26,612 INFO L85 PathProgramCache]: Analyzing trace with hash 914079058, now seen corresponding path program 4 times [2024-11-14 05:18:26,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:26,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323450267] [2024-11-14 05:18:26,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:26,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:26,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323450267] [2024-11-14 05:18:26,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323450267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820142499] [2024-11-14 05:18:26,713 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:18:26,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:26,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:26,715 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:26,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:18:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:26,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:18:26,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:26,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:26,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820142499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1371961091] [2024-11-14 05:18:27,001 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:27,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:27,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-11-14 05:18:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408901927] [2024-11-14 05:18:27,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:27,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:18:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:18:27,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:18:27,006 INFO L87 Difference]: Start difference. First operand 310 states and 850 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:27,435 INFO L93 Difference]: Finished difference Result 1056 states and 2845 transitions. [2024-11-14 05:18:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:18:27,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-14 05:18:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:27,440 INFO L225 Difference]: With dead ends: 1056 [2024-11-14 05:18:27,440 INFO L226 Difference]: Without dead ends: 795 [2024-11-14 05:18:27,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:18:27,444 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 265 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:27,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 26 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-11-14 05:18:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 395. [2024-11-14 05:18:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 2.6954314720812182) internal successors, (1062), 394 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1062 transitions. [2024-11-14 05:18:27,512 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1062 transitions. Word has length 25 [2024-11-14 05:18:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:27,512 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 1062 transitions. [2024-11-14 05:18:27,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1062 transitions. [2024-11-14 05:18:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:18:27,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:27,514 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:27,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:18:27,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-14 05:18:27,718 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:27,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1535570098, now seen corresponding path program 5 times [2024-11-14 05:18:27,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:27,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583303796] [2024-11-14 05:18:27,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:27,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:27,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:27,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583303796] [2024-11-14 05:18:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583303796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:27,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878744168] [2024-11-14 05:18:27,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:18:27,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:27,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:27,821 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:27,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:18:27,918 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:18:27,919 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:27,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 05:18:27,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:28,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:18:28,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878744168] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [830896444] [2024-11-14 05:18:28,571 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:28,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 22 [2024-11-14 05:18:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813288491] [2024-11-14 05:18:28,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:28,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 05:18:28,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:28,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 05:18:28,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-11-14 05:18:28,574 INFO L87 Difference]: Start difference. First operand 395 states and 1062 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:29,588 INFO L93 Difference]: Finished difference Result 896 states and 2198 transitions. [2024-11-14 05:18:29,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 05:18:29,589 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-14 05:18:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:29,593 INFO L225 Difference]: With dead ends: 896 [2024-11-14 05:18:29,593 INFO L226 Difference]: Without dead ends: 620 [2024-11-14 05:18:29,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=1534, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 05:18:29,595 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 325 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:29,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 74 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:18:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-14 05:18:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 390. [2024-11-14 05:18:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.673521850899743) internal successors, (1040), 389 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1040 transitions. [2024-11-14 05:18:29,668 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1040 transitions. Word has length 25 [2024-11-14 05:18:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:29,668 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 1040 transitions. [2024-11-14 05:18:29,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1040 transitions. [2024-11-14 05:18:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:18:29,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:29,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:29,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:18:29,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:29,875 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:29,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash 896721664, now seen corresponding path program 6 times [2024-11-14 05:18:29,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:29,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782551936] [2024-11-14 05:18:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:29,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:29,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782551936] [2024-11-14 05:18:29,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782551936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:29,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570984793] [2024-11-14 05:18:29,966 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:18:29,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:29,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:29,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:29,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:18:30,053 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:18:30,053 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:30,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:18:30,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:18:30,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:18:30,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570984793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:30,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1187249686] [2024-11-14 05:18:30,506 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:30,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:30,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2024-11-14 05:18:30,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985616160] [2024-11-14 05:18:30,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:30,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:18:30,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:30,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:18:30,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:18:30,509 INFO L87 Difference]: Start difference. First operand 390 states and 1040 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:31,192 INFO L93 Difference]: Finished difference Result 534 states and 1320 transitions. [2024-11-14 05:18:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:18:31,192 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-14 05:18:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:31,195 INFO L225 Difference]: With dead ends: 534 [2024-11-14 05:18:31,195 INFO L226 Difference]: Without dead ends: 407 [2024-11-14 05:18:31,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2024-11-14 05:18:31,196 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 233 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:31,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 67 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:18:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-14 05:18:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 297. [2024-11-14 05:18:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.7263513513513513) internal successors, (807), 296 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 807 transitions. [2024-11-14 05:18:31,245 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 807 transitions. Word has length 26 [2024-11-14 05:18:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:31,248 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 807 transitions. [2024-11-14 05:18:31,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 807 transitions. [2024-11-14 05:18:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:18:31,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:31,250 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:31,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:18:31,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:31,454 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:31,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2032440702, now seen corresponding path program 7 times [2024-11-14 05:18:31,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:31,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535412660] [2024-11-14 05:18:31,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:31,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:31,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535412660] [2024-11-14 05:18:31,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535412660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:31,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002161872] [2024-11-14 05:18:31,681 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:18:31,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:31,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:31,683 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:31,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 05:18:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:31,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:18:31,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:31,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:32,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002161872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:32,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1827974179] [2024-11-14 05:18:32,224 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:32,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:32,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-11-14 05:18:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938745982] [2024-11-14 05:18:32,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:32,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 05:18:32,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:32,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 05:18:32,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2024-11-14 05:18:32,229 INFO L87 Difference]: Start difference. First operand 297 states and 807 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:32,595 INFO L93 Difference]: Finished difference Result 520 states and 1371 transitions. [2024-11-14 05:18:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:18:32,596 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-14 05:18:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:32,599 INFO L225 Difference]: With dead ends: 520 [2024-11-14 05:18:32,603 INFO L226 Difference]: Without dead ends: 479 [2024-11-14 05:18:32,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:18:32,604 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:32,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 34 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-14 05:18:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 333. [2024-11-14 05:18:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.7018072289156625) internal successors, (897), 332 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 897 transitions. [2024-11-14 05:18:32,658 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 897 transitions. Word has length 27 [2024-11-14 05:18:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:32,659 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 897 transitions. [2024-11-14 05:18:32,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 897 transitions. [2024-11-14 05:18:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:18:32,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:32,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:32,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 05:18:32,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-14 05:18:32,861 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:32,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash -187122562, now seen corresponding path program 8 times [2024-11-14 05:18:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:32,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974827607] [2024-11-14 05:18:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:32,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:18:33,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974827607] [2024-11-14 05:18:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974827607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330844427] [2024-11-14 05:18:33,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:18:33,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:33,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:33,060 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:33,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 05:18:33,164 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:18:33,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:33,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:18:33,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:18:33,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:18:33,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330844427] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:33,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732187542] [2024-11-14 05:18:33,567 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:33,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:33,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-11-14 05:18:33,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910044378] [2024-11-14 05:18:33,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:33,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 05:18:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:33,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 05:18:33,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:18:33,569 INFO L87 Difference]: Start difference. First operand 333 states and 897 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:33,941 INFO L93 Difference]: Finished difference Result 468 states and 1234 transitions. [2024-11-14 05:18:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:18:33,942 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-14 05:18:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:33,945 INFO L225 Difference]: With dead ends: 468 [2024-11-14 05:18:33,945 INFO L226 Difference]: Without dead ends: 416 [2024-11-14 05:18:33,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:18:33,946 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 92 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:33,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 36 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:18:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-14 05:18:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 342. [2024-11-14 05:18:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.7067448680351904) internal successors, (923), 341 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 923 transitions. [2024-11-14 05:18:34,018 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 923 transitions. Word has length 27 [2024-11-14 05:18:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:34,018 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 923 transitions. [2024-11-14 05:18:34,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 923 transitions. [2024-11-14 05:18:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:18:34,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:34,019 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:34,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:34,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-14 05:18:34,225 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1026750505, now seen corresponding path program 1 times [2024-11-14 05:18:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297257321] [2024-11-14 05:18:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:34,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:34,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297257321] [2024-11-14 05:18:34,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297257321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:34,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633132870] [2024-11-14 05:18:34,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:34,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:34,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:34,805 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:34,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 05:18:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:34,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:18:34,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:35,086 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:18:35,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-11-14 05:18:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:35,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:35,239 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:18:35,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:18:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633132870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [691413230] [2024-11-14 05:18:35,305 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:35,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:35,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 20 [2024-11-14 05:18:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927438884] [2024-11-14 05:18:35,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:35,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:18:35,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:35,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:18:35,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:18:35,307 INFO L87 Difference]: Start difference. First operand 342 states and 923 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:36,141 INFO L93 Difference]: Finished difference Result 557 states and 1455 transitions. [2024-11-14 05:18:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:18:36,141 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:18:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:36,145 INFO L225 Difference]: With dead ends: 557 [2024-11-14 05:18:36,147 INFO L226 Difference]: Without dead ends: 536 [2024-11-14 05:18:36,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2024-11-14 05:18:36,149 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 139 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:36,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 88 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:18:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-14 05:18:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 377. [2024-11-14 05:18:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 2.8138297872340425) internal successors, (1058), 376 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1058 transitions. [2024-11-14 05:18:36,235 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1058 transitions. Word has length 28 [2024-11-14 05:18:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:36,235 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 1058 transitions. [2024-11-14 05:18:36,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1058 transitions. [2024-11-14 05:18:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:18:36,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:36,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:36,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 05:18:36,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-14 05:18:36,440 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:36,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1332610263, now seen corresponding path program 1 times [2024-11-14 05:18:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270499225] [2024-11-14 05:18:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:36,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:36,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270499225] [2024-11-14 05:18:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270499225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941868283] [2024-11-14 05:18:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:36,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:36,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:36,927 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:36,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 05:18:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:37,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:18:37,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:37,174 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:18:37,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-14 05:18:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:37,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:37,300 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:18:37,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:18:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:37,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941868283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:37,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [384548187] [2024-11-14 05:18:37,359 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:37,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:37,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 20 [2024-11-14 05:18:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182840087] [2024-11-14 05:18:37,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:37,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:18:37,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:37,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:18:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:18:37,361 INFO L87 Difference]: Start difference. First operand 377 states and 1058 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:38,048 INFO L93 Difference]: Finished difference Result 511 states and 1323 transitions. [2024-11-14 05:18:38,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:18:38,048 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:18:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:38,051 INFO L225 Difference]: With dead ends: 511 [2024-11-14 05:18:38,051 INFO L226 Difference]: Without dead ends: 449 [2024-11-14 05:18:38,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2024-11-14 05:18:38,052 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 103 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:38,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 65 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:18:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-14 05:18:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 377. [2024-11-14 05:18:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 2.779255319148936) internal successors, (1045), 376 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1045 transitions. [2024-11-14 05:18:38,156 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1045 transitions. Word has length 28 [2024-11-14 05:18:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:38,156 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 1045 transitions. [2024-11-14 05:18:38,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1045 transitions. [2024-11-14 05:18:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:18:38,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:38,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:38,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 05:18:38,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 05:18:38,363 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:38,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash 906967787, now seen corresponding path program 2 times [2024-11-14 05:18:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:38,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860390251] [2024-11-14 05:18:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:38,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860390251] [2024-11-14 05:18:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860390251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955715001] [2024-11-14 05:18:38,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:18:38,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:38,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:38,867 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:38,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 05:18:38,991 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:18:38,991 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:38,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-14 05:18:38,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:39,025 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 15 treesize of output 1 [2024-11-14 05:18:39,074 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 8 treesize of output 1 [2024-11-14 05:18:39,101 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 15 treesize of output 1 [2024-11-14 05:18:39,351 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:18:39,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-14 05:18:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:39,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:39,750 INFO L349 Elim1Store]: treesize reduction 38, result has 53.7 percent of original size [2024-11-14 05:18:39,750 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 125 [2024-11-14 05:18:39,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~i_AB~0 4)) (.cse16 (* c_~i_BA~0 4))) (let ((.cse7 (+ c_~A~0.offset .cse16 4)) (.cse3 (+ .cse16 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ c_~A~0.offset 4 .cse11)) (.cse2 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (= c_~i_BA~0 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (.cse0 (= c_~i_AB~0 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|))) (and (or .cse0 (let ((.cse6 (+ 4 .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (let ((.cse1 (select .cse4 .cse7))) (or (= .cse1 (select v_arrayElimArr_1 .cse2)) (= .cse1 (select v_arrayElimArr_1 .cse3)) (not (= (select .cse4 .cse5) (select v_arrayElimArr_1 .cse6))))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (or (= (select .cse8 .cse7) (select v_arrayElimArr_1 .cse2)) (not (= (select .cse8 .cse5) (select v_arrayElimArr_1 .cse6)))))) (not .cse9)) (or .cse9 (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (or (= (select .cse10 .cse7) (select v_arrayElimArr_1 .cse3)) (not (= (select .cse10 .cse5) (select v_arrayElimArr_1 .cse6)))))))))) (or (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse7)) (.cse13 (select v_arrayElimArr_1 .cse2))) (or (= .cse12 .cse13) (= .cse12 (select v_arrayElimArr_1 .cse3)) (not (= (select .cse14 .cse5) .cse13)))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (or (= (select .cse15 .cse7) (select v_arrayElimArr_1 .cse3)) (not (= (select .cse15 .cse5) (select v_arrayElimArr_1 .cse2)))))) .cse9)) (not .cse0))))) is different from false [2024-11-14 05:18:39,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~i_BA~0 4))) (let ((.cse4 (+ .cse16 4)) (.cse5 (+ .cse16 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (= c_~i_BA~0 0)) (.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (= c_~i_AB~0 0))) (and (or (not .cse0) (and (or .cse1 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_2 Int)) (let ((.cse2 (select (store |c_#memory_int| v_subst_2 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse2 .cse3) (select v_arrayElimArr_1 4))) (= (select v_arrayElimArr_1 .cse4) (select .cse2 .cse5)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_1 Int)) (let ((.cse6 (select (store |c_#memory_int| v_subst_1 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse6 .cse5)) (.cse7 (select v_arrayElimArr_1 4))) (or (not (= (select .cse6 .cse3) .cse7)) (= (select v_arrayElimArr_1 .cse4) .cse8) (= .cse8 .cse7))))))) (or (let ((.cse15 (* c_~i_AB~0 4))) (let ((.cse9 (+ 4 .cse15)) (.cse11 (+ 4 .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_3 Int)) (let ((.cse10 (select (store |c_#memory_int| v_subst_3 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse10 .cse5))) (or (not (= (select v_arrayElimArr_1 .cse9) (select .cse10 .cse11))) (= .cse12 (select v_arrayElimArr_1 .cse4)) (= .cse12 (select v_arrayElimArr_1 4)))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_5 Int)) (let ((.cse13 (select (store |c_#memory_int| v_subst_5 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select v_arrayElimArr_1 .cse4) (select .cse13 .cse5)) (not (= (select .cse13 .cse11) (select v_arrayElimArr_1 .cse9)))))) .cse1) (or (not .cse1) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_4 Int)) (let ((.cse14 (select (store |c_#memory_int| v_subst_4 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select .cse14 .cse3) (select v_arrayElimArr_1 4)) (not (= (select v_arrayElimArr_1 .cse9) (select .cse14 .cse11)))))))))) .cse0)))) is different from false [2024-11-14 05:18:39,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:39,994 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2024-11-14 05:18:40,002 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:18:40,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 61 [2024-11-14 05:18:40,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:18:40,050 INFO L349 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2024-11-14 05:18:40,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 72 [2024-11-14 05:18:40,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:40,102 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2024-11-14 05:18:40,114 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:18:40,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2024-11-14 05:18:40,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:18:40,123 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:18:40,213 INFO L349 Elim1Store]: treesize reduction 8, result has 90.6 percent of original size [2024-11-14 05:18:40,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 125 [2024-11-14 05:18:40,372 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:18:40,372 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2024-11-14 05:18:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-14 05:18:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955715001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1314501085] [2024-11-14 05:18:40,405 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:40,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:40,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 29 [2024-11-14 05:18:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780739824] [2024-11-14 05:18:40,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:40,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 05:18:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:40,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 05:18:40,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=628, Unknown=2, NotChecked=106, Total=870 [2024-11-14 05:18:40,407 INFO L87 Difference]: Start difference. First operand 377 states and 1045 transitions. Second operand has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:42,933 INFO L93 Difference]: Finished difference Result 906 states and 2415 transitions. [2024-11-14 05:18:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-14 05:18:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:18:42,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:42,938 INFO L225 Difference]: With dead ends: 906 [2024-11-14 05:18:42,939 INFO L226 Difference]: Without dead ends: 860 [2024-11-14 05:18:42,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=576, Invalid=3212, Unknown=2, NotChecked=242, Total=4032 [2024-11-14 05:18:42,941 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 281 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 568 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:42,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 121 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1542 Invalid, 0 Unknown, 568 Unchecked, 1.2s Time] [2024-11-14 05:18:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-11-14 05:18:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 415. [2024-11-14 05:18:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 2.845410628019324) internal successors, (1178), 414 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1178 transitions. [2024-11-14 05:18:43,027 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1178 transitions. Word has length 28 [2024-11-14 05:18:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:43,027 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 1178 transitions. [2024-11-14 05:18:43,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1178 transitions. [2024-11-14 05:18:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:18:43,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:43,029 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:43,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 05:18:43,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:43,230 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:43,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:43,230 INFO L85 PathProgramCache]: Analyzing trace with hash 911147591, now seen corresponding path program 2 times [2024-11-14 05:18:43,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:43,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579647197] [2024-11-14 05:18:43,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:43,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:43,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:43,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579647197] [2024-11-14 05:18:43,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579647197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:43,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315071277] [2024-11-14 05:18:43,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:18:43,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:43,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:43,691 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:43,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 05:18:43,805 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:18:43,805 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:43,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 05:18:43,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:43,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:18:43,881 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 15 treesize of output 1 [2024-11-14 05:18:43,920 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:18:43,920 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 [2024-11-14 05:18:43,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:18:44,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:18:44,254 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:18:44,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:18:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:44,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:44,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:44,690 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 66 [2024-11-14 05:18:44,753 INFO L349 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2024-11-14 05:18:44,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 208 treesize of output 184 [2024-11-14 05:18:44,768 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:18:44,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:18:44,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:44,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 132 [2024-11-14 05:18:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 2 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:18:45,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315071277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:45,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [44588335] [2024-11-14 05:18:45,092 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:45,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 32 [2024-11-14 05:18:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082829586] [2024-11-14 05:18:45,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:45,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:18:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:45,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:18:45,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=869, Unknown=10, NotChecked=0, Total=1056 [2024-11-14 05:18:45,098 INFO L87 Difference]: Start difference. First operand 415 states and 1178 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:46,537 INFO L93 Difference]: Finished difference Result 554 states and 1468 transitions. [2024-11-14 05:18:46,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:18:46,538 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:18:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:46,541 INFO L225 Difference]: With dead ends: 554 [2024-11-14 05:18:46,541 INFO L226 Difference]: Without dead ends: 511 [2024-11-14 05:18:46,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=1560, Unknown=11, NotChecked=0, Total=1892 [2024-11-14 05:18:46,542 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 131 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:46,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 127 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1329 Invalid, 2 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:18:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-14 05:18:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 417. [2024-11-14 05:18:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 2.8389423076923075) internal successors, (1181), 416 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1181 transitions. [2024-11-14 05:18:46,637 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1181 transitions. Word has length 28 [2024-11-14 05:18:46,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:46,637 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 1181 transitions. [2024-11-14 05:18:46,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1181 transitions. [2024-11-14 05:18:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:18:46,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:46,639 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:46,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:46,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-14 05:18:46,844 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:46,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash -245641139, now seen corresponding path program 3 times [2024-11-14 05:18:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488147218] [2024-11-14 05:18:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:47,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:47,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488147218] [2024-11-14 05:18:47,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488147218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982819579] [2024-11-14 05:18:47,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:18:47,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:47,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:47,288 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:47,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 05:18:47,398 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:18:47,398 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:47,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:18:47,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:47,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:47,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-11-14 05:18:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:47,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:47,829 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:18:47,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:18:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982819579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690693961] [2024-11-14 05:18:47,891 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:47,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:47,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 21 [2024-11-14 05:18:47,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924974327] [2024-11-14 05:18:47,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:47,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 05:18:47,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:47,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 05:18:47,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:18:47,893 INFO L87 Difference]: Start difference. First operand 417 states and 1181 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:49,384 INFO L93 Difference]: Finished difference Result 795 states and 2049 transitions. [2024-11-14 05:18:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 05:18:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:18:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:49,387 INFO L225 Difference]: With dead ends: 795 [2024-11-14 05:18:49,387 INFO L226 Difference]: Without dead ends: 769 [2024-11-14 05:18:49,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=2118, Unknown=0, NotChecked=0, Total=2450 [2024-11-14 05:18:49,388 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 212 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:49,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 80 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:18:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-14 05:18:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 421. [2024-11-14 05:18:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 2.854761904761905) internal successors, (1199), 420 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1199 transitions. [2024-11-14 05:18:49,526 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1199 transitions. Word has length 28 [2024-11-14 05:18:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:49,527 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 1199 transitions. [2024-11-14 05:18:49,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1199 transitions. [2024-11-14 05:18:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:18:49,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:49,528 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:49,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 05:18:49,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:49,729 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:49,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash -668284055, now seen corresponding path program 3 times [2024-11-14 05:18:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:49,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166455585] [2024-11-14 05:18:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:50,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166455585] [2024-11-14 05:18:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166455585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418089914] [2024-11-14 05:18:50,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:18:50,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:50,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:50,155 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:50,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 05:18:50,273 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:18:50,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:50,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:18:50,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:50,334 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 19 treesize of output 1 [2024-11-14 05:18:50,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:50,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:18:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:50,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:50,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:50,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:18:50,857 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:18:50,857 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 50 treesize of output 39 [2024-11-14 05:18:50,959 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2024-11-14 05:18:50,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 190 [2024-11-14 05:18:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:18:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418089914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:51,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1221469720] [2024-11-14 05:18:51,271 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:51,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:51,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-11-14 05:18:51,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2564838] [2024-11-14 05:18:51,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:51,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:18:51,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:51,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:18:51,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:18:51,272 INFO L87 Difference]: Start difference. First operand 421 states and 1199 transitions. Second operand has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:53,727 INFO L93 Difference]: Finished difference Result 636 states and 1663 transitions. [2024-11-14 05:18:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 05:18:53,727 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:18:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:53,730 INFO L225 Difference]: With dead ends: 636 [2024-11-14 05:18:53,730 INFO L226 Difference]: Without dead ends: 603 [2024-11-14 05:18:53,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2024-11-14 05:18:53,731 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 165 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:53,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 99 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:18:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-14 05:18:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 427. [2024-11-14 05:18:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 2.868544600938967) internal successors, (1222), 426 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1222 transitions. [2024-11-14 05:18:53,832 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1222 transitions. Word has length 28 [2024-11-14 05:18:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:53,832 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 1222 transitions. [2024-11-14 05:18:53,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1222 transitions. [2024-11-14 05:18:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:18:53,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:53,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:53,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 05:18:54,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:54,039 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:54,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1775296135, now seen corresponding path program 4 times [2024-11-14 05:18:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387826722] [2024-11-14 05:18:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:54,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387826722] [2024-11-14 05:18:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387826722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799449515] [2024-11-14 05:18:54,472 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:18:54,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:54,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:54,475 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:54,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 05:18:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:54,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:18:54,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:54,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:54,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:18:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:54,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:54,883 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:18:54,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:18:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:54,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799449515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:54,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1144097129] [2024-11-14 05:18:54,941 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:54,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2024-11-14 05:18:54,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761996320] [2024-11-14 05:18:54,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:54,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:18:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:54,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:18:54,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:18:54,943 INFO L87 Difference]: Start difference. First operand 427 states and 1222 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:55,817 INFO L93 Difference]: Finished difference Result 597 states and 1591 transitions. [2024-11-14 05:18:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:18:55,818 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:18:55,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:55,820 INFO L225 Difference]: With dead ends: 597 [2024-11-14 05:18:55,820 INFO L226 Difference]: Without dead ends: 569 [2024-11-14 05:18:55,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2024-11-14 05:18:55,820 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 115 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:55,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 76 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:18:55,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-14 05:18:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 427. [2024-11-14 05:18:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 2.859154929577465) internal successors, (1218), 426 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1218 transitions. [2024-11-14 05:18:55,919 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1218 transitions. Word has length 28 [2024-11-14 05:18:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:55,919 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 1218 transitions. [2024-11-14 05:18:55,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1218 transitions. [2024-11-14 05:18:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:18:55,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:55,921 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:55,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-14 05:18:56,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:56,125 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:56,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:56,125 INFO L85 PathProgramCache]: Analyzing trace with hash -209737659, now seen corresponding path program 4 times [2024-11-14 05:18:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:56,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909423067] [2024-11-14 05:18:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:56,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:56,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909423067] [2024-11-14 05:18:56,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909423067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773811873] [2024-11-14 05:18:56,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:18:56,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:56,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:56,537 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:56,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 05:18:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:56,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:18:56,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:56,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:56,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:18:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:56,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:56,912 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:18:56,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:18:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773811873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [564908461] [2024-11-14 05:18:56,971 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:56,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:56,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2024-11-14 05:18:56,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267626606] [2024-11-14 05:18:56,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:56,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:18:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:56,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:18:56,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:18:56,973 INFO L87 Difference]: Start difference. First operand 427 states and 1218 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:58,050 INFO L93 Difference]: Finished difference Result 665 states and 1740 transitions. [2024-11-14 05:18:58,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:18:58,050 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:18:58,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:58,054 INFO L225 Difference]: With dead ends: 665 [2024-11-14 05:18:58,054 INFO L226 Difference]: Without dead ends: 636 [2024-11-14 05:18:58,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2024-11-14 05:18:58,055 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 140 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:58,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 105 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:18:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-14 05:18:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 427. [2024-11-14 05:18:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 2.8450704225352115) internal successors, (1212), 426 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1212 transitions. [2024-11-14 05:18:58,164 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1212 transitions. Word has length 28 [2024-11-14 05:18:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:58,164 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 1212 transitions. [2024-11-14 05:18:58,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1212 transitions. [2024-11-14 05:18:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:18:58,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:58,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:58,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 05:18:58,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-14 05:18:58,366 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:18:58,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash -875287633, now seen corresponding path program 5 times [2024-11-14 05:18:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:18:58,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038654277] [2024-11-14 05:18:58,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:58,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:18:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:18:58,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:18:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038654277] [2024-11-14 05:18:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038654277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:18:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247153962] [2024-11-14 05:18:58,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:18:58,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:58,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:58,756 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:58,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 05:18:58,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:18:58,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:18:58,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:18:58,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:59,137 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:18:59,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:18:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:18:59,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:59,255 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:18:59,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:18:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:18:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247153962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [861727201] [2024-11-14 05:18:59,311 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:18:59,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:18:59,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 21 [2024-11-14 05:18:59,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311433709] [2024-11-14 05:18:59,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:59,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 05:18:59,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:59,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 05:18:59,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:18:59,313 INFO L87 Difference]: Start difference. First operand 427 states and 1212 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:59,950 INFO L93 Difference]: Finished difference Result 567 states and 1508 transitions. [2024-11-14 05:18:59,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:18:59,951 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:18:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:59,953 INFO L225 Difference]: With dead ends: 567 [2024-11-14 05:18:59,953 INFO L226 Difference]: Without dead ends: 524 [2024-11-14 05:18:59,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2024-11-14 05:18:59,954 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 111 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:59,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 51 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:18:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-14 05:19:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 427. [2024-11-14 05:19:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 2.8450704225352115) internal successors, (1212), 426 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1212 transitions. [2024-11-14 05:19:00,017 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1212 transitions. Word has length 28 [2024-11-14 05:19:00,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:00,017 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 1212 transitions. [2024-11-14 05:19:00,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1212 transitions. [2024-11-14 05:19:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:00,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:00,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:00,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-14 05:19:00,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-14 05:19:00,219 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:00,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 934193513, now seen corresponding path program 5 times [2024-11-14 05:19:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:00,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198381465] [2024-11-14 05:19:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:00,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:00,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198381465] [2024-11-14 05:19:00,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198381465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:00,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509413537] [2024-11-14 05:19:00,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:19:00,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:00,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:00,601 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:00,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 05:19:00,737 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 05:19:00,738 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:00,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:19:00,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:00,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:00,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:19:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:19:00,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:00,964 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:00,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:01,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509413537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:01,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1352545994] [2024-11-14 05:19:01,019 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:01,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:01,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 19 [2024-11-14 05:19:01,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842739301] [2024-11-14 05:19:01,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:01,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:19:01,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:01,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:19:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:19:01,021 INFO L87 Difference]: Start difference. First operand 427 states and 1212 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:01,776 INFO L93 Difference]: Finished difference Result 628 states and 1663 transitions. [2024-11-14 05:19:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:19:01,776 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:01,779 INFO L225 Difference]: With dead ends: 628 [2024-11-14 05:19:01,779 INFO L226 Difference]: Without dead ends: 602 [2024-11-14 05:19:01,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 05:19:01,780 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 142 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:01,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 59 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:19:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-14 05:19:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 423. [2024-11-14 05:19:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 2.829383886255924) internal successors, (1194), 422 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1194 transitions. [2024-11-14 05:19:01,852 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1194 transitions. Word has length 28 [2024-11-14 05:19:01,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:01,852 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 1194 transitions. [2024-11-14 05:19:01,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1194 transitions. [2024-11-14 05:19:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:01,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:01,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:01,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-14 05:19:02,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-14 05:19:02,054 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:02,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:02,054 INFO L85 PathProgramCache]: Analyzing trace with hash 511550597, now seen corresponding path program 6 times [2024-11-14 05:19:02,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030169376] [2024-11-14 05:19:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:02,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:02,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:02,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030169376] [2024-11-14 05:19:02,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030169376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:02,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012786271] [2024-11-14 05:19:02,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:19:02,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:02,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:02,428 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:02,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-14 05:19:02,568 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:19:02,571 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:02,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:19:02,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:02,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:02,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:19:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:02,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:02,841 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:02,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:02,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012786271] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:02,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1366099508] [2024-11-14 05:19:02,901 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:02,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:02,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 19 [2024-11-14 05:19:02,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323391315] [2024-11-14 05:19:02,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:02,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:19:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:19:02,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:19:02,902 INFO L87 Difference]: Start difference. First operand 423 states and 1194 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:03,762 INFO L93 Difference]: Finished difference Result 602 states and 1579 transitions. [2024-11-14 05:19:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:19:03,762 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:03,765 INFO L225 Difference]: With dead ends: 602 [2024-11-14 05:19:03,765 INFO L226 Difference]: Without dead ends: 569 [2024-11-14 05:19:03,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 05:19:03,766 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 111 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:03,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 61 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:19:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-14 05:19:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 423. [2024-11-14 05:19:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 2.8199052132701423) internal successors, (1190), 422 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1190 transitions. [2024-11-14 05:19:03,879 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1190 transitions. Word has length 28 [2024-11-14 05:19:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:03,880 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 1190 transitions. [2024-11-14 05:19:03,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1190 transitions. [2024-11-14 05:19:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:03,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:03,881 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:03,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-14 05:19:04,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-14 05:19:04,086 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:04,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:04,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1339836509, now seen corresponding path program 7 times [2024-11-14 05:19:04,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:04,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932871142] [2024-11-14 05:19:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:04,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:04,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932871142] [2024-11-14 05:19:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932871142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215713563] [2024-11-14 05:19:04,461 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:19:04,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:04,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:04,465 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:04,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 05:19:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:04,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:19:04,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:04,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:04,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:19:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:04,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:04,812 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:04,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:04,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215713563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:04,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [328143489] [2024-11-14 05:19:04,876 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:04,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:04,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 18 [2024-11-14 05:19:04,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449576808] [2024-11-14 05:19:04,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:04,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:19:04,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:04,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:19:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:19:04,878 INFO L87 Difference]: Start difference. First operand 423 states and 1190 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:05,879 INFO L93 Difference]: Finished difference Result 622 states and 1648 transitions. [2024-11-14 05:19:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:19:05,880 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:05,882 INFO L225 Difference]: With dead ends: 622 [2024-11-14 05:19:05,882 INFO L226 Difference]: Without dead ends: 599 [2024-11-14 05:19:05,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2024-11-14 05:19:05,882 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 101 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:05,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 72 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:19:05,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-14 05:19:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 423. [2024-11-14 05:19:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 2.8199052132701423) internal successors, (1190), 422 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1190 transitions. [2024-11-14 05:19:05,956 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1190 transitions. Word has length 28 [2024-11-14 05:19:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:05,956 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 1190 transitions. [2024-11-14 05:19:05,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1190 transitions. [2024-11-14 05:19:05,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:05,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:05,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:05,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-14 05:19:06,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-14 05:19:06,158 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:06,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash 970096993, now seen corresponding path program 6 times [2024-11-14 05:19:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050814867] [2024-11-14 05:19:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:06,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:06,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050814867] [2024-11-14 05:19:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050814867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:06,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883304486] [2024-11-14 05:19:06,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:19:06,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:06,524 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:06,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 05:19:06,637 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:19:06,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:06,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:19:06,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:06,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:06,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:19:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:06,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:06,870 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:06,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883304486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [111387684] [2024-11-14 05:19:06,934 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:06,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:06,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 19 [2024-11-14 05:19:06,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581485761] [2024-11-14 05:19:06,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:06,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:19:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:19:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:19:06,935 INFO L87 Difference]: Start difference. First operand 423 states and 1190 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:07,934 INFO L93 Difference]: Finished difference Result 647 states and 1650 transitions. [2024-11-14 05:19:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 05:19:07,934 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:07,936 INFO L225 Difference]: With dead ends: 647 [2024-11-14 05:19:07,936 INFO L226 Difference]: Without dead ends: 618 [2024-11-14 05:19:07,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2024-11-14 05:19:07,937 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 132 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:07,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 61 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:19:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-14 05:19:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 419. [2024-11-14 05:19:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 2.813397129186603) internal successors, (1176), 418 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1176 transitions. [2024-11-14 05:19:08,062 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1176 transitions. Word has length 28 [2024-11-14 05:19:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:08,062 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 1176 transitions. [2024-11-14 05:19:08,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1176 transitions. [2024-11-14 05:19:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:08,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:08,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:08,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 05:19:08,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-14 05:19:08,266 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:08,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1258437453, now seen corresponding path program 8 times [2024-11-14 05:19:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:08,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375158841] [2024-11-14 05:19:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:08,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375158841] [2024-11-14 05:19:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375158841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201481404] [2024-11-14 05:19:08,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:19:08,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:08,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:08,658 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:08,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-14 05:19:08,783 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:19:08,783 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:08,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 05:19:08,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:08,922 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 15 treesize of output 1 [2024-11-14 05:19:09,228 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2024-11-14 05:19:09,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 34 [2024-11-14 05:19:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:19:09,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:09,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:09,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:19:10,046 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:19:10,046 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 48 treesize of output 40 [2024-11-14 05:19:10,106 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:19:10,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 194 [2024-11-14 05:19:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:19:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201481404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:10,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [652649393] [2024-11-14 05:19:10,540 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:10,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:10,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 35 [2024-11-14 05:19:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366444617] [2024-11-14 05:19:10,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:10,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:19:10,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:10,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:19:10,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1058, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 05:19:10,542 INFO L87 Difference]: Start difference. First operand 419 states and 1176 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:15,548 INFO L93 Difference]: Finished difference Result 2433 states and 6453 transitions. [2024-11-14 05:19:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-14 05:19:15,549 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:15,559 INFO L225 Difference]: With dead ends: 2433 [2024-11-14 05:19:15,559 INFO L226 Difference]: Without dead ends: 2377 [2024-11-14 05:19:15,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2942 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1917, Invalid=9003, Unknown=0, NotChecked=0, Total=10920 [2024-11-14 05:19:15,562 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 626 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:15,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 217 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2417 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 05:19:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2024-11-14 05:19:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 718. [2024-11-14 05:19:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 3.1380753138075312) internal successors, (2250), 717 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 2250 transitions. [2024-11-14 05:19:15,752 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 2250 transitions. Word has length 28 [2024-11-14 05:19:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:15,753 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 2250 transitions. [2024-11-14 05:19:15,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 2250 transitions. [2024-11-14 05:19:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:15,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:15,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:15,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-14 05:19:15,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:15,954 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:15,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash -548941805, now seen corresponding path program 7 times [2024-11-14 05:19:15,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:15,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870381763] [2024-11-14 05:19:15,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:15,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:16,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870381763] [2024-11-14 05:19:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870381763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136859664] [2024-11-14 05:19:16,350 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:19:16,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:16,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:16,352 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:16,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-14 05:19:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:16,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:19:16,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:16,613 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:19:16,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-14 05:19:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:16,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:16,723 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:16,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:16,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136859664] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:16,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2128751742] [2024-11-14 05:19:16,790 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:16,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:16,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 19 [2024-11-14 05:19:16,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011748355] [2024-11-14 05:19:16,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:16,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:19:16,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:16,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:19:16,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:19:16,793 INFO L87 Difference]: Start difference. First operand 718 states and 2250 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:17,662 INFO L93 Difference]: Finished difference Result 824 states and 2467 transitions. [2024-11-14 05:19:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:19:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:17,666 INFO L225 Difference]: With dead ends: 824 [2024-11-14 05:19:17,667 INFO L226 Difference]: Without dead ends: 787 [2024-11-14 05:19:17,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:19:17,668 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 88 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:17,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 72 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:19:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-14 05:19:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 718. [2024-11-14 05:19:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 3.1241283124128314) internal successors, (2240), 717 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 2240 transitions. [2024-11-14 05:19:17,875 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 2240 transitions. Word has length 28 [2024-11-14 05:19:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:17,876 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 2240 transitions. [2024-11-14 05:19:17,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 2240 transitions. [2024-11-14 05:19:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:17,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:17,878 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:17,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-14 05:19:18,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:18,079 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:18,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:18,080 INFO L85 PathProgramCache]: Analyzing trace with hash 982954159, now seen corresponding path program 8 times [2024-11-14 05:19:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:18,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143572462] [2024-11-14 05:19:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:18,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143572462] [2024-11-14 05:19:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143572462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481262218] [2024-11-14 05:19:18,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:19:18,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:18,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:18,496 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:18,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 05:19:18,632 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:19:18,632 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:18,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:19:18,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:18,717 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 15 treesize of output 1 [2024-11-14 05:19:19,023 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:19:19,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-14 05:19:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:19:19,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:19,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:19,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:19:19,421 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:19:19,421 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 50 treesize of output 39 [2024-11-14 05:19:19,510 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2024-11-14 05:19:19,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2024-11-14 05:19:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:19:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481262218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [342956948] [2024-11-14 05:19:19,827 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:19,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:19,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 31 [2024-11-14 05:19:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254444924] [2024-11-14 05:19:19,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 05:19:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:19,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 05:19:19,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2024-11-14 05:19:19,830 INFO L87 Difference]: Start difference. First operand 718 states and 2240 transitions. Second operand has 32 states, 32 states have (on average 2.3125) internal successors, (74), 31 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) [2024-11-14 05:19:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:22,311 INFO L93 Difference]: Finished difference Result 1614 states and 4623 transitions. [2024-11-14 05:19:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-14 05:19:22,312 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 31 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 28 [2024-11-14 05:19:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:22,316 INFO L225 Difference]: With dead ends: 1614 [2024-11-14 05:19:22,317 INFO L226 Difference]: Without dead ends: 1560 [2024-11-14 05:19:22,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=798, Invalid=2742, Unknown=0, NotChecked=0, Total=3540 [2024-11-14 05:19:22,318 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:22,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 70 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:19:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2024-11-14 05:19:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 806. [2024-11-14 05:19:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 3.2496894409937886) internal successors, (2616), 805 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2616 transitions. [2024-11-14 05:19:22,536 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 2616 transitions. Word has length 28 [2024-11-14 05:19:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:22,537 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 2616 transitions. [2024-11-14 05:19:22,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 31 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) [2024-11-14 05:19:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 2616 transitions. [2024-11-14 05:19:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:22,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:22,539 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:22,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 05:19:22,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:22,742 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:22,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash 987133963, now seen corresponding path program 9 times [2024-11-14 05:19:22,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:22,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752681760] [2024-11-14 05:19:22,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:22,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:23,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752681760] [2024-11-14 05:19:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752681760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570874211] [2024-11-14 05:19:23,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:19:23,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:23,138 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:23,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-14 05:19:23,273 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:19:23,274 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:23,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 05:19:23,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:23,417 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:19:23,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-14 05:19:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:23,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:23,513 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:23,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:19:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570874211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [95365618] [2024-11-14 05:19:23,566 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:23,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:23,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 19 [2024-11-14 05:19:23,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954451559] [2024-11-14 05:19:23,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:23,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:19:23,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:23,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:19:23,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:19:23,568 INFO L87 Difference]: Start difference. First operand 806 states and 2616 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:24,430 INFO L93 Difference]: Finished difference Result 927 states and 2867 transitions. [2024-11-14 05:19:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:19:24,431 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:24,434 INFO L225 Difference]: With dead ends: 927 [2024-11-14 05:19:24,435 INFO L226 Difference]: Without dead ends: 884 [2024-11-14 05:19:24,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:19:24,436 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 111 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:24,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 50 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:19:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-11-14 05:19:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 806. [2024-11-14 05:19:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 3.2322981366459627) internal successors, (2602), 805 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2602 transitions. [2024-11-14 05:19:24,630 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 2602 transitions. Word has length 28 [2024-11-14 05:19:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:24,630 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 2602 transitions. [2024-11-14 05:19:24,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 2602 transitions. [2024-11-14 05:19:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:24,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:24,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:24,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-14 05:19:24,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:24,834 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:24,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash -169654767, now seen corresponding path program 9 times [2024-11-14 05:19:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512405059] [2024-11-14 05:19:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:25,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512405059] [2024-11-14 05:19:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512405059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001311821] [2024-11-14 05:19:25,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:19:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:25,203 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:25,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-14 05:19:25,323 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:19:25,323 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:25,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:19:25,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:25,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:25,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:19:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:25,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:25,569 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:25,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:19:25,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001311821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [610373323] [2024-11-14 05:19:25,635 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:25,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:25,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 19 [2024-11-14 05:19:25,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144600802] [2024-11-14 05:19:25,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:25,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:19:25,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:25,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:19:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:19:25,636 INFO L87 Difference]: Start difference. First operand 806 states and 2602 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:26,810 INFO L93 Difference]: Finished difference Result 1127 states and 3412 transitions. [2024-11-14 05:19:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:19:26,810 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:26,814 INFO L225 Difference]: With dead ends: 1127 [2024-11-14 05:19:26,814 INFO L226 Difference]: Without dead ends: 1106 [2024-11-14 05:19:26,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 05:19:26,815 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 138 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:26,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 65 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:19:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-11-14 05:19:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 814. [2024-11-14 05:19:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 3.2447724477244773) internal successors, (2638), 813 states have internal predecessors, (2638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2638 transitions. [2024-11-14 05:19:27,041 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 2638 transitions. Word has length 28 [2024-11-14 05:19:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:27,041 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 2638 transitions. [2024-11-14 05:19:27,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 2638 transitions. [2024-11-14 05:19:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:27,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:27,043 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:27,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-14 05:19:27,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-14 05:19:27,243 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:27,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash -592297683, now seen corresponding path program 10 times [2024-11-14 05:19:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:27,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117035928] [2024-11-14 05:19:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:27,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:27,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:27,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117035928] [2024-11-14 05:19:27,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117035928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:27,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014654226] [2024-11-14 05:19:27,595 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:19:27,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:27,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:27,599 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:27,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-14 05:19:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:27,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:19:27,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:27,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:27,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:19:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:27,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:27,954 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:27,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:19:28,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014654226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:28,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [310140843] [2024-11-14 05:19:28,015 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:28,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:28,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 18 [2024-11-14 05:19:28,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002201491] [2024-11-14 05:19:28,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:28,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:19:28,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:28,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:19:28,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:19:28,016 INFO L87 Difference]: Start difference. First operand 814 states and 2638 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:29,218 INFO L93 Difference]: Finished difference Result 1105 states and 3342 transitions. [2024-11-14 05:19:29,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:19:29,219 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:29,222 INFO L225 Difference]: With dead ends: 1105 [2024-11-14 05:19:29,222 INFO L226 Difference]: Without dead ends: 1072 [2024-11-14 05:19:29,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1250, Unknown=0, NotChecked=0, Total=1482 [2024-11-14 05:19:29,223 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 175 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:29,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 49 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:19:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-14 05:19:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 846. [2024-11-14 05:19:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 3.2828402366863907) internal successors, (2774), 845 states have internal predecessors, (2774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 2774 transitions. [2024-11-14 05:19:29,454 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 2774 transitions. Word has length 28 [2024-11-14 05:19:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:29,454 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 2774 transitions. [2024-11-14 05:19:29,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 2774 transitions. [2024-11-14 05:19:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:29,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:29,457 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:29,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-14 05:19:29,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-14 05:19:29,657 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:29,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1851282507, now seen corresponding path program 11 times [2024-11-14 05:19:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393025396] [2024-11-14 05:19:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:29,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:29,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:29,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393025396] [2024-11-14 05:19:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393025396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:29,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052405703] [2024-11-14 05:19:29,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:19:29,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:29,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:29,997 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:29,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-14 05:19:30,121 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:19:30,121 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:30,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:19:30,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:30,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:30,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-11-14 05:19:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:19:30,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:30,430 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:30,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:19:30,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052405703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [968709499] [2024-11-14 05:19:30,485 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:30,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:30,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 6] total 20 [2024-11-14 05:19:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548379901] [2024-11-14 05:19:30,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:30,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:19:30,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:19:30,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:19:30,486 INFO L87 Difference]: Start difference. First operand 846 states and 2774 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:31,458 INFO L93 Difference]: Finished difference Result 988 states and 3097 transitions. [2024-11-14 05:19:31,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 05:19:31,458 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:31,461 INFO L225 Difference]: With dead ends: 988 [2024-11-14 05:19:31,461 INFO L226 Difference]: Without dead ends: 960 [2024-11-14 05:19:31,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 05:19:31,462 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 108 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:31,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 59 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:19:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-14 05:19:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 838. [2024-11-14 05:19:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 3.2425328554360813) internal successors, (2714), 837 states have internal predecessors, (2714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2714 transitions. [2024-11-14 05:19:31,664 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2714 transitions. Word has length 28 [2024-11-14 05:19:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:31,664 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2714 transitions. [2024-11-14 05:19:31,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2714 transitions. [2024-11-14 05:19:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:31,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:31,665 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:31,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-14 05:19:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:31,865 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:31,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash -133751287, now seen corresponding path program 10 times [2024-11-14 05:19:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701936582] [2024-11-14 05:19:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:32,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:32,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701936582] [2024-11-14 05:19:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701936582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410414881] [2024-11-14 05:19:32,183 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:19:32,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:32,185 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:32,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-14 05:19:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:32,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:19:32,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:32,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:32,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:19:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:32,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:32,548 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:32,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:19:32,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410414881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:32,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [207871931] [2024-11-14 05:19:32,597 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:32,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:32,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 18 [2024-11-14 05:19:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285771504] [2024-11-14 05:19:32,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:32,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:19:32,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:32,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:19:32,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:19:32,599 INFO L87 Difference]: Start difference. First operand 838 states and 2714 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:33,659 INFO L93 Difference]: Finished difference Result 1049 states and 3205 transitions. [2024-11-14 05:19:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:19:33,659 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:33,662 INFO L225 Difference]: With dead ends: 1049 [2024-11-14 05:19:33,662 INFO L226 Difference]: Without dead ends: 1020 [2024-11-14 05:19:33,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 05:19:33,663 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 125 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:33,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 67 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:19:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-11-14 05:19:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 838. [2024-11-14 05:19:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 3.2329749103942653) internal successors, (2706), 837 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2706 transitions. [2024-11-14 05:19:33,852 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2706 transitions. Word has length 28 [2024-11-14 05:19:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:33,852 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2706 transitions. [2024-11-14 05:19:33,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2706 transitions. [2024-11-14 05:19:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:33,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:33,854 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:33,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-14 05:19:34,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-14 05:19:34,054 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:34,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1498352187, now seen corresponding path program 11 times [2024-11-14 05:19:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:34,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141387828] [2024-11-14 05:19:34,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:34,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:34,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141387828] [2024-11-14 05:19:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141387828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631347433] [2024-11-14 05:19:34,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:19:34,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:34,431 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:34,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-14 05:19:34,570 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:19:34,570 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:34,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-14 05:19:34,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:34,685 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 15 treesize of output 1 [2024-11-14 05:19:34,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:34,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-11-14 05:19:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:19:34,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:35,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:35,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:19:35,412 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:19:35,412 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 48 treesize of output 40 [2024-11-14 05:19:35,468 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:19:35,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 194 [2024-11-14 05:19:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:35,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631347433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [375433685] [2024-11-14 05:19:35,994 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:35,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:35,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 29 [2024-11-14 05:19:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380075498] [2024-11-14 05:19:35,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:35,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 05:19:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 05:19:35,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2024-11-14 05:19:35,996 INFO L87 Difference]: Start difference. First operand 838 states and 2706 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:40,859 INFO L93 Difference]: Finished difference Result 3247 states and 9911 transitions. [2024-11-14 05:19:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-14 05:19:40,859 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:40,870 INFO L225 Difference]: With dead ends: 3247 [2024-11-14 05:19:40,870 INFO L226 Difference]: Without dead ends: 3179 [2024-11-14 05:19:40,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=856, Invalid=4546, Unknown=0, NotChecked=0, Total=5402 [2024-11-14 05:19:40,872 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 415 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:40,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 136 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 05:19:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-11-14 05:19:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 1572. [2024-11-14 05:19:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1571 states have (on average 3.400381922342457) internal successors, (5342), 1571 states have internal predecessors, (5342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 5342 transitions. [2024-11-14 05:19:41,505 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 5342 transitions. Word has length 28 [2024-11-14 05:19:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:41,505 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 5342 transitions. [2024-11-14 05:19:41,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 5342 transitions. [2024-11-14 05:19:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:41,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:41,508 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:41,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-11-14 05:19:41,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:41,708 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:41,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1920995103, now seen corresponding path program 12 times [2024-11-14 05:19:41,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:41,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232714973] [2024-11-14 05:19:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:42,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232714973] [2024-11-14 05:19:42,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232714973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878808996] [2024-11-14 05:19:42,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:19:42,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:42,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:42,061 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:42,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-14 05:19:42,189 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:19:42,189 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:42,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:19:42,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:42,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:42,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:19:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:42,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:42,427 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:42,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:19:42,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878808996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:42,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2071938158] [2024-11-14 05:19:42,490 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:42,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:42,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 19 [2024-11-14 05:19:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138498674] [2024-11-14 05:19:42,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:42,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:19:42,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:42,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:19:42,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:19:42,491 INFO L87 Difference]: Start difference. First operand 1572 states and 5342 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:44,031 INFO L93 Difference]: Finished difference Result 1809 states and 5926 transitions. [2024-11-14 05:19:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 05:19:44,031 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:44,038 INFO L225 Difference]: With dead ends: 1809 [2024-11-14 05:19:44,038 INFO L226 Difference]: Without dead ends: 1776 [2024-11-14 05:19:44,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2024-11-14 05:19:44,039 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 153 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:44,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 61 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:19:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-14 05:19:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1580. [2024-11-14 05:19:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 3.3932868904369853) internal successors, (5358), 1579 states have internal predecessors, (5358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 5358 transitions. [2024-11-14 05:19:44,735 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 5358 transitions. Word has length 28 [2024-11-14 05:19:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:44,735 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 5358 transitions. [2024-11-14 05:19:44,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 5358 transitions. [2024-11-14 05:19:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:44,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:44,737 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:44,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-11-14 05:19:44,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-14 05:19:44,938 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash 522585087, now seen corresponding path program 13 times [2024-11-14 05:19:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270170984] [2024-11-14 05:19:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:45,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:45,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270170984] [2024-11-14 05:19:45,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270170984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:45,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347221123] [2024-11-14 05:19:45,278 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:19:45,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:45,280 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:45,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-14 05:19:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:45,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:19:45,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:45,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:45,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:19:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:45,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:45,604 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:45,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:19:45,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347221123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:45,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1895953922] [2024-11-14 05:19:45,671 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:45,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:45,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 18 [2024-11-14 05:19:45,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387227030] [2024-11-14 05:19:45,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:45,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:19:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:45,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:19:45,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:19:45,673 INFO L87 Difference]: Start difference. First operand 1580 states and 5358 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:47,221 INFO L93 Difference]: Finished difference Result 1887 states and 6202 transitions. [2024-11-14 05:19:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 05:19:47,222 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:47,230 INFO L225 Difference]: With dead ends: 1887 [2024-11-14 05:19:47,230 INFO L226 Difference]: Without dead ends: 1864 [2024-11-14 05:19:47,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:19:47,232 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 139 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:47,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 68 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:19:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2024-11-14 05:19:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1580. [2024-11-14 05:19:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 3.3932868904369853) internal successors, (5358), 1579 states have internal predecessors, (5358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 5358 transitions. [2024-11-14 05:19:47,897 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 5358 transitions. Word has length 28 [2024-11-14 05:19:47,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:47,897 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 5358 transitions. [2024-11-14 05:19:47,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 5358 transitions. [2024-11-14 05:19:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:47,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:47,900 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:47,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-14 05:19:48,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:48,100 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:48,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1462448707, now seen corresponding path program 12 times [2024-11-14 05:19:48,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:48,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757495107] [2024-11-14 05:19:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:48,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757495107] [2024-11-14 05:19:48,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757495107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17276556] [2024-11-14 05:19:48,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:19:48,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:48,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:48,433 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:48,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-14 05:19:48,563 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:19:48,563 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:48,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:19:48,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:48,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:48,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:19:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:48,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:48,814 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:48,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:19:48,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17276556] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:48,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [730834866] [2024-11-14 05:19:48,867 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:48,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:48,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 19 [2024-11-14 05:19:48,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144662384] [2024-11-14 05:19:48,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:48,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:19:48,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:48,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:19:48,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:19:48,868 INFO L87 Difference]: Start difference. First operand 1580 states and 5358 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:50,601 INFO L93 Difference]: Finished difference Result 1909 states and 6139 transitions. [2024-11-14 05:19:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 05:19:50,601 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:50,605 INFO L225 Difference]: With dead ends: 1909 [2024-11-14 05:19:50,605 INFO L226 Difference]: Without dead ends: 1868 [2024-11-14 05:19:50,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:19:50,606 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 127 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:50,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 79 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:19:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2024-11-14 05:19:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1580. [2024-11-14 05:19:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 3.3894870170994302) internal successors, (5352), 1579 states have internal predecessors, (5352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 5352 transitions. [2024-11-14 05:19:51,064 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 5352 transitions. Word has length 28 [2024-11-14 05:19:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:51,064 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 5352 transitions. [2024-11-14 05:19:51,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 5352 transitions. [2024-11-14 05:19:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:51,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:51,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:51,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2024-11-14 05:19:51,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:51,267 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:51,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:51,267 INFO L85 PathProgramCache]: Analyzing trace with hash 245431619, now seen corresponding path program 14 times [2024-11-14 05:19:51,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:51,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066918373] [2024-11-14 05:19:51,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:51,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:51,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:51,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066918373] [2024-11-14 05:19:51,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066918373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:51,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855046605] [2024-11-14 05:19:51,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:19:51,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:51,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:51,619 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:51,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-14 05:19:51,771 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 05:19:51,771 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:51,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 05:19:51,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:51,852 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 15 treesize of output 1 [2024-11-14 05:19:52,062 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:19:52,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-14 05:19:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:19:52,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:52,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:52,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:19:52,330 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:19:52,331 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 50 treesize of output 39 [2024-11-14 05:19:52,447 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2024-11-14 05:19:52,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2024-11-14 05:19:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:19:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855046605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1241320152] [2024-11-14 05:19:52,862 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:52,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:52,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 26 [2024-11-14 05:19:52,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703955927] [2024-11-14 05:19:52,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:52,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:19:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:52,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:19:52,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:19:52,864 INFO L87 Difference]: Start difference. First operand 1580 states and 5352 transitions. Second operand has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:54,647 INFO L93 Difference]: Finished difference Result 1927 states and 6367 transitions. [2024-11-14 05:19:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 05:19:54,647 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:54,651 INFO L225 Difference]: With dead ends: 1927 [2024-11-14 05:19:54,651 INFO L226 Difference]: Without dead ends: 1899 [2024-11-14 05:19:54,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=0, NotChecked=0, Total=1640 [2024-11-14 05:19:54,652 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 166 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:54,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 77 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:19:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-11-14 05:19:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1640. [2024-11-14 05:19:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 3.403294691885296) internal successors, (5578), 1639 states have internal predecessors, (5578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5578 transitions. [2024-11-14 05:19:55,191 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5578 transitions. Word has length 28 [2024-11-14 05:19:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:55,192 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 5578 transitions. [2024-11-14 05:19:55,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5578 transitions. [2024-11-14 05:19:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:55,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:55,194 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:55,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2024-11-14 05:19:55,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:55,394 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:55,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1313479791, now seen corresponding path program 13 times [2024-11-14 05:19:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716355365] [2024-11-14 05:19:55,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:55,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716355365] [2024-11-14 05:19:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716355365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769314703] [2024-11-14 05:19:55,738 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:19:55,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:55,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:55,739 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:55,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-14 05:19:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:55,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:19:55,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:55,985 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:19:55,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-14 05:19:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:19:55,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:56,079 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:19:56,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:19:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:19:56,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769314703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [246973835] [2024-11-14 05:19:56,130 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:56,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 19 [2024-11-14 05:19:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571258142] [2024-11-14 05:19:56,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:56,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:19:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:19:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:19:56,131 INFO L87 Difference]: Start difference. First operand 1640 states and 5578 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:57,426 INFO L93 Difference]: Finished difference Result 1784 states and 5877 transitions. [2024-11-14 05:19:57,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:19:57,427 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:19:57,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:57,437 INFO L225 Difference]: With dead ends: 1784 [2024-11-14 05:19:57,437 INFO L226 Difference]: Without dead ends: 1731 [2024-11-14 05:19:57,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:19:57,438 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 107 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:57,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 53 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:19:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2024-11-14 05:19:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1640. [2024-11-14 05:19:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 3.388651616839536) internal successors, (5554), 1639 states have internal predecessors, (5554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5554 transitions. [2024-11-14 05:19:57,978 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5554 transitions. Word has length 28 [2024-11-14 05:19:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:57,978 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 5554 transitions. [2024-11-14 05:19:57,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5554 transitions. [2024-11-14 05:19:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:19:57,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:57,981 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:19:57,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2024-11-14 05:19:58,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2024-11-14 05:19:58,181 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:19:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1106672205, now seen corresponding path program 14 times [2024-11-14 05:19:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:19:58,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862170404] [2024-11-14 05:19:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:19:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:19:58,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:19:58,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862170404] [2024-11-14 05:19:58,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862170404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:19:58,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608562820] [2024-11-14 05:19:58,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:19:58,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:58,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:58,509 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:58,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-14 05:19:58,647 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:19:58,647 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:19:58,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 05:19:58,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:58,764 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 15 treesize of output 1 [2024-11-14 05:19:58,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:58,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-11-14 05:19:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:58,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:59,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:59,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:19:59,363 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:19:59,364 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 50 treesize of output 39 [2024-11-14 05:19:59,431 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2024-11-14 05:19:59,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2024-11-14 05:19:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:19:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608562820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:59,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [932096726] [2024-11-14 05:19:59,950 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:19:59,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:19:59,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 34 [2024-11-14 05:19:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653661056] [2024-11-14 05:19:59,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:59,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 05:19:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:19:59,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 05:19:59,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 05:19:59,951 INFO L87 Difference]: Start difference. First operand 1640 states and 5554 transitions. Second operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:03,511 INFO L93 Difference]: Finished difference Result 2591 states and 8319 transitions. [2024-11-14 05:20:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 05:20:03,511 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:20:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:03,519 INFO L225 Difference]: With dead ends: 2591 [2024-11-14 05:20:03,519 INFO L226 Difference]: Without dead ends: 2540 [2024-11-14 05:20:03,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=555, Invalid=2201, Unknown=0, NotChecked=0, Total=2756 [2024-11-14 05:20:03,521 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 336 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:03,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 119 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:20:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2024-11-14 05:20:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 1876. [2024-11-14 05:20:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1875 states have (on average 3.4869333333333334) internal successors, (6538), 1875 states have internal predecessors, (6538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 6538 transitions. [2024-11-14 05:20:04,448 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 6538 transitions. Word has length 28 [2024-11-14 05:20:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:04,448 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 6538 transitions. [2024-11-14 05:20:04,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 6538 transitions. [2024-11-14 05:20:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:20:04,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:04,450 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:04,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2024-11-14 05:20:04,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2024-11-14 05:20:04,651 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:04,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:04,651 INFO L85 PathProgramCache]: Analyzing trace with hash 684029289, now seen corresponding path program 15 times [2024-11-14 05:20:04,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:04,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543025471] [2024-11-14 05:20:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:04,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:20:05,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543025471] [2024-11-14 05:20:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543025471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408533604] [2024-11-14 05:20:05,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:20:05,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:05,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:05,026 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:05,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-14 05:20:05,164 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:20:05,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:20:05,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:20:05,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:05,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:20:05,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:20:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:05,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:05,438 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:20:05,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:20:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408533604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1200041557] [2024-11-14 05:20:05,504 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:05,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 20 [2024-11-14 05:20:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574927100] [2024-11-14 05:20:05,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:05,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:20:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:20:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:20:05,506 INFO L87 Difference]: Start difference. First operand 1876 states and 6538 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:07,701 INFO L93 Difference]: Finished difference Result 2259 states and 7480 transitions. [2024-11-14 05:20:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 05:20:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:20:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:07,706 INFO L225 Difference]: With dead ends: 2259 [2024-11-14 05:20:07,706 INFO L226 Difference]: Without dead ends: 2226 [2024-11-14 05:20:07,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=1620, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 05:20:07,707 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 174 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:07,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 85 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:20:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2024-11-14 05:20:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1876. [2024-11-14 05:20:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1875 states have (on average 3.472) internal successors, (6510), 1875 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 6510 transitions. [2024-11-14 05:20:08,454 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 6510 transitions. Word has length 28 [2024-11-14 05:20:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:08,454 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 6510 transitions. [2024-11-14 05:20:08,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 6510 transitions. [2024-11-14 05:20:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:20:08,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:08,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:08,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2024-11-14 05:20:08,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2024-11-14 05:20:08,657 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:08,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1167357817, now seen corresponding path program 16 times [2024-11-14 05:20:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891543163] [2024-11-14 05:20:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:20:09,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891543163] [2024-11-14 05:20:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891543163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194942232] [2024-11-14 05:20:09,015 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:20:09,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:09,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:09,017 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:09,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-14 05:20:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:09,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:20:09,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:09,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:20:09,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:20:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:09,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:09,375 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:20:09,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:20:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194942232] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1395667580] [2024-11-14 05:20:09,438 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:09,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:09,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2024-11-14 05:20:09,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512130356] [2024-11-14 05:20:09,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:09,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:20:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:20:09,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:20:09,439 INFO L87 Difference]: Start difference. First operand 1876 states and 6510 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:11,748 INFO L93 Difference]: Finished difference Result 2443 states and 8105 transitions. [2024-11-14 05:20:11,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 05:20:11,748 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:20:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:11,754 INFO L225 Difference]: With dead ends: 2443 [2024-11-14 05:20:11,754 INFO L226 Difference]: Without dead ends: 2420 [2024-11-14 05:20:11,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2024-11-14 05:20:11,755 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 191 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:11,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 82 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:20:11,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2024-11-14 05:20:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1874. [2024-11-14 05:20:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1873 states have (on average 3.470902295782168) internal successors, (6501), 1873 states have internal predecessors, (6501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 6501 transitions. [2024-11-14 05:20:12,487 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 6501 transitions. Word has length 28 [2024-11-14 05:20:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:12,487 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 6501 transitions. [2024-11-14 05:20:12,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 6501 transitions. [2024-11-14 05:20:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:20:12,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:12,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:12,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2024-11-14 05:20:12,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:12,692 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:12,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1142575685, now seen corresponding path program 15 times [2024-11-14 05:20:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577034185] [2024-11-14 05:20:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:20:13,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:13,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577034185] [2024-11-14 05:20:13,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577034185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:13,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325222098] [2024-11-14 05:20:13,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:20:13,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:13,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:13,076 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:13,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-11-14 05:20:13,232 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:20:13,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:20:13,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:20:13,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:13,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:20:13,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:20:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:13,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:13,526 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:20:13,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:20:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:13,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325222098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:13,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [428061395] [2024-11-14 05:20:13,589 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:13,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:13,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 20 [2024-11-14 05:20:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57980648] [2024-11-14 05:20:13,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:13,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:20:13,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:13,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:20:13,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:20:13,590 INFO L87 Difference]: Start difference. First operand 1874 states and 6501 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:15,823 INFO L93 Difference]: Finished difference Result 2241 states and 7416 transitions. [2024-11-14 05:20:15,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:20:15,823 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:20:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:15,828 INFO L225 Difference]: With dead ends: 2241 [2024-11-14 05:20:15,828 INFO L226 Difference]: Without dead ends: 2200 [2024-11-14 05:20:15,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2024-11-14 05:20:15,830 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 145 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:15,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 74 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:20:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2024-11-14 05:20:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1878. [2024-11-14 05:20:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1877 states have (on average 3.4667021843367074) internal successors, (6507), 1877 states have internal predecessors, (6507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 6507 transitions. [2024-11-14 05:20:16,432 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 6507 transitions. Word has length 28 [2024-11-14 05:20:16,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:16,432 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 6507 transitions. [2024-11-14 05:20:16,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 6507 transitions. [2024-11-14 05:20:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:20:16,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:16,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:16,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2024-11-14 05:20:16,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2024-11-14 05:20:16,635 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1085958761, now seen corresponding path program 17 times [2024-11-14 05:20:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:16,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918704850] [2024-11-14 05:20:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:20:16,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918704850] [2024-11-14 05:20:16,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918704850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834256449] [2024-11-14 05:20:16,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:20:16,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:16,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:16,992 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:16,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-14 05:20:17,142 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:20:17,142 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:20:17,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 05:20:17,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:17,281 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 15 treesize of output 1 [2024-11-14 05:20:17,569 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2024-11-14 05:20:17,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 34 [2024-11-14 05:20:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:20:17,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:18,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:20:18,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:20:18,256 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:20:18,256 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 48 treesize of output 40 [2024-11-14 05:20:18,312 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:20:18,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 194 [2024-11-14 05:20:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:20:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834256449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1457806080] [2024-11-14 05:20:18,711 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:18,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 35 [2024-11-14 05:20:18,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879301158] [2024-11-14 05:20:18,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:18,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:20:18,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:20:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1058, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 05:20:18,712 INFO L87 Difference]: Start difference. First operand 1878 states and 6507 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:26,977 INFO L93 Difference]: Finished difference Result 4591 states and 13825 transitions. [2024-11-14 05:20:26,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-14 05:20:26,977 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:20:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:26,986 INFO L225 Difference]: With dead ends: 4591 [2024-11-14 05:20:26,986 INFO L226 Difference]: Without dead ends: 4530 [2024-11-14 05:20:26,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4167 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2421, Invalid=11859, Unknown=0, NotChecked=0, Total=14280 [2024-11-14 05:20:26,988 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 726 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:26,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 227 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-14 05:20:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states. [2024-11-14 05:20:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 1832. [2024-11-14 05:20:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1831 states have (on average 3.4451119606772256) internal successors, (6308), 1831 states have internal predecessors, (6308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 6308 transitions. [2024-11-14 05:20:27,811 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 6308 transitions. Word has length 28 [2024-11-14 05:20:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:27,811 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 6308 transitions. [2024-11-14 05:20:27,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 6308 transitions. [2024-11-14 05:20:27,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:20:27,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:27,816 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:27,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2024-11-14 05:20:28,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2024-11-14 05:20:28,018 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:28,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash -376463113, now seen corresponding path program 16 times [2024-11-14 05:20:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308300212] [2024-11-14 05:20:28,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:28,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:20:28,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:28,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308300212] [2024-11-14 05:20:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308300212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661286509] [2024-11-14 05:20:28,361 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:20:28,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:28,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:28,362 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:28,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-11-14 05:20:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:28,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:20:28,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:28,631 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:20:28,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-14 05:20:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:28,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:28,743 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:20:28,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:20:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661286509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [863621175] [2024-11-14 05:20:28,805 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:28,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:28,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 20 [2024-11-14 05:20:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121604331] [2024-11-14 05:20:28,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:20:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:20:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:20:28,806 INFO L87 Difference]: Start difference. First operand 1832 states and 6308 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:30,550 INFO L93 Difference]: Finished difference Result 1994 states and 6647 transitions. [2024-11-14 05:20:30,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:20:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:20:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:30,555 INFO L225 Difference]: With dead ends: 1994 [2024-11-14 05:20:30,555 INFO L226 Difference]: Without dead ends: 1941 [2024-11-14 05:20:30,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 05:20:30,557 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 92 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:30,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 61 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:20:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2024-11-14 05:20:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1824. [2024-11-14 05:20:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1823 states have (on average 3.429511793746572) internal successors, (6252), 1823 states have internal predecessors, (6252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 6252 transitions. [2024-11-14 05:20:31,302 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 6252 transitions. Word has length 28 [2024-11-14 05:20:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:31,302 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 6252 transitions. [2024-11-14 05:20:31,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 6252 transitions. [2024-11-14 05:20:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:20:31,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:31,306 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:31,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2024-11-14 05:20:31,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-11-14 05:20:31,507 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:31,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1880311115, now seen corresponding path program 18 times [2024-11-14 05:20:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447780431] [2024-11-14 05:20:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:31,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:20:31,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:31,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447780431] [2024-11-14 05:20:31,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447780431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:31,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783587983] [2024-11-14 05:20:31,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:20:31,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:31,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:31,804 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:31,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2024-11-14 05:20:31,950 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:20:31,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:20:31,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:20:31,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:32,113 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:20:32,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2024-11-14 05:20:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:32,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:32,226 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:20:32,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:20:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:32,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783587983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:32,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [209127065] [2024-11-14 05:20:32,284 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:32,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:32,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 21 [2024-11-14 05:20:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748075223] [2024-11-14 05:20:32,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:32,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 05:20:32,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:32,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 05:20:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:20:32,285 INFO L87 Difference]: Start difference. First operand 1824 states and 6252 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:34,439 INFO L93 Difference]: Finished difference Result 2117 states and 7078 transitions. [2024-11-14 05:20:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:20:34,440 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:20:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:34,445 INFO L225 Difference]: With dead ends: 2117 [2024-11-14 05:20:34,445 INFO L226 Difference]: Without dead ends: 2089 [2024-11-14 05:20:34,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 05:20:34,446 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 149 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:34,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 81 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:20:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-14 05:20:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1886. [2024-11-14 05:20:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1885 states have (on average 3.449867374005305) internal successors, (6503), 1885 states have internal predecessors, (6503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6503 transitions. [2024-11-14 05:20:35,228 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6503 transitions. Word has length 28 [2024-11-14 05:20:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:35,228 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 6503 transitions. [2024-11-14 05:20:35,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6503 transitions. [2024-11-14 05:20:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:20:35,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:35,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:35,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2024-11-14 05:20:35,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:35,431 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:35,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash 220873545, now seen corresponding path program 17 times [2024-11-14 05:20:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:35,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132923364] [2024-11-14 05:20:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:20:35,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:35,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132923364] [2024-11-14 05:20:35,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132923364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:35,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459438630] [2024-11-14 05:20:35,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:20:35,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:35,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:35,742 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:35,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-14 05:20:35,893 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:20:35,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:20:35,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 05:20:35,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:35,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:20:35,948 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 19 treesize of output 1 [2024-11-14 05:20:35,973 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:20:35,973 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 [2024-11-14 05:20:36,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:20:36,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:20:36,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2024-11-14 05:20:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:20:36,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:38,541 INFO L349 Elim1Store]: treesize reduction 38, result has 53.7 percent of original size [2024-11-14 05:20:38,542 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 125 [2024-11-14 05:20:39,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:20:39,111 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2024-11-14 05:20:39,122 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:20:39,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 79 [2024-11-14 05:20:39,166 INFO L349 Elim1Store]: treesize reduction 16, result has 75.4 percent of original size [2024-11-14 05:20:39,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 82 [2024-11-14 05:20:39,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:20:39,233 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2024-11-14 05:20:39,241 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:20:39,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 67 [2024-11-14 05:20:39,303 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-11-14 05:20:39,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 74 [2024-11-14 05:20:39,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:20:39,364 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 77 [2024-11-14 05:20:39,379 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:20:39,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 109 [2024-11-14 05:20:39,503 INFO L349 Elim1Store]: treesize reduction 24, result has 77.1 percent of original size [2024-11-14 05:20:39,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 129 [2024-11-14 05:20:39,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:20:39,662 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2024-11-14 05:20:39,670 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:20:39,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 67 [2024-11-14 05:20:39,733 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-11-14 05:20:39,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 74 [2024-11-14 05:20:39,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:20:39,795 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 71 [2024-11-14 05:20:39,808 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:20:39,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 100 [2024-11-14 05:20:39,866 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-11-14 05:20:39,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 89 [2024-11-14 05:20:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:20:40,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459438630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:40,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1768268925] [2024-11-14 05:20:40,079 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:40,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:40,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 32 [2024-11-14 05:20:40,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450585473] [2024-11-14 05:20:40,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:40,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:20:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:40,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:20:40,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=869, Unknown=6, NotChecked=0, Total=1056 [2024-11-14 05:20:40,080 INFO L87 Difference]: Start difference. First operand 1886 states and 6503 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:42,205 INFO L93 Difference]: Finished difference Result 1955 states and 6641 transitions. [2024-11-14 05:20:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:20:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:20:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:42,210 INFO L225 Difference]: With dead ends: 1955 [2024-11-14 05:20:42,210 INFO L226 Difference]: Without dead ends: 1870 [2024-11-14 05:20:42,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=350, Invalid=1714, Unknown=6, NotChecked=0, Total=2070 [2024-11-14 05:20:42,210 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 79 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:42,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 93 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:20:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2024-11-14 05:20:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1862. [2024-11-14 05:20:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 3.434175174637292) internal successors, (6391), 1861 states have internal predecessors, (6391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 6391 transitions. [2024-11-14 05:20:42,884 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 6391 transitions. Word has length 28 [2024-11-14 05:20:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:42,884 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 6391 transitions. [2024-11-14 05:20:42,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 6391 transitions. [2024-11-14 05:20:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:20:42,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:42,889 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:42,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2024-11-14 05:20:43,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2024-11-14 05:20:43,089 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:43,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1935593952, now seen corresponding path program 9 times [2024-11-14 05:20:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268647521] [2024-11-14 05:20:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:43,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:43,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268647521] [2024-11-14 05:20:43,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268647521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:43,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106965241] [2024-11-14 05:20:43,167 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:20:43,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:43,169 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:43,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2024-11-14 05:20:43,305 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:20:43,305 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:20:43,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:20:43,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:20:43,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:20:43,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106965241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:20:43,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:20:43,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2024-11-14 05:20:43,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356599919] [2024-11-14 05:20:43,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:20:43,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:20:43,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:43,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:20:43,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:20:43,447 INFO L87 Difference]: Start difference. First operand 1862 states and 6391 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:44,815 INFO L93 Difference]: Finished difference Result 1974 states and 6627 transitions. [2024-11-14 05:20:44,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:20:44,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-14 05:20:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:44,820 INFO L225 Difference]: With dead ends: 1974 [2024-11-14 05:20:44,820 INFO L226 Difference]: Without dead ends: 1961 [2024-11-14 05:20:44,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:20:44,821 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:44,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 31 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:20:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-11-14 05:20:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1898. [2024-11-14 05:20:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1897 states have (on average 3.411175540326832) internal successors, (6471), 1897 states have internal predecessors, (6471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 6471 transitions. [2024-11-14 05:20:45,576 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 6471 transitions. Word has length 29 [2024-11-14 05:20:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:45,577 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 6471 transitions. [2024-11-14 05:20:45,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 6471 transitions. [2024-11-14 05:20:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:20:45,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:45,580 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:45,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2024-11-14 05:20:45,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:45,780 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:45,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash 299351495, now seen corresponding path program 19 times [2024-11-14 05:20:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741119742] [2024-11-14 05:20:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:20:45,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:45,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741119742] [2024-11-14 05:20:45,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741119742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:45,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448548731] [2024-11-14 05:20:45,895 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:20:45,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:45,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:45,898 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:45,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2024-11-14 05:20:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:46,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:20:46,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:20:46,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:20:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448548731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [788434113] [2024-11-14 05:20:46,308 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:46,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2024-11-14 05:20:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186071308] [2024-11-14 05:20:46,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:46,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:20:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:46,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:20:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:20:46,310 INFO L87 Difference]: Start difference. First operand 1898 states and 6471 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:49,056 INFO L93 Difference]: Finished difference Result 2993 states and 9605 transitions. [2024-11-14 05:20:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:20:49,057 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-14 05:20:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:49,061 INFO L225 Difference]: With dead ends: 2993 [2024-11-14 05:20:49,061 INFO L226 Difference]: Without dead ends: 1786 [2024-11-14 05:20:49,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2024-11-14 05:20:49,063 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 253 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:49,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 56 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:20:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2024-11-14 05:20:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 855. [2024-11-14 05:20:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 2.968384074941452) internal successors, (2535), 854 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2535 transitions. [2024-11-14 05:20:49,701 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2535 transitions. Word has length 30 [2024-11-14 05:20:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:49,702 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 2535 transitions. [2024-11-14 05:20:49,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2535 transitions. [2024-11-14 05:20:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:20:49,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:49,704 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:49,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2024-11-14 05:20:49,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2024-11-14 05:20:49,905 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:49,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1325279861, now seen corresponding path program 18 times [2024-11-14 05:20:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:49,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188920819] [2024-11-14 05:20:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:49,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:20:50,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:50,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188920819] [2024-11-14 05:20:50,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188920819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:50,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961653566] [2024-11-14 05:20:50,042 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:20:50,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:50,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:50,045 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:50,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-14 05:20:50,219 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:20:50,219 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:20:50,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:20:50,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:50,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:20:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961653566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1671760009] [2024-11-14 05:20:50,919 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:50,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:50,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2024-11-14 05:20:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697319318] [2024-11-14 05:20:50,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:50,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:20:50,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:50,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:20:50,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:20:50,920 INFO L87 Difference]: Start difference. First operand 855 states and 2535 transitions. Second operand has 25 states, 25 states have (on average 3.24) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:57,059 INFO L93 Difference]: Finished difference Result 2559 states and 6576 transitions. [2024-11-14 05:20:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-14 05:20:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-14 05:20:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:57,063 INFO L225 Difference]: With dead ends: 2559 [2024-11-14 05:20:57,063 INFO L226 Difference]: Without dead ends: 2037 [2024-11-14 05:20:57,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3550 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1546, Invalid=8156, Unknown=0, NotChecked=0, Total=9702 [2024-11-14 05:20:57,064 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 879 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:57,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 132 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 05:20:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2024-11-14 05:20:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1027. [2024-11-14 05:20:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.0350877192982457) internal successors, (3114), 1026 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 3114 transitions. [2024-11-14 05:20:57,659 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 3114 transitions. Word has length 30 [2024-11-14 05:20:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:57,659 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 3114 transitions. [2024-11-14 05:20:57,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 3114 transitions. [2024-11-14 05:20:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:20:57,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:57,661 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:57,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2024-11-14 05:20:57,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:57,861 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:57,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1205580037, now seen corresponding path program 19 times [2024-11-14 05:20:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:57,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945475473] [2024-11-14 05:20:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:20:57,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945475473] [2024-11-14 05:20:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945475473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311998481] [2024-11-14 05:20:57,958 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:20:57,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:57,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:57,960 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:57,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2024-11-14 05:20:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:58,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:20:58,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:20:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:20:58,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:20:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:20:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311998481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:20:58,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [438303232] [2024-11-14 05:20:58,358 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:20:58,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:20:58,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-14 05:20:58,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125946185] [2024-11-14 05:20:58,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:20:58,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:20:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:20:58,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:20:58,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:20:58,359 INFO L87 Difference]: Start difference. First operand 1027 states and 3114 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:20:59,243 INFO L93 Difference]: Finished difference Result 1097 states and 3252 transitions. [2024-11-14 05:20:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:20:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 05:20:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:20:59,246 INFO L225 Difference]: With dead ends: 1097 [2024-11-14 05:20:59,246 INFO L226 Difference]: Without dead ends: 842 [2024-11-14 05:20:59,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:20:59,247 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:20:59,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 24 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:20:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-14 05:20:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2024-11-14 05:20:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 3.159334126040428) internal successors, (2657), 841 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2657 transitions. [2024-11-14 05:20:59,669 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2657 transitions. Word has length 31 [2024-11-14 05:20:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:20:59,669 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 2657 transitions. [2024-11-14 05:20:59,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:20:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2657 transitions. [2024-11-14 05:20:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:20:59,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:20:59,671 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:20:59,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2024-11-14 05:20:59,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:59,871 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:20:59,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:20:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -952669705, now seen corresponding path program 20 times [2024-11-14 05:20:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:20:59,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025070073] [2024-11-14 05:20:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:20:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:20:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:20:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:20:59,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:20:59,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025070073] [2024-11-14 05:20:59,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025070073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:20:59,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712659232] [2024-11-14 05:20:59,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:20:59,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:20:59,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:20:59,954 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:20:59,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-11-14 05:21:00,119 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:21:00,119 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:21:00,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 05:21:00,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:21:00,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:21:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712659232] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:00,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [510202094] [2024-11-14 05:21:00,774 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:21:00,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:21:00,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 26 [2024-11-14 05:21:00,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78324560] [2024-11-14 05:21:00,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:21:00,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:21:00,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:21:00,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:21:00,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:21:00,776 INFO L87 Difference]: Start difference. First operand 842 states and 2657 transitions. Second operand has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:21:03,322 INFO L93 Difference]: Finished difference Result 1798 states and 5211 transitions. [2024-11-14 05:21:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-14 05:21:03,322 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-14 05:21:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:21:03,326 INFO L225 Difference]: With dead ends: 1798 [2024-11-14 05:21:03,326 INFO L226 Difference]: Without dead ends: 1700 [2024-11-14 05:21:03,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1793, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 05:21:03,328 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 172 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:21:03,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 88 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:21:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2024-11-14 05:21:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 933. [2024-11-14 05:21:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 932 states have (on average 3.070815450643777) internal successors, (2862), 932 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 2862 transitions. [2024-11-14 05:21:03,845 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 2862 transitions. Word has length 32 [2024-11-14 05:21:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:21:03,845 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 2862 transitions. [2024-11-14 05:21:03,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2862 transitions. [2024-11-14 05:21:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:21:03,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:21:03,847 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:21:03,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2024-11-14 05:21:04,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:04,047 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:21:04,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:21:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1221944441, now seen corresponding path program 20 times [2024-11-14 05:21:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:21:04,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528131180] [2024-11-14 05:21:04,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:21:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:21:04,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:21:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528131180] [2024-11-14 05:21:04,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528131180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:21:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347086837] [2024-11-14 05:21:04,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:21:04,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:04,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:21:04,131 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:21:04,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-11-14 05:21:04,314 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:21:04,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:21:04,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 05:21:04,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:21:04,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:21:04,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347086837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:04,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [599895618] [2024-11-14 05:21:04,885 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:21:04,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:21:04,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 25 [2024-11-14 05:21:04,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549402748] [2024-11-14 05:21:04,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:21:04,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:21:04,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:21:04,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:21:04,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:21:04,886 INFO L87 Difference]: Start difference. First operand 933 states and 2862 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:21:07,427 INFO L93 Difference]: Finished difference Result 1608 states and 4549 transitions. [2024-11-14 05:21:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-14 05:21:07,427 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-14 05:21:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:21:07,430 INFO L225 Difference]: With dead ends: 1608 [2024-11-14 05:21:07,431 INFO L226 Difference]: Without dead ends: 1526 [2024-11-14 05:21:07,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=1715, Unknown=0, NotChecked=0, Total=2070 [2024-11-14 05:21:07,431 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 198 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:21:07,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 66 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:21:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-11-14 05:21:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 949. [2024-11-14 05:21:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 3.0042194092827006) internal successors, (2848), 948 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2848 transitions. [2024-11-14 05:21:08,081 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2848 transitions. Word has length 32 [2024-11-14 05:21:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:21:08,081 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 2848 transitions. [2024-11-14 05:21:08,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2848 transitions. [2024-11-14 05:21:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:21:08,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:21:08,082 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:21:08,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2024-11-14 05:21:08,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2024-11-14 05:21:08,283 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:21:08,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:21:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2084180754, now seen corresponding path program 1 times [2024-11-14 05:21:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:21:08,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694519936] [2024-11-14 05:21:08,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:08,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:21:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:08,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:21:08,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694519936] [2024-11-14 05:21:08,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694519936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:21:08,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002487386] [2024-11-14 05:21:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:08,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:21:08,355 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:21:08,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-11-14 05:21:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:08,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:21:08,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:08,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 05:21:08,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002487386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:08,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1558949947] [2024-11-14 05:21:08,673 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:21:08,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:21:08,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 9 [2024-11-14 05:21:08,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575807276] [2024-11-14 05:21:08,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:21:08,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:21:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:21:08,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:21:08,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:21:08,674 INFO L87 Difference]: Start difference. First operand 949 states and 2848 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 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) [2024-11-14 05:21:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:21:10,426 INFO L93 Difference]: Finished difference Result 1360 states and 3890 transitions. [2024-11-14 05:21:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:21:10,427 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 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 33 [2024-11-14 05:21:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:21:10,430 INFO L225 Difference]: With dead ends: 1360 [2024-11-14 05:21:10,430 INFO L226 Difference]: Without dead ends: 1316 [2024-11-14 05:21:10,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:21:10,430 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:21:10,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:21:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2024-11-14 05:21:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1028. [2024-11-14 05:21:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 3.0710808179162608) internal successors, (3154), 1027 states have internal predecessors, (3154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 3154 transitions. [2024-11-14 05:21:11,103 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 3154 transitions. Word has length 33 [2024-11-14 05:21:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:21:11,104 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 3154 transitions. [2024-11-14 05:21:11,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 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) [2024-11-14 05:21:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 3154 transitions. [2024-11-14 05:21:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:21:11,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:21:11,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:21:11,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2024-11-14 05:21:11,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2024-11-14 05:21:11,306 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:21:11,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:21:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1337341614, now seen corresponding path program 2 times [2024-11-14 05:21:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:21:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195520909] [2024-11-14 05:21:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:21:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:11,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:21:11,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195520909] [2024-11-14 05:21:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195520909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:21:11,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186609720] [2024-11-14 05:21:11,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:21:11,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:11,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:21:11,393 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:21:11,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2024-11-14 05:21:11,563 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:21:11,563 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:21:11,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:21:11,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:11,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 05:21:11,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186609720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [943845416] [2024-11-14 05:21:11,713 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:21:11,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:21:11,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2024-11-14 05:21:11,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759547360] [2024-11-14 05:21:11,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:21:11,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:21:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:21:11,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:21:11,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:21:11,714 INFO L87 Difference]: Start difference. First operand 1028 states and 3154 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 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) [2024-11-14 05:21:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:21:13,918 INFO L93 Difference]: Finished difference Result 1484 states and 4324 transitions. [2024-11-14 05:21:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:21:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 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 33 [2024-11-14 05:21:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:21:13,921 INFO L225 Difference]: With dead ends: 1484 [2024-11-14 05:21:13,921 INFO L226 Difference]: Without dead ends: 1460 [2024-11-14 05:21:13,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:21:13,922 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:21:13,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 44 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:21:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-11-14 05:21:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1184. [2024-11-14 05:21:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 3.070160608622147) internal successors, (3632), 1183 states have internal predecessors, (3632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 3632 transitions. [2024-11-14 05:21:14,764 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 3632 transitions. Word has length 33 [2024-11-14 05:21:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:21:14,764 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 3632 transitions. [2024-11-14 05:21:14,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 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) [2024-11-14 05:21:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 3632 transitions. [2024-11-14 05:21:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:21:14,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:21:14,766 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:21:14,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2024-11-14 05:21:14,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2024-11-14 05:21:14,967 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:21:14,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:21:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1274623783, now seen corresponding path program 21 times [2024-11-14 05:21:14,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:21:14,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51424690] [2024-11-14 05:21:14,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:21:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:21:15,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:21:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51424690] [2024-11-14 05:21:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51424690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:21:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058602952] [2024-11-14 05:21:15,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:21:15,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:15,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:21:15,560 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:21:15,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2024-11-14 05:21:15,748 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:21:15,748 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:21:15,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:21:15,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:16,286 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:21:16,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2024-11-14 05:21:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:16,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:16,859 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:21:16,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:21:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:17,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058602952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:17,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [691536413] [2024-11-14 05:21:17,086 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:21:17,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:21:17,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2024-11-14 05:21:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558649350] [2024-11-14 05:21:17,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:21:17,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:21:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:21:17,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:21:17,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 05:21:17,088 INFO L87 Difference]: Start difference. First operand 1184 states and 3632 transitions. Second operand has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 35 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:21:25,522 INFO L93 Difference]: Finished difference Result 2378 states and 6387 transitions. [2024-11-14 05:21:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-14 05:21:25,522 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 35 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:21:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:21:25,527 INFO L225 Difference]: With dead ends: 2378 [2024-11-14 05:21:25,527 INFO L226 Difference]: Without dead ends: 2335 [2024-11-14 05:21:25,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3270 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1496, Invalid=9634, Unknown=0, NotChecked=0, Total=11130 [2024-11-14 05:21:25,528 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 571 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:21:25,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 155 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 05:21:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2024-11-14 05:21:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1330. [2024-11-14 05:21:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 3.09104589917231) internal successors, (4108), 1329 states have internal predecessors, (4108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 4108 transitions. [2024-11-14 05:21:26,460 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 4108 transitions. Word has length 34 [2024-11-14 05:21:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:21:26,460 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 4108 transitions. [2024-11-14 05:21:26,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 35 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 4108 transitions. [2024-11-14 05:21:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:21:26,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:21:26,462 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:21:26,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2024-11-14 05:21:26,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:26,663 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:21:26,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:21:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash 833023765, now seen corresponding path program 21 times [2024-11-14 05:21:26,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:21:26,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468431596] [2024-11-14 05:21:26,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:21:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:21:27,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:21:27,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468431596] [2024-11-14 05:21:27,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468431596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:21:27,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480423868] [2024-11-14 05:21:27,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:21:27,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:27,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:21:27,051 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:21:27,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2024-11-14 05:21:27,225 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:21:27,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:21:27,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 05:21:27,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:27,568 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:21:27,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 20 [2024-11-14 05:21:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:21:27,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:27,777 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:21:27,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:21:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:27,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480423868] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:27,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2125499781] [2024-11-14 05:21:27,873 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:21:27,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:21:27,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 30 [2024-11-14 05:21:27,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167943311] [2024-11-14 05:21:27,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:21:27,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:21:27,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:21:27,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:21:27,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:21:27,875 INFO L87 Difference]: Start difference. First operand 1330 states and 4108 transitions. Second operand has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 30 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:21:31,046 INFO L93 Difference]: Finished difference Result 1784 states and 5150 transitions. [2024-11-14 05:21:31,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:21:31,046 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 30 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:21:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:21:31,050 INFO L225 Difference]: With dead ends: 1784 [2024-11-14 05:21:31,050 INFO L226 Difference]: Without dead ends: 1655 [2024-11-14 05:21:31,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=2023, Unknown=0, NotChecked=0, Total=2256 [2024-11-14 05:21:31,051 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 167 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:21:31,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 131 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:21:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-11-14 05:21:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1384. [2024-11-14 05:21:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 3.0911062906724514) internal successors, (4275), 1383 states have internal predecessors, (4275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 4275 transitions. [2024-11-14 05:21:32,054 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 4275 transitions. Word has length 34 [2024-11-14 05:21:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:21:32,054 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 4275 transitions. [2024-11-14 05:21:32,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 30 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 4275 transitions. [2024-11-14 05:21:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:21:32,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:21:32,056 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:21:32,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2024-11-14 05:21:32,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:32,257 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:21:32,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:21:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash -421698789, now seen corresponding path program 22 times [2024-11-14 05:21:32,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:21:32,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948172238] [2024-11-14 05:21:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:32,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:21:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:21:32,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:21:32,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948172238] [2024-11-14 05:21:32,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948172238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:21:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910302859] [2024-11-14 05:21:32,727 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:21:32,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:21:32,729 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:21:32,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2024-11-14 05:21:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:32,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:21:32,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:33,126 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:21:33,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-11-14 05:21:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:33,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:33,327 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:21:33,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:21:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910302859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1010578389] [2024-11-14 05:21:33,426 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:21:33,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:21:33,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 27 [2024-11-14 05:21:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296319024] [2024-11-14 05:21:33,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:21:33,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:21:33,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:21:33,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:21:33,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2024-11-14 05:21:33,428 INFO L87 Difference]: Start difference. First operand 1384 states and 4275 transitions. Second operand has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:21:41,691 INFO L93 Difference]: Finished difference Result 2761 states and 7772 transitions. [2024-11-14 05:21:41,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-14 05:21:41,691 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:21:41,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:21:41,696 INFO L225 Difference]: With dead ends: 2761 [2024-11-14 05:21:41,696 INFO L226 Difference]: Without dead ends: 2650 [2024-11-14 05:21:41,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2963 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1243, Invalid=8857, Unknown=0, NotChecked=0, Total=10100 [2024-11-14 05:21:41,698 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 456 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:21:41,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 156 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 05:21:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2024-11-14 05:21:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 1409. [2024-11-14 05:21:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 3.0916193181818183) internal successors, (4353), 1408 states have internal predecessors, (4353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 4353 transitions. [2024-11-14 05:21:42,785 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 4353 transitions. Word has length 34 [2024-11-14 05:21:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:21:42,785 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 4353 transitions. [2024-11-14 05:21:42,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 4353 transitions. [2024-11-14 05:21:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:21:42,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:21:42,787 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:21:42,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2024-11-14 05:21:42,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:42,988 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:21:42,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:21:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1010738867, now seen corresponding path program 22 times [2024-11-14 05:21:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:21:42,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666698790] [2024-11-14 05:21:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:21:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:21:43,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:21:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666698790] [2024-11-14 05:21:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666698790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:21:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000887753] [2024-11-14 05:21:43,538 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:21:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:43,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:21:43,540 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:21:43,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2024-11-14 05:21:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:43,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:21:43,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:43,942 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:21:43,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-14 05:21:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:43,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:44,142 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:21:44,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:21:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:21:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000887753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [874414935] [2024-11-14 05:21:44,236 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:21:44,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:21:44,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 27 [2024-11-14 05:21:44,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844604650] [2024-11-14 05:21:44,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:21:44,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:21:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:21:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:21:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2024-11-14 05:21:44,238 INFO L87 Difference]: Start difference. First operand 1409 states and 4353 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:21:47,334 INFO L93 Difference]: Finished difference Result 1659 states and 4855 transitions. [2024-11-14 05:21:47,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 05:21:47,335 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:21:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:21:47,339 INFO L225 Difference]: With dead ends: 1659 [2024-11-14 05:21:47,339 INFO L226 Difference]: Without dead ends: 1596 [2024-11-14 05:21:47,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=1531, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 05:21:47,340 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 138 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:21:47,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 132 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:21:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-14 05:21:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1409. [2024-11-14 05:21:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 3.0859375) internal successors, (4345), 1408 states have internal predecessors, (4345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 4345 transitions. [2024-11-14 05:21:48,443 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 4345 transitions. Word has length 34 [2024-11-14 05:21:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:21:48,443 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 4345 transitions. [2024-11-14 05:21:48,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:21:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 4345 transitions. [2024-11-14 05:21:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:21:48,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:21:48,445 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:21:48,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2024-11-14 05:21:48,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:48,646 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:21:48,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:21:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1770345577, now seen corresponding path program 23 times [2024-11-14 05:21:48,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:21:48,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476426544] [2024-11-14 05:21:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:48,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:21:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:21:49,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:21:49,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476426544] [2024-11-14 05:21:49,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476426544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:21:49,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437215196] [2024-11-14 05:21:49,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:21:49,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:49,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:21:49,077 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:21:49,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-11-14 05:21:49,267 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 05:21:49,267 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:21:49,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 05:21:49,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:49,511 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 15 treesize of output 1 [2024-11-14 05:21:49,971 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:21:49,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-14 05:21:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:21:49,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:50,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:21:50,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:21:50,557 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:21:50,557 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 48 treesize of output 40 [2024-11-14 05:21:50,658 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:21:50,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 190 [2024-11-14 05:21:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:21:51,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437215196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:51,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [145386501] [2024-11-14 05:21:51,250 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:21:51,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:21:51,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2024-11-14 05:21:51,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895458979] [2024-11-14 05:21:51,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:21:51,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-14 05:21:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:21:51,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-14 05:21:51,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1464, Unknown=0, NotChecked=0, Total=1640 [2024-11-14 05:21:51,251 INFO L87 Difference]: Start difference. First operand 1409 states and 4345 transitions. Second operand has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:00,182 INFO L93 Difference]: Finished difference Result 2964 states and 8555 transitions. [2024-11-14 05:22:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-14 05:22:00,182 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:22:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:00,188 INFO L225 Difference]: With dead ends: 2964 [2024-11-14 05:22:00,188 INFO L226 Difference]: Without dead ends: 2913 [2024-11-14 05:22:00,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2887 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1255, Invalid=9047, Unknown=0, NotChecked=0, Total=10302 [2024-11-14 05:22:00,189 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 583 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:00,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 205 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 05:22:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2024-11-14 05:22:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1601. [2024-11-14 05:22:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 3.05875) internal successors, (4894), 1600 states have internal predecessors, (4894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 4894 transitions. [2024-11-14 05:22:01,388 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 4894 transitions. Word has length 34 [2024-11-14 05:22:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:01,388 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 4894 transitions. [2024-11-14 05:22:01,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 4894 transitions. [2024-11-14 05:22:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:22:01,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:01,390 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:01,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2024-11-14 05:22:01,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:22:01,591 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:22:01,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1766165773, now seen corresponding path program 23 times [2024-11-14 05:22:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:22:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481370651] [2024-11-14 05:22:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:22:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:22:02,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:22:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481370651] [2024-11-14 05:22:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481370651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:22:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527215245] [2024-11-14 05:22:02,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:22:02,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:22:02,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:22:02,036 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:22:02,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-11-14 05:22:02,229 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 05:22:02,229 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:22:02,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 05:22:02,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:02,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:22:02,338 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 15 treesize of output 1 [2024-11-14 05:22:02,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:22:02,376 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 [2024-11-14 05:22:02,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:22:02,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:22:02,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:22:02,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-14 05:22:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:22:02,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:22:03,658 INFO L349 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2024-11-14 05:22:03,658 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2024-11-14 05:22:03,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~i_AB~0 4)) (.cse2 (* c_~i_BA~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse2 8)) (.cse5 (+ c_~A~0.offset 8 .cse4))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (let ((.cse3 (select .cse0 .cse5))) (or (not (= (select .cse0 .cse1) (select v_arrayElimArr_12 (+ .cse2 8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (= .cse3 (select v_arrayElimArr_12 (+ 8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse4))) (= (select v_arrayElimArr_12 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse3))))) (or (= (+ c_~i_AB~0 1) |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (or (not (= (select .cse6 .cse1) (select v_arrayElimArr_12 (+ .cse2 8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (= (select .cse6 .cse5) (select v_arrayElimArr_12 (+ 8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse4)))))))))) is different from false [2024-11-14 05:22:06,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:06,003 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2024-11-14 05:22:06,014 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:22:06,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 79 [2024-11-14 05:22:06,070 INFO L349 Elim1Store]: treesize reduction 16, result has 75.4 percent of original size [2024-11-14 05:22:06,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 82 [2024-11-14 05:22:06,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:06,128 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 77 [2024-11-14 05:22:06,139 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:22:06,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 109 [2024-11-14 05:22:06,238 INFO L349 Elim1Store]: treesize reduction 16, result has 84.8 percent of original size [2024-11-14 05:22:06,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 137 [2024-11-14 05:22:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 15 refuted. 3 times theorem prover too weak. 3 trivial. 3 not checked. [2024-11-14 05:22:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527215245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:22:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1037821764] [2024-11-14 05:22:06,769 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:22:06,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:22:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 42 [2024-11-14 05:22:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936735434] [2024-11-14 05:22:06,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:22:06,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 05:22:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:22:06,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 05:22:06,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1477, Unknown=12, NotChecked=80, Total=1806 [2024-11-14 05:22:06,771 INFO L87 Difference]: Start difference. First operand 1601 states and 4894 transitions. Second operand has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:11,755 INFO L93 Difference]: Finished difference Result 1770 states and 5271 transitions. [2024-11-14 05:22:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-14 05:22:11,756 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:22:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:11,760 INFO L225 Difference]: With dead ends: 1770 [2024-11-14 05:22:11,760 INFO L226 Difference]: Without dead ends: 1727 [2024-11-14 05:22:11,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=490, Invalid=3284, Unknown=12, NotChecked=120, Total=3906 [2024-11-14 05:22:11,761 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 159 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 25 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:11,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 171 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1798 Invalid, 7 Unknown, 156 Unchecked, 1.8s Time] [2024-11-14 05:22:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-11-14 05:22:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1625. [2024-11-14 05:22:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1624 states have (on average 3.061576354679803) internal successors, (4972), 1624 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 4972 transitions. [2024-11-14 05:22:12,958 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 4972 transitions. Word has length 34 [2024-11-14 05:22:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:12,959 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 4972 transitions. [2024-11-14 05:22:12,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 4972 transitions. [2024-11-14 05:22:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:22:12,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:12,961 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:12,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2024-11-14 05:22:13,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:22:13,162 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:22:13,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1372012793, now seen corresponding path program 24 times [2024-11-14 05:22:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:22:13,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889808047] [2024-11-14 05:22:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:22:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:22:13,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:22:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889808047] [2024-11-14 05:22:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889808047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:22:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500845668] [2024-11-14 05:22:13,672 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:22:13,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:22:13,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:22:13,674 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:22:13,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2024-11-14 05:22:13,858 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:22:13,858 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:22:13,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:22:13,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:14,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:14,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:22:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:22:14,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:22:14,397 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:22:14,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:22:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:22:14,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500845668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:22:14,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [66042249] [2024-11-14 05:22:14,514 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:22:14,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:22:14,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 27 [2024-11-14 05:22:14,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500379124] [2024-11-14 05:22:14,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:22:14,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:22:14,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:22:14,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:22:14,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2024-11-14 05:22:14,516 INFO L87 Difference]: Start difference. First operand 1625 states and 4972 transitions. Second operand has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:21,110 INFO L93 Difference]: Finished difference Result 2312 states and 6569 transitions. [2024-11-14 05:22:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-14 05:22:21,110 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:22:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:21,116 INFO L225 Difference]: With dead ends: 2312 [2024-11-14 05:22:21,116 INFO L226 Difference]: Without dead ends: 2271 [2024-11-14 05:22:21,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=483, Invalid=4487, Unknown=0, NotChecked=0, Total=4970 [2024-11-14 05:22:21,117 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 363 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:21,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 149 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 05:22:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2024-11-14 05:22:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 1625. [2024-11-14 05:22:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1624 states have (on average 3.0566502463054186) internal successors, (4964), 1624 states have internal predecessors, (4964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 4964 transitions. [2024-11-14 05:22:22,328 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 4964 transitions. Word has length 34 [2024-11-14 05:22:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:22,328 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 4964 transitions. [2024-11-14 05:22:22,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 4964 transitions. [2024-11-14 05:22:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:22:22,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:22,330 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:22,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2024-11-14 05:22:22,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:22:22,531 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:22:22,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 949369877, now seen corresponding path program 24 times [2024-11-14 05:22:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:22:22,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800287237] [2024-11-14 05:22:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:22:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:22:23,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:22:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800287237] [2024-11-14 05:22:23,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800287237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:22:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258933583] [2024-11-14 05:22:23,027 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:22:23,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:22:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:22:23,030 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:22:23,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2024-11-14 05:22:23,226 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:22:23,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:22:23,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:22:23,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:23,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:23,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:22:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:22:23,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:22:23,806 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:22:23,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:22:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:22:23,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258933583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:22:23,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1967443024] [2024-11-14 05:22:23,918 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:22:23,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:22:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 27 [2024-11-14 05:22:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896958011] [2024-11-14 05:22:23,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:22:23,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:22:23,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:22:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:22:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2024-11-14 05:22:23,919 INFO L87 Difference]: Start difference. First operand 1625 states and 4964 transitions. Second operand has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:28,121 INFO L93 Difference]: Finished difference Result 1962 states and 5689 transitions. [2024-11-14 05:22:28,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 05:22:28,121 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:22:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:28,126 INFO L225 Difference]: With dead ends: 1962 [2024-11-14 05:22:28,126 INFO L226 Difference]: Without dead ends: 1934 [2024-11-14 05:22:28,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=268, Invalid=2282, Unknown=0, NotChecked=0, Total=2550 [2024-11-14 05:22:28,127 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 237 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:28,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 152 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 05:22:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-11-14 05:22:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1627. [2024-11-14 05:22:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1626 states have (on average 3.0559655596555966) internal successors, (4969), 1626 states have internal predecessors, (4969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 4969 transitions. [2024-11-14 05:22:29,328 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 4969 transitions. Word has length 34 [2024-11-14 05:22:29,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:29,328 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 4969 transitions. [2024-11-14 05:22:29,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 4969 transitions. [2024-11-14 05:22:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:22:29,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:29,331 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:29,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2024-11-14 05:22:29,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2024-11-14 05:22:29,531 INFO L396 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:22:29,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash -902017229, now seen corresponding path program 25 times [2024-11-14 05:22:29,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:22:29,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836160763] [2024-11-14 05:22:29,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:29,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:22:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:22:30,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:22:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836160763] [2024-11-14 05:22:30,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836160763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:22:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970498524] [2024-11-14 05:22:30,167 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:22:30,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:22:30,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:22:30,170 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:22:30,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-11-14 05:22:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:30,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:22:30,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:30,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:30,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:22:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:22:30,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:22:31,127 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:22:31,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:22:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:22:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970498524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:22:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1999000055] [2024-11-14 05:22:31,312 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:22:31,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:22:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 26 [2024-11-14 05:22:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318987257] [2024-11-14 05:22:31,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:22:31,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:22:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:22:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:22:31,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:22:31,314 INFO L87 Difference]: Start difference. First operand 1627 states and 4969 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:35,449 INFO L93 Difference]: Finished difference Result 1924 states and 5610 transitions. [2024-11-14 05:22:35,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 05:22:35,449 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:22:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:35,453 INFO L225 Difference]: With dead ends: 1924 [2024-11-14 05:22:35,453 INFO L226 Difference]: Without dead ends: 1896 [2024-11-14 05:22:35,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 05:22:35,454 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 136 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:35,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 178 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-14 05:22:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2024-11-14 05:22:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1623. [2024-11-14 05:22:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1622 states have (on average 3.0524044389642415) internal successors, (4951), 1622 states have internal predecessors, (4951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 4951 transitions. [2024-11-14 05:22:36,631 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 4951 transitions. Word has length 34 [2024-11-14 05:22:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:36,631 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 4951 transitions. [2024-11-14 05:22:36,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 4951 transitions. [2024-11-14 05:22:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:22:36,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:36,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:36,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2024-11-14 05:22:36,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2024-11-14 05:22:36,833 INFO L396 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:22:36,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1407916273, now seen corresponding path program 25 times [2024-11-14 05:22:36,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:22:36,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108850344] [2024-11-14 05:22:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:36,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:22:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:22:37,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:22:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108850344] [2024-11-14 05:22:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108850344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:22:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976648984] [2024-11-14 05:22:37,439 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:22:37,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:22:37,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:22:37,441 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:22:37,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2024-11-14 05:22:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:37,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:22:37,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:37,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:37,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:22:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:22:37,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:22:38,182 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:22:38,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:22:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:22:38,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976648984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:22:38,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1727278399] [2024-11-14 05:22:38,340 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:22:38,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:22:38,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 26 [2024-11-14 05:22:38,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018099148] [2024-11-14 05:22:38,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:22:38,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:22:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:22:38,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:22:38,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:22:38,342 INFO L87 Difference]: Start difference. First operand 1623 states and 4951 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:43,128 INFO L93 Difference]: Finished difference Result 2034 states and 5849 transitions. [2024-11-14 05:22:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 05:22:43,129 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:22:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:43,134 INFO L225 Difference]: With dead ends: 2034 [2024-11-14 05:22:43,134 INFO L226 Difference]: Without dead ends: 2005 [2024-11-14 05:22:43,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=303, Invalid=2453, Unknown=0, NotChecked=0, Total=2756 [2024-11-14 05:22:43,135 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 223 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:43,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 143 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 05:22:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2024-11-14 05:22:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1623. [2024-11-14 05:22:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1622 states have (on average 3.0487053020961774) internal successors, (4945), 1622 states have internal predecessors, (4945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 4945 transitions. [2024-11-14 05:22:44,335 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 4945 transitions. Word has length 34 [2024-11-14 05:22:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:44,335 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 4945 transitions. [2024-11-14 05:22:44,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 4945 transitions. [2024-11-14 05:22:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:22:44,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:44,337 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:22:44,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2024-11-14 05:22:44,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2024-11-14 05:22:44,538 INFO L396 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:22:44,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash -547677441, now seen corresponding path program 26 times [2024-11-14 05:22:44,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:22:44,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486224980] [2024-11-14 05:22:44,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:22:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:22:45,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:22:45,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486224980] [2024-11-14 05:22:45,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486224980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:22:45,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115306636] [2024-11-14 05:22:45,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:22:45,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:22:45,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:22:45,062 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:22:45,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2024-11-14 05:22:45,300 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 05:22:45,300 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:22:45,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 05:22:45,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:45,517 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 15 treesize of output 1 [2024-11-14 05:22:46,181 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2024-11-14 05:22:46,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 47 [2024-11-14 05:22:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:22:46,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:22:47,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:47,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:22:47,512 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:22:47,512 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 48 treesize of output 40 [2024-11-14 05:22:47,643 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:22:47,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 190 [2024-11-14 05:22:48,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:48,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:22:48,063 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:22:48,063 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 48 treesize of output 40 [2024-11-14 05:22:48,191 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:22:48,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 190 [2024-11-14 05:22:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:22:48,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115306636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:22:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1965259614] [2024-11-14 05:22:48,951 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:22:48,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:22:48,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 42 [2024-11-14 05:22:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848707934] [2024-11-14 05:22:48,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:22:48,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 05:22:48,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:22:48,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 05:22:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 05:22:48,953 INFO L87 Difference]: Start difference. First operand 1623 states and 4945 transitions. Second operand has 43 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:00,139 INFO L93 Difference]: Finished difference Result 2528 states and 7302 transitions. [2024-11-14 05:23:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-14 05:23:00,139 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:23:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:00,144 INFO L225 Difference]: With dead ends: 2528 [2024-11-14 05:23:00,144 INFO L226 Difference]: Without dead ends: 2437 [2024-11-14 05:23:00,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1164, Invalid=10178, Unknown=0, NotChecked=0, Total=11342 [2024-11-14 05:23:00,146 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 415 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2793 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:00,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 158 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2793 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-14 05:23:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2024-11-14 05:23:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1715. [2024-11-14 05:23:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 3.0262543757292883) internal successors, (5187), 1714 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 5187 transitions. [2024-11-14 05:23:01,407 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 5187 transitions. Word has length 34 [2024-11-14 05:23:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:01,407 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 5187 transitions. [2024-11-14 05:23:01,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 5187 transitions. [2024-11-14 05:23:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:23:01,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:01,409 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:01,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2024-11-14 05:23:01,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:01,610 INFO L396 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:23:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash -543497637, now seen corresponding path program 26 times [2024-11-14 05:23:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:23:01,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337204879] [2024-11-14 05:23:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:23:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:23:02,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:23:02,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337204879] [2024-11-14 05:23:02,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337204879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:23:02,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691733899] [2024-11-14 05:23:02,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:23:02,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:02,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:23:02,060 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:23:02,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2024-11-14 05:23:02,260 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:23:02,260 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:23:02,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-14 05:23:02,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:02,389 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 15 treesize of output 1 [2024-11-14 05:23:02,747 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:23:02,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:23:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:23:02,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:23:03,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:03,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:23:03,364 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:23:03,364 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 50 treesize of output 39 [2024-11-14 05:23:03,482 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2024-11-14 05:23:03,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 190 [2024-11-14 05:23:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:23:03,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691733899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:23:03,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1867803354] [2024-11-14 05:23:03,916 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:23:03,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:23:03,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 11] total 34 [2024-11-14 05:23:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898800774] [2024-11-14 05:23:03,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:23:03,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 05:23:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:23:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 05:23:03,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 05:23:03,917 INFO L87 Difference]: Start difference. First operand 1715 states and 5187 transitions. Second operand has 35 states, 35 states have (on average 2.257142857142857) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:08,772 INFO L93 Difference]: Finished difference Result 1990 states and 5840 transitions. [2024-11-14 05:23:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 05:23:08,772 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.257142857142857) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:23:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:08,777 INFO L225 Difference]: With dead ends: 1990 [2024-11-14 05:23:08,777 INFO L226 Difference]: Without dead ends: 1927 [2024-11-14 05:23:08,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=347, Invalid=2409, Unknown=0, NotChecked=0, Total=2756 [2024-11-14 05:23:08,778 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 143 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:08,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 188 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:23:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2024-11-14 05:23:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1769. [2024-11-14 05:23:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1768 states have (on average 3.0294117647058822) internal successors, (5356), 1768 states have internal predecessors, (5356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 5356 transitions. [2024-11-14 05:23:10,114 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 5356 transitions. Word has length 34 [2024-11-14 05:23:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:10,115 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 5356 transitions. [2024-11-14 05:23:10,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.257142857142857) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 5356 transitions. [2024-11-14 05:23:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:23:10,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:10,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:10,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2024-11-14 05:23:10,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:10,317 INFO L396 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:23:10,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:10,317 INFO L85 PathProgramCache]: Analyzing trace with hash -905529661, now seen corresponding path program 27 times [2024-11-14 05:23:10,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:23:10,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301863367] [2024-11-14 05:23:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:10,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:23:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:23:10,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:23:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301863367] [2024-11-14 05:23:10,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301863367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:23:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162997626] [2024-11-14 05:23:10,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:23:10,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:10,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:23:10,855 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:23:10,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2024-11-14 05:23:11,056 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:23:11,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:23:11,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:23:11,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:11,365 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:23:11,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2024-11-14 05:23:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:23:11,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:23:11,492 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:23:11,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:23:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:23:11,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162997626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:23:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891951659] [2024-11-14 05:23:11,612 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:23:11,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:23:11,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 7] total 26 [2024-11-14 05:23:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308161155] [2024-11-14 05:23:11,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:23:11,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:23:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:23:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:23:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:23:11,613 INFO L87 Difference]: Start difference. First operand 1769 states and 5356 transitions. Second operand has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:16,976 INFO L93 Difference]: Finished difference Result 2909 states and 8376 transitions. [2024-11-14 05:23:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-14 05:23:16,977 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:23:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:16,982 INFO L225 Difference]: With dead ends: 2909 [2024-11-14 05:23:16,982 INFO L226 Difference]: Without dead ends: 2828 [2024-11-14 05:23:16,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=391, Invalid=2915, Unknown=0, NotChecked=0, Total=3306 [2024-11-14 05:23:16,983 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 373 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:16,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 94 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:23:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2024-11-14 05:23:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 1769. [2024-11-14 05:23:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1768 states have (on average 3.02262443438914) internal successors, (5344), 1768 states have internal predecessors, (5344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 5344 transitions. [2024-11-14 05:23:18,354 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 5344 transitions. Word has length 34 [2024-11-14 05:23:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:18,354 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 5344 transitions. [2024-11-14 05:23:18,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 5344 transitions. [2024-11-14 05:23:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:23:18,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:18,356 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:18,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2024-11-14 05:23:18,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:18,557 INFO L396 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:23:18,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash 908131289, now seen corresponding path program 28 times [2024-11-14 05:23:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:23:18,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305602762] [2024-11-14 05:23:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:18,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:23:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:23:18,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:23:18,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305602762] [2024-11-14 05:23:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305602762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:23:18,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061200734] [2024-11-14 05:23:18,947 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:23:18,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:18,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:23:18,948 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:23:18,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2024-11-14 05:23:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:19,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:23:19,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:19,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:19,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:23:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:23:19,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:23:19,496 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:23:19,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:23:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:23:19,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061200734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:23:19,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1765176505] [2024-11-14 05:23:19,674 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:23:19,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:23:19,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 7] total 24 [2024-11-14 05:23:19,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121737094] [2024-11-14 05:23:19,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:23:19,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:23:19,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:23:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:23:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:23:19,677 INFO L87 Difference]: Start difference. First operand 1769 states and 5344 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:23,587 INFO L93 Difference]: Finished difference Result 2232 states and 6436 transitions. [2024-11-14 05:23:23,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-14 05:23:23,588 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:23:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:23,592 INFO L225 Difference]: With dead ends: 2232 [2024-11-14 05:23:23,592 INFO L226 Difference]: Without dead ends: 2196 [2024-11-14 05:23:23,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=282, Invalid=1880, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 05:23:23,593 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 200 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:23,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 103 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:23:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2024-11-14 05:23:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1763. [2024-11-14 05:23:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1762 states have (on average 3.0175936435868334) internal successors, (5317), 1762 states have internal predecessors, (5317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 5317 transitions. [2024-11-14 05:23:24,821 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 5317 transitions. Word has length 34 [2024-11-14 05:23:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:24,821 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 5317 transitions. [2024-11-14 05:23:24,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 5317 transitions. [2024-11-14 05:23:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:23:24,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:24,823 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:24,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2024-11-14 05:23:25,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable83 [2024-11-14 05:23:25,024 INFO L396 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:23:25,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash 485488373, now seen corresponding path program 27 times [2024-11-14 05:23:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:23:25,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678127799] [2024-11-14 05:23:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:25,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:23:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:23:25,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:23:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678127799] [2024-11-14 05:23:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678127799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:23:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466994757] [2024-11-14 05:23:25,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:23:25,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:25,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:23:25,452 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:23:25,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2024-11-14 05:23:25,655 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:23:25,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:23:25,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:23:25,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:25,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:25,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:23:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:23:25,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:23:26,091 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:23:26,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:23:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:23:26,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466994757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:23:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956408099] [2024-11-14 05:23:26,210 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:23:26,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:23:26,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 7] total 25 [2024-11-14 05:23:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632728978] [2024-11-14 05:23:26,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:23:26,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:23:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:23:26,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:23:26,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:23:26,211 INFO L87 Difference]: Start difference. First operand 1763 states and 5317 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:30,329 INFO L93 Difference]: Finished difference Result 2099 states and 6056 transitions. [2024-11-14 05:23:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-14 05:23:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:23:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:30,334 INFO L225 Difference]: With dead ends: 2099 [2024-11-14 05:23:30,334 INFO L226 Difference]: Without dead ends: 2061 [2024-11-14 05:23:30,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 05:23:30,335 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 179 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:30,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 101 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:23:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2024-11-14 05:23:31,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1763. [2024-11-14 05:23:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1762 states have (on average 3.014188422247446) internal successors, (5311), 1762 states have internal predecessors, (5311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 5311 transitions. [2024-11-14 05:23:31,595 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 5311 transitions. Word has length 34 [2024-11-14 05:23:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:31,596 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 5311 transitions. [2024-11-14 05:23:31,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 5311 transitions. [2024-11-14 05:23:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:23:31,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:31,598 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:31,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2024-11-14 05:23:31,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2024-11-14 05:23:31,799 INFO L396 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:23:31,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1365898733, now seen corresponding path program 28 times [2024-11-14 05:23:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:23:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028962500] [2024-11-14 05:23:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:23:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:23:32,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:23:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028962500] [2024-11-14 05:23:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028962500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:23:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503377731] [2024-11-14 05:23:32,219 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:23:32,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:32,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:23:32,220 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:23:32,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2024-11-14 05:23:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:32,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:23:32,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:32,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:32,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:23:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:23:32,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:23:32,708 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:23:32,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:23:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:23:32,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503377731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:23:32,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1620437702] [2024-11-14 05:23:32,806 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:23:32,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:23:32,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 7] total 24 [2024-11-14 05:23:32,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700841892] [2024-11-14 05:23:32,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:23:32,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:23:32,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:23:32,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:23:32,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:23:32,807 INFO L87 Difference]: Start difference. First operand 1763 states and 5311 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:36,768 INFO L93 Difference]: Finished difference Result 2154 states and 6215 transitions. [2024-11-14 05:23:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 05:23:36,768 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:23:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:36,773 INFO L225 Difference]: With dead ends: 2154 [2024-11-14 05:23:36,773 INFO L226 Difference]: Without dead ends: 2131 [2024-11-14 05:23:36,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=1422, Unknown=0, NotChecked=0, Total=1640 [2024-11-14 05:23:36,774 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 140 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:36,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:23:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2024-11-14 05:23:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1763. [2024-11-14 05:23:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1762 states have (on average 3.014188422247446) internal successors, (5311), 1762 states have internal predecessors, (5311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 5311 transitions. [2024-11-14 05:23:38,062 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 5311 transitions. Word has length 34 [2024-11-14 05:23:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:38,063 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 5311 transitions. [2024-11-14 05:23:38,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 5311 transitions. [2024-11-14 05:23:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:23:38,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:38,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:38,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2024-11-14 05:23:38,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:38,265 INFO L396 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:23:38,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 944034769, now seen corresponding path program 29 times [2024-11-14 05:23:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:23:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730765859] [2024-11-14 05:23:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:23:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:23:38,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:23:38,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730765859] [2024-11-14 05:23:38,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730765859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:23:38,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910899524] [2024-11-14 05:23:38,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:23:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:38,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:23:38,624 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:23:38,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2024-11-14 05:23:38,846 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 05:23:38,846 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:23:38,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-14 05:23:38,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:39,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:39,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-11-14 05:23:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:23:39,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:23:39,344 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:23:39,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:23:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:23:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910899524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:23:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [122286142] [2024-11-14 05:23:39,449 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:23:39,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:23:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 7] total 28 [2024-11-14 05:23:39,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259963815] [2024-11-14 05:23:39,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:23:39,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 05:23:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:23:39,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 05:23:39,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2024-11-14 05:23:39,450 INFO L87 Difference]: Start difference. First operand 1763 states and 5311 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:23:43,637 INFO L93 Difference]: Finished difference Result 2256 states and 6365 transitions. [2024-11-14 05:23:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-14 05:23:43,638 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:23:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:23:43,642 INFO L225 Difference]: With dead ends: 2256 [2024-11-14 05:23:43,642 INFO L226 Difference]: Without dead ends: 2223 [2024-11-14 05:23:43,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=377, Invalid=2703, Unknown=0, NotChecked=0, Total=3080 [2024-11-14 05:23:43,643 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 228 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:23:43,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 91 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:23:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2024-11-14 05:23:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1757. [2024-11-14 05:23:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1756 states have (on average 3.0125284738041) internal successors, (5290), 1756 states have internal predecessors, (5290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 5290 transitions. [2024-11-14 05:23:44,922 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 5290 transitions. Word has length 34 [2024-11-14 05:23:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:23:44,922 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 5290 transitions. [2024-11-14 05:23:44,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:23:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 5290 transitions. [2024-11-14 05:23:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:23:44,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:23:44,924 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:23:44,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2024-11-14 05:23:45,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2024-11-14 05:23:45,125 INFO L396 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:23:45,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:23:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash -34737019, now seen corresponding path program 29 times [2024-11-14 05:23:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:23:45,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063238778] [2024-11-14 05:23:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:23:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:23:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:23:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:23:45,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:23:45,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063238778] [2024-11-14 05:23:45,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063238778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:23:45,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108248471] [2024-11-14 05:23:45,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:23:45,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:23:45,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:23:45,644 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:23:45,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2024-11-14 05:23:45,888 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:23:45,888 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:23:45,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-14 05:23:45,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:23:46,296 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 15 treesize of output 1 [2024-11-14 05:23:46,996 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2024-11-14 05:23:46,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 34 [2024-11-14 05:23:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:23:47,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:23:48,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:48,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:23:48,114 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:23:48,114 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 48 treesize of output 40 [2024-11-14 05:23:48,227 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:23:48,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 182 treesize of output 185 [2024-11-14 05:23:48,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:23:48,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:23:48,481 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:23:48,482 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 50 treesize of output 41 [2024-11-14 05:23:48,598 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:23:48,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 191 [2024-11-14 05:23:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:23:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108248471] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:23:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1333113613] [2024-11-14 05:23:49,597 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:23:49,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:23:49,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2024-11-14 05:23:49,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316802550] [2024-11-14 05:23:49,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:23:49,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 05:23:49,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:23:49,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 05:23:49,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1653, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 05:23:49,598 INFO L87 Difference]: Start difference. First operand 1757 states and 5290 transitions. Second operand has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 42 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:24:02,914 INFO L93 Difference]: Finished difference Result 4499 states and 12656 transitions. [2024-11-14 05:24:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-14 05:24:02,915 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 42 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:24:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:24:02,923 INFO L225 Difference]: With dead ends: 4499 [2024-11-14 05:24:02,923 INFO L226 Difference]: Without dead ends: 4471 [2024-11-14 05:24:02,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1061, Invalid=10069, Unknown=0, NotChecked=0, Total=11130 [2024-11-14 05:24:02,925 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 547 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 3975 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 4066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:24:02,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 297 Invalid, 4066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3975 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-14 05:24:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2024-11-14 05:24:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 2107. [2024-11-14 05:24:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 2106 states have (on average 3.0085470085470085) internal successors, (6336), 2106 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 6336 transitions. [2024-11-14 05:24:04,471 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 6336 transitions. Word has length 34 [2024-11-14 05:24:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:24:04,472 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 6336 transitions. [2024-11-14 05:24:04,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 42 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 6336 transitions. [2024-11-14 05:24:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:24:04,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:24:04,474 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:24:04,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2024-11-14 05:24:04,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2024-11-14 05:24:04,675 INFO L396 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:24:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:24:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash -575004029, now seen corresponding path program 30 times [2024-11-14 05:24:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:24:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730275242] [2024-11-14 05:24:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:24:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:24:05,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:24:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730275242] [2024-11-14 05:24:05,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730275242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511500957] [2024-11-14 05:24:05,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:24:05,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:05,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:24:05,091 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:24:05,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2024-11-14 05:24:05,306 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:24:05,306 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:24:05,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:24:05,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:05,603 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:24:05,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 20 [2024-11-14 05:24:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:24:05,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:24:05,742 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:24:05,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:24:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:24:05,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511500957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:24:05,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1747070457] [2024-11-14 05:24:05,885 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:24:05,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:24:05,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 7] total 26 [2024-11-14 05:24:05,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470445276] [2024-11-14 05:24:05,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:24:05,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:24:05,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:24:05,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:24:05,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:24:05,887 INFO L87 Difference]: Start difference. First operand 2107 states and 6336 transitions. Second operand has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 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) [2024-11-14 05:24:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:24:10,021 INFO L93 Difference]: Finished difference Result 2318 states and 6774 transitions. [2024-11-14 05:24:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 05:24:10,021 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 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 34 [2024-11-14 05:24:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:24:10,026 INFO L225 Difference]: With dead ends: 2318 [2024-11-14 05:24:10,027 INFO L226 Difference]: Without dead ends: 2273 [2024-11-14 05:24:10,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=1653, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 05:24:10,027 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 151 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:24:10,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 135 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:24:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2024-11-14 05:24:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2107. [2024-11-14 05:24:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 2106 states have (on average 3.0047483380816713) internal successors, (6328), 2106 states have internal predecessors, (6328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 6328 transitions. [2024-11-14 05:24:11,584 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 6328 transitions. Word has length 34 [2024-11-14 05:24:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:24:11,584 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 6328 transitions. [2024-11-14 05:24:11,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 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) [2024-11-14 05:24:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 6328 transitions. [2024-11-14 05:24:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:24:11,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:24:11,587 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:24:11,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2024-11-14 05:24:11,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2024-11-14 05:24:11,787 INFO L396 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:24:11,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:24:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1318977589, now seen corresponding path program 31 times [2024-11-14 05:24:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:24:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968904769] [2024-11-14 05:24:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:24:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:24:12,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:24:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968904769] [2024-11-14 05:24:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968904769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657573334] [2024-11-14 05:24:12,145 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:24:12,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:12,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:24:12,147 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:24:12,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2024-11-14 05:24:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:12,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:24:12,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:12,583 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:24:12,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-11-14 05:24:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:24:12,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:24:12,713 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:24:12,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:24:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:24:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657573334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:24:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [412266611] [2024-11-14 05:24:12,814 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:24:12,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:24:12,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 24 [2024-11-14 05:24:12,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893826314] [2024-11-14 05:24:12,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:24:12,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:24:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:24:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:24:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:24:12,815 INFO L87 Difference]: Start difference. First operand 2107 states and 6328 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 24 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) [2024-11-14 05:24:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:24:19,125 INFO L93 Difference]: Finished difference Result 3214 states and 9162 transitions. [2024-11-14 05:24:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 05:24:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 24 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 34 [2024-11-14 05:24:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:24:19,133 INFO L225 Difference]: With dead ends: 3214 [2024-11-14 05:24:19,133 INFO L226 Difference]: Without dead ends: 3163 [2024-11-14 05:24:19,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=2064, Unknown=0, NotChecked=0, Total=2352 [2024-11-14 05:24:19,134 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 268 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:24:19,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 107 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 05:24:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2024-11-14 05:24:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2102. [2024-11-14 05:24:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2102 states, 2101 states have (on average 3.009043312708234) internal successors, (6322), 2101 states have internal predecessors, (6322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 6322 transitions. [2024-11-14 05:24:20,719 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 6322 transitions. Word has length 34 [2024-11-14 05:24:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:24:20,719 INFO L471 AbstractCegarLoop]: Abstraction has 2102 states and 6322 transitions. [2024-11-14 05:24:20,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 24 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) [2024-11-14 05:24:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 6322 transitions. [2024-11-14 05:24:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:24:20,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:24:20,722 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:24:20,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2024-11-14 05:24:20,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,77 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:20,922 INFO L396 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:24:20,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:24:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash 368982199, now seen corresponding path program 30 times [2024-11-14 05:24:20,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:24:20,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647830684] [2024-11-14 05:24:20,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:24:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:24:21,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:24:21,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647830684] [2024-11-14 05:24:21,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647830684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:21,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108604782] [2024-11-14 05:24:21,313 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:24:21,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:24:21,315 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:24:21,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-11-14 05:24:21,543 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:24:21,543 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:24:21,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 05:24:21,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:21,801 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:24:21,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 20 [2024-11-14 05:24:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:24:21,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:24:21,922 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:24:21,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:24:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:24:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108604782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:24:22,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2064144952] [2024-11-14 05:24:22,027 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:24:22,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:24:22,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 7] total 23 [2024-11-14 05:24:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131782970] [2024-11-14 05:24:22,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:24:22,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:24:22,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:24:22,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:24:22,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:24:22,028 INFO L87 Difference]: Start difference. First operand 2102 states and 6322 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:24:26,288 INFO L93 Difference]: Finished difference Result 2460 states and 7103 transitions. [2024-11-14 05:24:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:24:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:24:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:24:26,295 INFO L225 Difference]: With dead ends: 2460 [2024-11-14 05:24:26,295 INFO L226 Difference]: Without dead ends: 2407 [2024-11-14 05:24:26,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2024-11-14 05:24:26,296 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 150 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:24:26,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 71 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:24:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2024-11-14 05:24:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2102. [2024-11-14 05:24:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2102 states, 2101 states have (on average 3.0042836744407424) internal successors, (6312), 2101 states have internal predecessors, (6312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 6312 transitions. [2024-11-14 05:24:28,114 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 6312 transitions. Word has length 34 [2024-11-14 05:24:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:24:28,114 INFO L471 AbstractCegarLoop]: Abstraction has 2102 states and 6312 transitions. [2024-11-14 05:24:28,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 6312 transitions. [2024-11-14 05:24:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:24:28,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:24:28,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:24:28,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2024-11-14 05:24:28,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,78 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:28,317 INFO L396 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:24:28,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:24:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash -787806531, now seen corresponding path program 32 times [2024-11-14 05:24:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:24:28,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711650572] [2024-11-14 05:24:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:28,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:24:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:24:28,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:24:28,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711650572] [2024-11-14 05:24:28,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711650572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:28,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191309778] [2024-11-14 05:24:28,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:24:28,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:28,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:24:28,714 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:24:28,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2024-11-14 05:24:28,971 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-14 05:24:28,971 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:24:28,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-14 05:24:28,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:29,109 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 15 treesize of output 1 [2024-11-14 05:24:29,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:24:29,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-11-14 05:24:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:24:29,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:24:29,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:24:29,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:24:29,979 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:24:29,979 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 50 treesize of output 39 [2024-11-14 05:24:30,091 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2024-11-14 05:24:30,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2024-11-14 05:24:30,524 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:24:30,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191309778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:24:30,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [971416782] [2024-11-14 05:24:30,525 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:24:30,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:24:30,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 32 [2024-11-14 05:24:30,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089444242] [2024-11-14 05:24:30,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:24:30,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:24:30,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:24:30,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:24:30,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 05:24:30,526 INFO L87 Difference]: Start difference. First operand 2102 states and 6312 transitions. Second operand has 33 states, 33 states have (on average 2.303030303030303) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:24:36,427 INFO L93 Difference]: Finished difference Result 2827 states and 8057 transitions. [2024-11-14 05:24:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-14 05:24:36,428 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.303030303030303) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:24:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:24:36,434 INFO L225 Difference]: With dead ends: 2827 [2024-11-14 05:24:36,434 INFO L226 Difference]: Without dead ends: 2796 [2024-11-14 05:24:36,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=501, Invalid=2921, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 05:24:36,434 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 284 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:24:36,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 108 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 05:24:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2024-11-14 05:24:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2152. [2024-11-14 05:24:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2151 states have (on average 3.01673640167364) internal successors, (6489), 2151 states have internal predecessors, (6489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 6489 transitions. [2024-11-14 05:24:38,005 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 6489 transitions. Word has length 34 [2024-11-14 05:24:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:24:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 2152 states and 6489 transitions. [2024-11-14 05:24:38,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.303030303030303) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 6489 transitions. [2024-11-14 05:24:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:24:38,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:24:38,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:24:38,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2024-11-14 05:24:38,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,79 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:38,208 INFO L396 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:24:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:24:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1210449447, now seen corresponding path program 31 times [2024-11-14 05:24:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:24:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847128829] [2024-11-14 05:24:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:24:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:24:38,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:24:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847128829] [2024-11-14 05:24:38,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847128829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:38,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609249148] [2024-11-14 05:24:38,573 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:24:38,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:38,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:24:38,574 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:24:38,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2024-11-14 05:24:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:38,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:24:38,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:38,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:24:38,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:24:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:24:38,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:24:39,093 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:24:39,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:24:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:24:39,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609249148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:24:39,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [407268990] [2024-11-14 05:24:39,191 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:24:39,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:24:39,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 23 [2024-11-14 05:24:39,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119646136] [2024-11-14 05:24:39,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:24:39,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:24:39,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:24:39,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:24:39,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:24:39,193 INFO L87 Difference]: Start difference. First operand 2152 states and 6489 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:24:45,939 INFO L93 Difference]: Finished difference Result 2872 states and 8240 transitions. [2024-11-14 05:24:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-14 05:24:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:24:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:24:45,945 INFO L225 Difference]: With dead ends: 2872 [2024-11-14 05:24:45,945 INFO L226 Difference]: Without dead ends: 2834 [2024-11-14 05:24:45,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=369, Invalid=2601, Unknown=0, NotChecked=0, Total=2970 [2024-11-14 05:24:45,946 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 242 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:24:45,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 110 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-14 05:24:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2024-11-14 05:24:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2196. [2024-11-14 05:24:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 2195 states have (on average 3.041002277904328) internal successors, (6675), 2195 states have internal predecessors, (6675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 6675 transitions. [2024-11-14 05:24:47,470 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 6675 transitions. Word has length 34 [2024-11-14 05:24:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:24:47,470 INFO L471 AbstractCegarLoop]: Abstraction has 2196 states and 6675 transitions. [2024-11-14 05:24:47,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:24:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 6675 transitions. [2024-11-14 05:24:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:24:47,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:24:47,473 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:24:47,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2024-11-14 05:24:47,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,80 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:47,673 INFO L396 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:24:47,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:24:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1233130743, now seen corresponding path program 32 times [2024-11-14 05:24:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:24:47,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121578491] [2024-11-14 05:24:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:24:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:24:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:24:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:24:48,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:24:48,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121578491] [2024-11-14 05:24:48,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121578491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:24:48,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208973111] [2024-11-14 05:24:48,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:24:48,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:24:48,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:24:48,108 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:24:48,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2024-11-14 05:24:48,338 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:24:48,338 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:24:48,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 05:24:48,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:24:48,628 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 15 treesize of output 1 [2024-11-14 05:24:49,003 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-14 05:24:49,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 45 [2024-11-14 05:24:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:24:49,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:24:50,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:24:50,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:24:50,446 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:24:50,446 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 50 treesize of output 41 [2024-11-14 05:24:50,527 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:24:50,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 200 [2024-11-14 05:24:50,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:24:50,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:24:50,885 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:24:50,885 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 48 treesize of output 40 [2024-11-14 05:24:51,019 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:24:51,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 190 [2024-11-14 05:24:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:24:52,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208973111] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:24:52,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [517875712] [2024-11-14 05:24:52,141 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:24:52,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:24:52,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 43 [2024-11-14 05:24:52,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902943818] [2024-11-14 05:24:52,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:24:52,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 05:24:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:24:52,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 05:24:52,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1700, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 05:24:52,142 INFO L87 Difference]: Start difference. First operand 2196 states and 6675 transitions. Second operand has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 43 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:18,496 INFO L93 Difference]: Finished difference Result 6322 states and 18645 transitions. [2024-11-14 05:25:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-14 05:25:18,497 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 43 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:25:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:18,508 INFO L225 Difference]: With dead ends: 6322 [2024-11-14 05:25:18,508 INFO L226 Difference]: Without dead ends: 5708 [2024-11-14 05:25:18,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5637 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=2299, Invalid=18581, Unknown=0, NotChecked=0, Total=20880 [2024-11-14 05:25:18,510 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 951 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 5118 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 5200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 5118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:18,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 487 Invalid, 5200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 5118 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-14 05:25:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2024-11-14 05:25:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 3424. [2024-11-14 05:25:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 3423 states have (on average 3.224948875255624) internal successors, (11039), 3423 states have internal predecessors, (11039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 11039 transitions. [2024-11-14 05:25:21,141 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 11039 transitions. Word has length 34 [2024-11-14 05:25:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:21,141 INFO L471 AbstractCegarLoop]: Abstraction has 3424 states and 11039 transitions. [2024-11-14 05:25:21,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 43 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 11039 transitions. [2024-11-14 05:25:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:25:21,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:21,145 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:21,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2024-11-14 05:25:21,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,81 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:21,346 INFO L396 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:25:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash -751903051, now seen corresponding path program 33 times [2024-11-14 05:25:21,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:21,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187035485] [2024-11-14 05:25:21,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:25:21,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:21,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187035485] [2024-11-14 05:25:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187035485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:21,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954818082] [2024-11-14 05:25:21,696 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:25:21,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:21,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:21,697 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:21,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2024-11-14 05:25:21,943 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:25:21,943 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:25:21,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:25:21,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:22,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:22,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:25:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:25:22,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:22,298 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:25:22,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:25:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:25:22,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954818082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:25:22,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [472812895] [2024-11-14 05:25:22,398 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:25:22,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:25:22,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 24 [2024-11-14 05:25:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704798375] [2024-11-14 05:25:22,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:25:22,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:25:22,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:25:22,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:25:22,399 INFO L87 Difference]: Start difference. First operand 3424 states and 11039 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:28,883 INFO L93 Difference]: Finished difference Result 3921 states and 12161 transitions. [2024-11-14 05:25:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 05:25:28,884 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:25:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:28,893 INFO L225 Difference]: With dead ends: 3921 [2024-11-14 05:25:28,893 INFO L226 Difference]: Without dead ends: 3888 [2024-11-14 05:25:28,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=2323, Unknown=0, NotChecked=0, Total=2652 [2024-11-14 05:25:28,895 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 218 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:28,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 115 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:25:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3888 states. [2024-11-14 05:25:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3888 to 3424. [2024-11-14 05:25:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 3423 states have (on average 3.217353198948291) internal successors, (11013), 3423 states have internal predecessors, (11013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 11013 transitions. [2024-11-14 05:25:31,573 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 11013 transitions. Word has length 34 [2024-11-14 05:25:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:31,573 INFO L471 AbstractCegarLoop]: Abstraction has 3424 states and 11013 transitions. [2024-11-14 05:25:31,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 11013 transitions. [2024-11-14 05:25:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:25:31,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:31,578 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:31,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2024-11-14 05:25:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,82 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:31,778 INFO L396 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:25:31,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2116503951, now seen corresponding path program 34 times [2024-11-14 05:25:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:31,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687774557] [2024-11-14 05:25:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:25:32,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:32,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687774557] [2024-11-14 05:25:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687774557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:32,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168503506] [2024-11-14 05:25:32,148 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:25:32,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:32,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:32,151 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:32,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2024-11-14 05:25:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:32,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:25:32,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:32,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:32,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:25:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:25:32,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:32,690 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:25:32,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:25:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:25:32,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168503506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:25:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [939257527] [2024-11-14 05:25:32,789 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:25:32,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:25:32,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 23 [2024-11-14 05:25:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705920475] [2024-11-14 05:25:32,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:25:32,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:25:32,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:32,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:25:32,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:25:32,791 INFO L87 Difference]: Start difference. First operand 3424 states and 11013 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:39,122 INFO L93 Difference]: Finished difference Result 4194 states and 12971 transitions. [2024-11-14 05:25:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 05:25:39,122 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:25:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:39,130 INFO L225 Difference]: With dead ends: 4194 [2024-11-14 05:25:39,130 INFO L226 Difference]: Without dead ends: 4164 [2024-11-14 05:25:39,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=283, Invalid=1787, Unknown=0, NotChecked=0, Total=2070 [2024-11-14 05:25:39,131 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 208 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:39,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 80 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:25:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4164 states. [2024-11-14 05:25:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4164 to 3438. [2024-11-14 05:25:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3437 states have (on average 3.221414023858016) internal successors, (11072), 3437 states have internal predecessors, (11072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 11072 transitions. [2024-11-14 05:25:41,766 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 11072 transitions. Word has length 34 [2024-11-14 05:25:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 11072 transitions. [2024-11-14 05:25:41,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 11072 transitions. [2024-11-14 05:25:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:25:41,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:41,770 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:41,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2024-11-14 05:25:41,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2024-11-14 05:25:41,971 INFO L396 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:25:41,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1755820429, now seen corresponding path program 33 times [2024-11-14 05:25:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:41,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622793898] [2024-11-14 05:25:41,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:25:42,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622793898] [2024-11-14 05:25:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622793898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963614056] [2024-11-14 05:25:42,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:25:42,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:42,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:42,366 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:42,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2024-11-14 05:25:42,595 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:25:42,595 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:25:42,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:25:42,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:42,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:42,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:25:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:25:42,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:42,985 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:25:42,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:25:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:25:43,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963614056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:25:43,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [383929214] [2024-11-14 05:25:43,106 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:25:43,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:25:43,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 24 [2024-11-14 05:25:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889952545] [2024-11-14 05:25:43,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:25:43,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:25:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:25:43,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:25:43,107 INFO L87 Difference]: Start difference. First operand 3438 states and 11072 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:50,015 INFO L93 Difference]: Finished difference Result 4035 states and 12500 transitions. [2024-11-14 05:25:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 05:25:50,015 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:25:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:50,023 INFO L225 Difference]: With dead ends: 4035 [2024-11-14 05:25:50,023 INFO L226 Difference]: Without dead ends: 3987 [2024-11-14 05:25:50,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=359, Invalid=2611, Unknown=0, NotChecked=0, Total=2970 [2024-11-14 05:25:50,024 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 232 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:50,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 114 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:25:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2024-11-14 05:25:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3446. [2024-11-14 05:25:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 3445 states have (on average 3.2179970972423804) internal successors, (11086), 3445 states have internal predecessors, (11086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 11086 transitions. [2024-11-14 05:25:52,485 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 11086 transitions. Word has length 34 [2024-11-14 05:25:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:52,485 INFO L471 AbstractCegarLoop]: Abstraction has 3446 states and 11086 transitions. [2024-11-14 05:25:52,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 11086 transitions. [2024-11-14 05:25:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:25:52,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:52,490 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:52,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2024-11-14 05:25:52,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,84 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:52,691 INFO L396 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:25:52,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash -95566677, now seen corresponding path program 34 times [2024-11-14 05:25:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:52,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764348501] [2024-11-14 05:25:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:25:53,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764348501] [2024-11-14 05:25:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764348501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378160684] [2024-11-14 05:25:53,046 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:25:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:53,048 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:53,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2024-11-14 05:25:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:53,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:25:53,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:53,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:53,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:25:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:25:53,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:53,555 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:25:53,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:25:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:25:53,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378160684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:25:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446732279] [2024-11-14 05:25:53,654 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:25:53,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:25:53,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 23 [2024-11-14 05:25:53,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227171649] [2024-11-14 05:25:53,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:25:53,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:25:53,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:53,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:25:53,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:25:53,655 INFO L87 Difference]: Start difference. First operand 3446 states and 11086 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:00,533 INFO L93 Difference]: Finished difference Result 4274 states and 13277 transitions. [2024-11-14 05:26:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-14 05:26:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:26:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:00,544 INFO L225 Difference]: With dead ends: 4274 [2024-11-14 05:26:00,544 INFO L226 Difference]: Without dead ends: 4241 [2024-11-14 05:26:00,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=2417, Unknown=0, NotChecked=0, Total=2756 [2024-11-14 05:26:00,545 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 211 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:00,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 116 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:26:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2024-11-14 05:26:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 3476. [2024-11-14 05:26:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 3475 states have (on average 3.2192805755395684) internal successors, (11187), 3475 states have internal predecessors, (11187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 11187 transitions. [2024-11-14 05:26:03,066 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 11187 transitions. Word has length 34 [2024-11-14 05:26:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:03,066 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 11187 transitions. [2024-11-14 05:26:03,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 11187 transitions. [2024-11-14 05:26:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:26:03,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:03,071 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:03,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2024-11-14 05:26:03,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,85 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:03,271 INFO L396 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:26:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2080600471, now seen corresponding path program 35 times [2024-11-14 05:26:03,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:03,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921907393] [2024-11-14 05:26:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:03,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:26:03,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:03,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921907393] [2024-11-14 05:26:03,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921907393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:03,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905282265] [2024-11-14 05:26:03,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:26:03,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:03,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:03,660 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:03,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2024-11-14 05:26:03,974 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 05:26:03,974 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:26:03,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-14 05:26:03,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:04,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:04,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-11-14 05:26:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:26:04,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:04,509 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:26:04,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:26:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:26:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905282265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1027324866] [2024-11-14 05:26:04,620 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:26:04,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:04,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 7] total 27 [2024-11-14 05:26:04,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098661683] [2024-11-14 05:26:04,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:04,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:26:04,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:04,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:26:04,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2024-11-14 05:26:04,621 INFO L87 Difference]: Start difference. First operand 3476 states and 11187 transitions. Second operand has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:11,347 INFO L93 Difference]: Finished difference Result 4191 states and 12859 transitions. [2024-11-14 05:26:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 05:26:11,348 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:26:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:11,357 INFO L225 Difference]: With dead ends: 4191 [2024-11-14 05:26:11,357 INFO L226 Difference]: Without dead ends: 4158 [2024-11-14 05:26:11,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=357, Invalid=2295, Unknown=0, NotChecked=0, Total=2652 [2024-11-14 05:26:11,358 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 168 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:11,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 99 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:26:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2024-11-14 05:26:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 3470. [2024-11-14 05:26:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 3469 states have (on average 3.214182761602767) internal successors, (11150), 3469 states have internal predecessors, (11150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 11150 transitions. [2024-11-14 05:26:13,902 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 11150 transitions. Word has length 34 [2024-11-14 05:26:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:13,903 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 11150 transitions. [2024-11-14 05:26:13,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 11150 transitions. [2024-11-14 05:26:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:26:13,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:13,908 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:13,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2024-11-14 05:26:14,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,86 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:14,108 INFO L396 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:26:14,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash -14167621, now seen corresponding path program 35 times [2024-11-14 05:26:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:14,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591116976] [2024-11-14 05:26:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:26:14,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:14,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591116976] [2024-11-14 05:26:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591116976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740398966] [2024-11-14 05:26:14,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:26:14,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:14,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:14,571 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:14,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2024-11-14 05:26:14,814 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:26:14,814 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:26:14,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 05:26:14,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:15,057 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 15 treesize of output 1 [2024-11-14 05:26:15,465 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2024-11-14 05:26:15,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 34 [2024-11-14 05:26:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:26:15,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:16,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:16,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:26:16,721 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:26:16,721 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 48 treesize of output 40 [2024-11-14 05:26:16,789 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:26:16,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 194 [2024-11-14 05:26:17,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:17,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:26:17,089 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:26:17,089 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 50 treesize of output 41 [2024-11-14 05:26:17,199 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:26:17,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 191 [2024-11-14 05:26:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:26:17,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740398966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:17,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [51478086] [2024-11-14 05:26:17,817 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:26:17,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:17,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 14] total 41 [2024-11-14 05:26:17,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864673063] [2024-11-14 05:26:17,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:17,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 05:26:17,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 05:26:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 05:26:17,818 INFO L87 Difference]: Start difference. First operand 3470 states and 11150 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:33,605 INFO L93 Difference]: Finished difference Result 5661 states and 16779 transitions. [2024-11-14 05:26:33,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-14 05:26:33,606 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:26:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:33,617 INFO L225 Difference]: With dead ends: 5661 [2024-11-14 05:26:33,617 INFO L226 Difference]: Without dead ends: 5617 [2024-11-14 05:26:33,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4200 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1419, Invalid=14583, Unknown=0, NotChecked=0, Total=16002 [2024-11-14 05:26:33,619 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 631 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 4002 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 4097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 4002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:33,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 400 Invalid, 4097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 4002 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-14 05:26:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5617 states. [2024-11-14 05:26:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5617 to 3486. [2024-11-14 05:26:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 3485 states have (on average 3.212051649928264) internal successors, (11194), 3485 states have internal predecessors, (11194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 11194 transitions. [2024-11-14 05:26:36,211 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 11194 transitions. Word has length 34 [2024-11-14 05:26:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:36,211 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 11194 transitions. [2024-11-14 05:26:36,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 11194 transitions. [2024-11-14 05:26:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:26:36,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:36,215 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:36,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2024-11-14 05:26:36,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,87 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:36,416 INFO L396 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:26:36,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash 695328027, now seen corresponding path program 36 times [2024-11-14 05:26:36,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:36,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829744522] [2024-11-14 05:26:36,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:26:36,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829744522] [2024-11-14 05:26:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829744522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481273620] [2024-11-14 05:26:36,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:26:36,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:36,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:36,831 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:36,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2024-11-14 05:26:37,068 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:26:37,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:26:37,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:26:37,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:37,360 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:26:37,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 20 [2024-11-14 05:26:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:26:37,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:37,481 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-11-14 05:26:37,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2024-11-14 05:26:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:26:37,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481273620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:37,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1843730196] [2024-11-14 05:26:37,595 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:26:37,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:37,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 25 [2024-11-14 05:26:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044739478] [2024-11-14 05:26:37,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:37,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:26:37,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:37,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:26:37,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:26:37,596 INFO L87 Difference]: Start difference. First operand 3486 states and 11194 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 25 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) [2024-11-14 05:26:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:43,720 INFO L93 Difference]: Finished difference Result 3853 states and 11992 transitions. [2024-11-14 05:26:43,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:26:43,720 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 25 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 34 [2024-11-14 05:26:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:43,728 INFO L225 Difference]: With dead ends: 3853 [2024-11-14 05:26:43,728 INFO L226 Difference]: Without dead ends: 3808 [2024-11-14 05:26:43,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 05:26:43,730 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 162 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:43,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 77 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:26:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2024-11-14 05:26:46,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3486. [2024-11-14 05:26:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 3485 states have (on average 3.205738880918221) internal successors, (11172), 3485 states have internal predecessors, (11172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 11172 transitions. [2024-11-14 05:26:46,275 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 11172 transitions. Word has length 34 [2024-11-14 05:26:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:46,275 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 11172 transitions. [2024-11-14 05:26:46,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 25 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) [2024-11-14 05:26:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 11172 transitions. [2024-11-14 05:26:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:26:46,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:46,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:46,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2024-11-14 05:26:46,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2024-11-14 05:26:46,483 INFO L396 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:26:46,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:46,483 INFO L85 PathProgramCache]: Analyzing trace with hash 488520441, now seen corresponding path program 37 times [2024-11-14 05:26:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:46,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125446260] [2024-11-14 05:26:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:26:46,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125446260] [2024-11-14 05:26:46,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125446260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127217318] [2024-11-14 05:26:46,940 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:26:46,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:46,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:46,942 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:46,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2024-11-14 05:26:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:47,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:26:47,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:47,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:47,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:26:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:26:47,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:47,532 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:26:47,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:26:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:26:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127217318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [154443177] [2024-11-14 05:26:47,651 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:26:47,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:47,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 25 [2024-11-14 05:26:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106774577] [2024-11-14 05:26:47,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:26:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:47,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:26:47,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:26:47,652 INFO L87 Difference]: Start difference. First operand 3486 states and 11172 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:54,417 INFO L93 Difference]: Finished difference Result 4173 states and 12838 transitions. [2024-11-14 05:26:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 05:26:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:26:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:54,427 INFO L225 Difference]: With dead ends: 4173 [2024-11-14 05:26:54,427 INFO L226 Difference]: Without dead ends: 4135 [2024-11-14 05:26:54,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=2060, Unknown=0, NotChecked=0, Total=2352 [2024-11-14 05:26:54,428 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 205 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:54,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 150 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 05:26:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2024-11-14 05:26:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 3408. [2024-11-14 05:26:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3408 states, 3407 states have (on average 3.193131787496331) internal successors, (10879), 3407 states have internal predecessors, (10879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 10879 transitions. [2024-11-14 05:26:56,981 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 10879 transitions. Word has length 34 [2024-11-14 05:26:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:56,982 INFO L471 AbstractCegarLoop]: Abstraction has 3408 states and 10879 transitions. [2024-11-14 05:26:56,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 10879 transitions. [2024-11-14 05:26:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:26:56,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:56,987 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:57,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2024-11-14 05:26:57,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2024-11-14 05:26:57,188 INFO L396 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:26:57,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash 65877525, now seen corresponding path program 36 times [2024-11-14 05:26:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:57,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126712789] [2024-11-14 05:26:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:57,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:26:57,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:57,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126712789] [2024-11-14 05:26:57,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126712789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:57,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282934373] [2024-11-14 05:26:57,644 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:26:57,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:57,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:57,648 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:57,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2024-11-14 05:26:57,889 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:26:57,889 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:26:57,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:26:57,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:58,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:58,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 05:26:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:26:58,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:58,351 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:26:58,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:26:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:26:58,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282934373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:58,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1769758907] [2024-11-14 05:26:58,466 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:26:58,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:58,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 26 [2024-11-14 05:26:58,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488173211] [2024-11-14 05:26:58,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:58,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:26:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:26:58,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:26:58,467 INFO L87 Difference]: Start difference. First operand 3408 states and 10879 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:05,933 INFO L93 Difference]: Finished difference Result 4061 states and 12496 transitions. [2024-11-14 05:27:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-14 05:27:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:27:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:05,942 INFO L225 Difference]: With dead ends: 4061 [2024-11-14 05:27:05,942 INFO L226 Difference]: Without dead ends: 4013 [2024-11-14 05:27:05,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=410, Invalid=3130, Unknown=0, NotChecked=0, Total=3540 [2024-11-14 05:27:05,943 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 265 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:05,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 123 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:27:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2024-11-14 05:27:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3408. [2024-11-14 05:27:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3408 states, 3407 states have (on average 3.1901966539477544) internal successors, (10869), 3407 states have internal predecessors, (10869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 10869 transitions. [2024-11-14 05:27:08,537 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 10869 transitions. Word has length 34 [2024-11-14 05:27:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:08,538 INFO L471 AbstractCegarLoop]: Abstraction has 3408 states and 10869 transitions. [2024-11-14 05:27:08,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 10869 transitions. [2024-11-14 05:27:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:27:08,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:08,542 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:08,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2024-11-14 05:27:08,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2024-11-14 05:27:08,742 INFO L396 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:27:08,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1785509581, now seen corresponding path program 37 times [2024-11-14 05:27:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779706176] [2024-11-14 05:27:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:08,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:27:09,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779706176] [2024-11-14 05:27:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779706176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731129310] [2024-11-14 05:27:09,154 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:27:09,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:09,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:09,156 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:09,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2024-11-14 05:27:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:09,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:27:09,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:09,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:09,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:27:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:27:09,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:09,814 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:27:09,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:27:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:27:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731129310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:27:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [349641376] [2024-11-14 05:27:09,930 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:27:09,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:27:09,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 25 [2024-11-14 05:27:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600200634] [2024-11-14 05:27:09,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:27:09,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:27:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:09,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:27:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:27:09,931 INFO L87 Difference]: Start difference. First operand 3408 states and 10869 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:17,590 INFO L93 Difference]: Finished difference Result 4322 states and 13326 transitions. [2024-11-14 05:27:17,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-14 05:27:17,590 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:27:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:17,605 INFO L225 Difference]: With dead ends: 4322 [2024-11-14 05:27:17,605 INFO L226 Difference]: Without dead ends: 4289 [2024-11-14 05:27:17,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=446, Invalid=3586, Unknown=0, NotChecked=0, Total=4032 [2024-11-14 05:27:17,606 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 256 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:17,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 100 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:27:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2024-11-14 05:27:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 3408. [2024-11-14 05:27:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3408 states, 3407 states have (on average 3.1901966539477544) internal successors, (10869), 3407 states have internal predecessors, (10869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 10869 transitions. [2024-11-14 05:27:20,332 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 10869 transitions. Word has length 34 [2024-11-14 05:27:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:20,332 INFO L471 AbstractCegarLoop]: Abstraction has 3408 states and 10869 transitions. [2024-11-14 05:27:20,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 10869 transitions. [2024-11-14 05:27:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:27:20,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:20,336 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:20,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2024-11-14 05:27:20,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2024-11-14 05:27:20,537 INFO L396 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:27:20,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash 524423921, now seen corresponding path program 38 times [2024-11-14 05:27:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619457874] [2024-11-14 05:27:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:27:20,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:20,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619457874] [2024-11-14 05:27:20,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619457874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:20,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841786900] [2024-11-14 05:27:20,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:27:20,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:20,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:20,948 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:20,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2024-11-14 05:27:21,211 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 05:27:21,211 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:27:21,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 05:27:21,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:21,307 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 19 treesize of output 1 [2024-11-14 05:27:21,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:21,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:27:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:27:21,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:21,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:21,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2024-11-14 05:27:21,952 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:27:21,952 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 50 treesize of output 39 [2024-11-14 05:27:22,019 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2024-11-14 05:27:22,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2024-11-14 05:27:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:27:22,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841786900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:27:22,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1961742681] [2024-11-14 05:27:22,331 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:27:22,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:27:22,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 31 [2024-11-14 05:27:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714421770] [2024-11-14 05:27:22,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:27:22,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 05:27:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:22,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 05:27:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2024-11-14 05:27:22,332 INFO L87 Difference]: Start difference. First operand 3408 states and 10869 transitions. Second operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:29,817 INFO L93 Difference]: Finished difference Result 4027 states and 12343 transitions. [2024-11-14 05:27:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-14 05:27:29,817 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:27:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:29,829 INFO L225 Difference]: With dead ends: 4027 [2024-11-14 05:27:29,829 INFO L226 Difference]: Without dead ends: 3998 [2024-11-14 05:27:29,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=422, Invalid=3000, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 05:27:29,830 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 228 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:29,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 165 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-14 05:27:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2024-11-14 05:27:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3424. [2024-11-14 05:27:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 3423 states have (on average 3.19690330119778) internal successors, (10943), 3423 states have internal predecessors, (10943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 10943 transitions. [2024-11-14 05:27:32,427 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 10943 transitions. Word has length 34 [2024-11-14 05:27:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:32,427 INFO L471 AbstractCegarLoop]: Abstraction has 3424 states and 10943 transitions. [2024-11-14 05:27:32,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 10943 transitions. [2024-11-14 05:27:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:27:32,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:32,431 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:32,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2024-11-14 05:27:32,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,92 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:32,631 INFO L396 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:27:32,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1704110525, now seen corresponding path program 38 times [2024-11-14 05:27:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:32,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181462434] [2024-11-14 05:27:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:27:33,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:33,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181462434] [2024-11-14 05:27:33,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181462434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:33,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577971327] [2024-11-14 05:27:33,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:27:33,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:33,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:33,038 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:33,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2024-11-14 05:27:33,286 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:27:33,286 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:27:33,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 05:27:33,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:33,545 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 15 treesize of output 1 [2024-11-14 05:27:33,989 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2024-11-14 05:27:33,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 34 [2024-11-14 05:27:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:27:34,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:34,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:34,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-14 05:27:34,945 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:27:34,945 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 48 treesize of output 40 [2024-11-14 05:27:35,017 INFO L349 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2024-11-14 05:27:35,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 194 [2024-11-14 05:27:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:27:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577971327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:27:35,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [188560261] [2024-11-14 05:27:35,765 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:27:35,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:27:35,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 42 [2024-11-14 05:27:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111416043] [2024-11-14 05:27:35,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:27:35,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 05:27:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:35,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 05:27:35,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1581, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 05:27:35,767 INFO L87 Difference]: Start difference. First operand 3424 states and 10943 transitions. Second operand has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:28:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:28:05,091 INFO L93 Difference]: Finished difference Result 8321 states and 23939 transitions. [2024-11-14 05:28:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2024-11-14 05:28:05,091 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:28:05,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:28:05,107 INFO L225 Difference]: With dead ends: 8321 [2024-11-14 05:28:05,107 INFO L226 Difference]: Without dead ends: 8272 [2024-11-14 05:28:05,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10106 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=4003, Invalid=27149, Unknown=0, NotChecked=0, Total=31152 [2024-11-14 05:28:05,110 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1043 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 4706 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 4841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 4706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:28:05,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 292 Invalid, 4841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 4706 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-14 05:28:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8272 states. [2024-11-14 05:28:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8272 to 3956. [2024-11-14 05:28:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3955 states have (on average 3.2169405815423513) internal successors, (12723), 3955 states have internal predecessors, (12723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:28:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 12723 transitions. [2024-11-14 05:28:08,560 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 12723 transitions. Word has length 34 [2024-11-14 05:28:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:28:08,561 INFO L471 AbstractCegarLoop]: Abstraction has 3956 states and 12723 transitions. [2024-11-14 05:28:08,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:28:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 12723 transitions. [2024-11-14 05:28:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:28:08,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:28:08,568 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:28:08,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2024-11-14 05:28:08,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,93 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:08,768 INFO L396 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:28:08,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:28:08,769 INFO L85 PathProgramCache]: Analyzing trace with hash -994614877, now seen corresponding path program 39 times [2024-11-14 05:28:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:28:08,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625604145] [2024-11-14 05:28:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:28:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:28:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:28:09,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:28:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625604145] [2024-11-14 05:28:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625604145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:28:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515053054] [2024-11-14 05:28:09,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:28:09,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:09,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:28:09,206 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:28:09,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2024-11-14 05:28:09,466 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:28:09,466 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:28:09,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:28:09,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:28:09,884 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:28:09,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 20 [2024-11-14 05:28:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:28:09,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:28:10,055 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:28:10,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:28:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:28:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515053054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:28:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [950032689] [2024-11-14 05:28:10,170 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:28:10,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:28:10,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 27 [2024-11-14 05:28:10,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961284243] [2024-11-14 05:28:10,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:28:10,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:28:10,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:28:10,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:28:10,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2024-11-14 05:28:10,171 INFO L87 Difference]: Start difference. First operand 3956 states and 12723 transitions. Second operand has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 27 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) [2024-11-14 05:28:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:28:17,536 INFO L93 Difference]: Finished difference Result 4237 states and 13316 transitions. [2024-11-14 05:28:17,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 05:28:17,537 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 27 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 34 [2024-11-14 05:28:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:28:17,551 INFO L225 Difference]: With dead ends: 4237 [2024-11-14 05:28:17,552 INFO L226 Difference]: Without dead ends: 4192 [2024-11-14 05:28:17,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=286, Invalid=2164, Unknown=0, NotChecked=0, Total=2450 [2024-11-14 05:28:17,553 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 155 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:28:17,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 138 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:28:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2024-11-14 05:28:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 3946. [2024-11-14 05:28:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 3945 states have (on average 3.2136882129277566) internal successors, (12678), 3945 states have internal predecessors, (12678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:28:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 12678 transitions. [2024-11-14 05:28:21,255 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 12678 transitions. Word has length 34 [2024-11-14 05:28:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:28:21,255 INFO L471 AbstractCegarLoop]: Abstraction has 3946 states and 12678 transitions. [2024-11-14 05:28:21,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 27 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) [2024-11-14 05:28:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 12678 transitions. [2024-11-14 05:28:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:28:21,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:28:21,260 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:28:21,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2024-11-14 05:28:21,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,94 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:21,460 INFO L396 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:28:21,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:28:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1262159351, now seen corresponding path program 39 times [2024-11-14 05:28:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:28:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572714134] [2024-11-14 05:28:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:28:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:28:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:28:21,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:28:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572714134] [2024-11-14 05:28:21,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572714134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:28:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40075633] [2024-11-14 05:28:21,868 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:28:21,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:21,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:28:21,870 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:28:21,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2024-11-14 05:28:22,136 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:28:22,136 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:28:22,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:28:22,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:28:22,518 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:28:22,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-14 05:28:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:28:22,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:28:22,726 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:28:22,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:28:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:28:22,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40075633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:28:22,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2015305835] [2024-11-14 05:28:22,839 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:28:22,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:28:22,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 28 [2024-11-14 05:28:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920411804] [2024-11-14 05:28:22,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:28:22,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 05:28:22,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:28:22,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 05:28:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2024-11-14 05:28:22,841 INFO L87 Difference]: Start difference. First operand 3946 states and 12678 transitions. Second operand has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 28 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) [2024-11-14 05:28:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:28:32,446 INFO L93 Difference]: Finished difference Result 4732 states and 14891 transitions. [2024-11-14 05:28:32,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 05:28:32,447 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 28 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 34 [2024-11-14 05:28:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:28:32,457 INFO L225 Difference]: With dead ends: 4732 [2024-11-14 05:28:32,457 INFO L226 Difference]: Without dead ends: 4704 [2024-11-14 05:28:32,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2024-11-14 05:28:32,459 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 184 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:28:32,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 141 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 05:28:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2024-11-14 05:28:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 4018. [2024-11-14 05:28:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4018 states, 4017 states have (on average 3.222305202887727) internal successors, (12944), 4017 states have internal predecessors, (12944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:28:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4018 states to 4018 states and 12944 transitions. [2024-11-14 05:28:36,115 INFO L78 Accepts]: Start accepts. Automaton has 4018 states and 12944 transitions. Word has length 34 [2024-11-14 05:28:36,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:28:36,115 INFO L471 AbstractCegarLoop]: Abstraction has 4018 states and 12944 transitions. [2024-11-14 05:28:36,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 28 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) [2024-11-14 05:28:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4018 states and 12944 transitions. [2024-11-14 05:28:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:28:36,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:28:36,120 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:28:36,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2024-11-14 05:28:36,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2024-11-14 05:28:36,320 INFO L396 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:28:36,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:28:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash -397278219, now seen corresponding path program 40 times [2024-11-14 05:28:36,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:28:36,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829216303] [2024-11-14 05:28:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:28:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:28:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:28:36,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:28:36,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829216303] [2024-11-14 05:28:36,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829216303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:28:36,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975849821] [2024-11-14 05:28:36,813 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:28:36,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:36,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:28:36,815 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:28:36,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2024-11-14 05:28:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:37,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:28:37,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:28:37,287 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:28:37,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-14 05:28:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:28:37,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:28:37,442 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:28:37,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:28:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:28:37,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975849821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:28:37,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882280772] [2024-11-14 05:28:37,556 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:28:37,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:28:37,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 26 [2024-11-14 05:28:37,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514023439] [2024-11-14 05:28:37,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:28:37,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:28:37,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:28:37,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:28:37,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:28:37,557 INFO L87 Difference]: Start difference. First operand 4018 states and 12944 transitions. Second operand has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 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) [2024-11-14 05:28:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:28:44,959 INFO L93 Difference]: Finished difference Result 4277 states and 13488 transitions. [2024-11-14 05:28:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:28:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 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 34 [2024-11-14 05:28:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:28:44,969 INFO L225 Difference]: With dead ends: 4277 [2024-11-14 05:28:44,970 INFO L226 Difference]: Without dead ends: 4208 [2024-11-14 05:28:44,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 05:28:44,971 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 133 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:28:44,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 119 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:28:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2024-11-14 05:28:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 4030. [2024-11-14 05:28:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 4029 states have (on average 3.207247455944403) internal successors, (12922), 4029 states have internal predecessors, (12922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:28:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 12922 transitions. [2024-11-14 05:28:48,542 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 12922 transitions. Word has length 34 [2024-11-14 05:28:48,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:28:48,542 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 12922 transitions. [2024-11-14 05:28:48,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 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) [2024-11-14 05:28:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 12922 transitions. [2024-11-14 05:28:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:28:48,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:28:48,547 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:28:48,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2024-11-14 05:28:48,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,96 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:48,747 INFO L396 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:28:48,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:28:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash -873632861, now seen corresponding path program 41 times [2024-11-14 05:28:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:28:48,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388430514] [2024-11-14 05:28:48,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:28:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:28:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:28:49,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:28:49,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388430514] [2024-11-14 05:28:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388430514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:28:49,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35787606] [2024-11-14 05:28:49,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:28:49,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:49,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:28:49,183 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:28:49,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2024-11-14 05:28:49,450 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:28:49,450 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:28:49,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-14 05:28:49,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:28:49,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:28:49,656 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 15 treesize of output 1 [2024-11-14 05:28:49,713 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:28:49,713 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 [2024-11-14 05:28:49,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:28:49,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:28:49,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:28:50,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:50,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 39 [2024-11-14 05:28:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:28:50,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:28:51,460 INFO L349 Elim1Store]: treesize reduction 43, result has 52.2 percent of original size [2024-11-14 05:28:51,460 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 134 [2024-11-14 05:28:52,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:52,658 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2024-11-14 05:28:52,669 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:28:52,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 90 [2024-11-14 05:28:52,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:28:52,718 INFO L349 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2024-11-14 05:28:52,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 87 [2024-11-14 05:28:52,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:52,808 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 70 [2024-11-14 05:28:52,826 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:28:52,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 98 [2024-11-14 05:28:52,834 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:28:52,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:28:52,932 INFO L349 Elim1Store]: treesize reduction 10, result has 88.9 percent of original size [2024-11-14 05:28:52,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 93 treesize of output 128 [2024-11-14 05:28:53,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:53,371 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2024-11-14 05:28:53,379 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:28:53,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 61 [2024-11-14 05:28:53,384 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:28:53,432 INFO L349 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2024-11-14 05:28:53,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 72 [2024-11-14 05:28:53,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:53,514 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2024-11-14 05:28:53,527 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 05:28:53,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2024-11-14 05:28:53,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:28:53,587 INFO L349 Elim1Store]: treesize reduction 10, result has 82.8 percent of original size [2024-11-14 05:28:53,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 81 [2024-11-14 05:28:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:28:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35787606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:28:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [598132069] [2024-11-14 05:28:54,981 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:28:54,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:28:54,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2024-11-14 05:28:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19628390] [2024-11-14 05:28:54,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:28:54,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 05:28:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:28:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 05:28:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1542, Unknown=13, NotChecked=0, Total=1806 [2024-11-14 05:28:54,983 INFO L87 Difference]: Start difference. First operand 4030 states and 12922 transitions. Second operand has 43 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:29:04,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:29:06,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:29:15,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:29:25,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:29:27,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:29:32,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:29:52,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:30:11,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 [1] [2024-11-14 05:30:15,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:30:20,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:30:25,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:30:27,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:30:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:28,853 INFO L93 Difference]: Finished difference Result 10609 states and 30741 transitions. [2024-11-14 05:30:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2024-11-14 05:30:28,853 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:30:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:28,874 INFO L225 Difference]: With dead ends: 10609 [2024-11-14 05:30:28,875 INFO L226 Difference]: Without dead ends: 10316 [2024-11-14 05:30:28,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13171 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=4559, Invalid=33642, Unknown=19, NotChecked=0, Total=38220 [2024-11-14 05:30:28,878 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 861 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 6890 mSolverCounterSat, 89 mSolverCounterUnsat, 70 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 7049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 6890 IncrementalHoareTripleChecker+Invalid, 70 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:28,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 456 Invalid, 7049 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [89 Valid, 6890 Invalid, 70 Unknown, 0 Unchecked, 37.5s Time] [2024-11-14 05:30:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10316 states. [2024-11-14 05:30:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10316 to 4757. [2024-11-14 05:30:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4757 states, 4756 states have (on average 3.2241379310344827) internal successors, (15334), 4756 states have internal predecessors, (15334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 15334 transitions. [2024-11-14 05:30:34,962 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 15334 transitions. Word has length 34 [2024-11-14 05:30:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:34,962 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 15334 transitions. [2024-11-14 05:30:34,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 15334 transitions. [2024-11-14 05:30:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:30:34,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:34,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:34,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2024-11-14 05:30:35,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,97 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:30:35,168 INFO L396 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:30:35,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash 558804795, now seen corresponding path program 40 times [2024-11-14 05:30:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:35,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080133258] [2024-11-14 05:30:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:30:35,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:35,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080133258] [2024-11-14 05:30:35,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080133258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:30:35,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899363898] [2024-11-14 05:30:35,675 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:30:35,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:30:35,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:30:35,677 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:30:35,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2024-11-14 05:30:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:35,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:30:35,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:36,249 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:30:36,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-14 05:30:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:30:36,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:30:36,450 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:30:36,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:30:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:30:36,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899363898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:30:36,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1906641457] [2024-11-14 05:30:36,593 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:30:36,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:30:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 26 [2024-11-14 05:30:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469006175] [2024-11-14 05:30:36,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:30:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:30:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:30:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:30:36,595 INFO L87 Difference]: Start difference. First operand 4757 states and 15334 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:47,603 INFO L93 Difference]: Finished difference Result 5158 states and 16175 transitions. [2024-11-14 05:30:47,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:30:47,603 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:30:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:47,615 INFO L225 Difference]: With dead ends: 5158 [2024-11-14 05:30:47,615 INFO L226 Difference]: Without dead ends: 5045 [2024-11-14 05:30:47,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 05:30:47,617 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 193 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:47,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 83 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:30:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2024-11-14 05:30:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4747. [2024-11-14 05:30:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4747 states, 4746 states have (on average 3.2119679730299198) internal successors, (15244), 4746 states have internal predecessors, (15244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 15244 transitions. [2024-11-14 05:30:53,395 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 15244 transitions. Word has length 34 [2024-11-14 05:30:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:53,395 INFO L471 AbstractCegarLoop]: Abstraction has 4747 states and 15244 transitions. [2024-11-14 05:30:53,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 15244 transitions. [2024-11-14 05:30:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:30:53,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:53,403 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:53,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2024-11-14 05:30:53,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,98 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:30:53,608 INFO L396 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:30:53,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2072687647, now seen corresponding path program 42 times [2024-11-14 05:30:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151800952] [2024-11-14 05:30:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:30:54,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:54,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151800952] [2024-11-14 05:30:54,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151800952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:30:54,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332671878] [2024-11-14 05:30:54,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:30:54,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:30:54,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:30:54,098 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:30:54,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2024-11-14 05:30:54,359 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:30:54,359 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:30:54,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:30:54,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:54,767 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:30:54,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2024-11-14 05:30:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:30:54,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:30:54,995 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:30:54,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:30:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:30:55,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332671878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:30:55,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1979806786] [2024-11-14 05:30:55,148 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:30:55,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:30:55,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 27 [2024-11-14 05:30:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132729713] [2024-11-14 05:30:55,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:30:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:30:55,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:30:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2024-11-14 05:30:55,149 INFO L87 Difference]: Start difference. First operand 4747 states and 15244 transitions. Second operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:11,153 INFO L93 Difference]: Finished difference Result 6457 states and 20028 transitions. [2024-11-14 05:31:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-14 05:31:11,154 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.75) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:31:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:11,168 INFO L225 Difference]: With dead ends: 6457 [2024-11-14 05:31:11,168 INFO L226 Difference]: Without dead ends: 6378 [2024-11-14 05:31:11,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=545, Invalid=3877, Unknown=0, NotChecked=0, Total=4422 [2024-11-14 05:31:11,170 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 373 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:11,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 134 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:31:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6378 states. [2024-11-14 05:31:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6378 to 4681. [2024-11-14 05:31:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4681 states, 4680 states have (on average 3.201923076923077) internal successors, (14985), 4680 states have internal predecessors, (14985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 14985 transitions. [2024-11-14 05:31:16,587 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 14985 transitions. Word has length 34 [2024-11-14 05:31:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:16,587 INFO L471 AbstractCegarLoop]: Abstraction has 4681 states and 14985 transitions. [2024-11-14 05:31:16,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.75) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 14985 transitions. [2024-11-14 05:31:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:31:16,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:16,592 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:16,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2024-11-14 05:31:16,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2024-11-14 05:31:16,792 INFO L396 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:31:16,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2076867451, now seen corresponding path program 41 times [2024-11-14 05:31:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:16,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707910857] [2024-11-14 05:31:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:31:17,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707910857] [2024-11-14 05:31:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707910857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956678133] [2024-11-14 05:31:17,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:31:17,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:17,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:17,287 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:17,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2024-11-14 05:31:17,553 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:31:17,553 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:31:17,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 05:31:17,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:18,515 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:31:18,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:31:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:18,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:18,747 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:31:18,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:31:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:19,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956678133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:31:19,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2031738924] [2024-11-14 05:31:19,506 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:31:19,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:31:19,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 44 [2024-11-14 05:31:19,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543424922] [2024-11-14 05:31:19,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:19,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-14 05:31:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:19,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-14 05:31:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2024-11-14 05:31:19,508 INFO L87 Difference]: Start difference. First operand 4681 states and 14985 transitions. Second operand has 45 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:43,292 INFO L93 Difference]: Finished difference Result 8823 states and 27310 transitions. [2024-11-14 05:31:43,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-14 05:31:43,292 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:31:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:43,311 INFO L225 Difference]: With dead ends: 8823 [2024-11-14 05:31:43,311 INFO L226 Difference]: Without dead ends: 8661 [2024-11-14 05:31:43,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2737 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1364, Invalid=7756, Unknown=0, NotChecked=0, Total=9120 [2024-11-14 05:31:43,313 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 557 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 3390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:43,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 280 Invalid, 3390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-14 05:31:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8661 states. [2024-11-14 05:31:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8661 to 7251. [2024-11-14 05:31:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7251 states, 7250 states have (on average 3.2602758620689656) internal successors, (23637), 7250 states have internal predecessors, (23637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7251 states to 7251 states and 23637 transitions. [2024-11-14 05:31:51,567 INFO L78 Accepts]: Start accepts. Automaton has 7251 states and 23637 transitions. Word has length 34 [2024-11-14 05:31:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:51,567 INFO L471 AbstractCegarLoop]: Abstraction has 7251 states and 23637 transitions. [2024-11-14 05:31:51,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:31:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 7251 states and 23637 transitions. [2024-11-14 05:31:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:31:51,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:51,575 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:51,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2024-11-14 05:31:51,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2024-11-14 05:31:51,776 INFO L396 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:31:51,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 920078721, now seen corresponding path program 43 times [2024-11-14 05:31:51,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814701534] [2024-11-14 05:31:51,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:51,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:31:52,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814701534] [2024-11-14 05:31:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814701534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236681047] [2024-11-14 05:31:52,236 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:31:52,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:52,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:52,237 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:52,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2024-11-14 05:31:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:52,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:31:52,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:52,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:52,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:31:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:31:52,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:53,060 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:31:53,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:31:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:31:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236681047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:31:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [994223203] [2024-11-14 05:31:53,201 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:31:53,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:31:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 25 [2024-11-14 05:31:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66306043] [2024-11-14 05:31:53,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:31:53,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:53,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:31:53,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:31:53,202 INFO L87 Difference]: Start difference. First operand 7251 states and 23637 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:11,536 INFO L93 Difference]: Finished difference Result 8772 states and 27686 transitions. [2024-11-14 05:32:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-14 05:32:11,537 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-14 05:32:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:11,562 INFO L225 Difference]: With dead ends: 8772 [2024-11-14 05:32:11,562 INFO L226 Difference]: Without dead ends: 8723 [2024-11-14 05:32:11,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=475, Invalid=3685, Unknown=0, NotChecked=0, Total=4160 [2024-11-14 05:32:11,565 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 259 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:11,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 101 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 05:32:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2024-11-14 05:32:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 7133. [2024-11-14 05:32:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7133 states, 7132 states have (on average 3.2515423443634326) internal successors, (23190), 7132 states have internal predecessors, (23190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 23190 transitions. [2024-11-14 05:32:19,851 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 23190 transitions. Word has length 34 [2024-11-14 05:32:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:19,851 INFO L471 AbstractCegarLoop]: Abstraction has 7133 states and 23190 transitions. [2024-11-14 05:32:19,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 23190 transitions. [2024-11-14 05:32:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:32:19,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:19,860 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:19,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2024-11-14 05:32:20,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2024-11-14 05:32:20,061 INFO L396 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 05:32:20,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash 497435805, now seen corresponding path program 42 times [2024-11-14 05:32:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:20,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882347080] [2024-11-14 05:32:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:32:20,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882347080] [2024-11-14 05:32:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882347080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:32:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441483155] [2024-11-14 05:32:20,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:32:20,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:32:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:32:20,594 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:32:20,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6058d56f-4a6d-4d8e-8bb7-656427d3a3e4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2024-11-14 05:32:20,877 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:32:20,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:32:20,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:32:20,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:21,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:32:21,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2024-11-14 05:32:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:32:21,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:32:21,356 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-14 05:32:21,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2024-11-14 05:32:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:32:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441483155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:32:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [59254237] [2024-11-14 05:32:21,501 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:32:21,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:32:21,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 25 [2024-11-14 05:32:21,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394444140] [2024-11-14 05:32:21,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:32:21,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:32:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:32:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:32:21,502 INFO L87 Difference]: Start difference. First operand 7133 states and 23190 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)