./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --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 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:43:42,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:43:42,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:43:42,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:43:42,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:43:42,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:43:42,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:43:42,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:43:42,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:43:42,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:43:42,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:43:42,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:43:42,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:43:42,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:43:42,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:43:42,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:43:42,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:43:42,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:43:42,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:43:42,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:43:42,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:43:42,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:43:42,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:43:42,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:43:42,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:43:42,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:43:42,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:43:42,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:43:42,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:43:42,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:43:42,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:43:42,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:43:42,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:43:42,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:43:42,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:43:42,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:43:42,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:43:42,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:43:42,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:43:42,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:43:42,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:43:42,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:43:42,328 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:43:42,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:43:42,329 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:43:42,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:43:42,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:43:42,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:43:42,330 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:43:42,330 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:43:42,331 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:43:42,331 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:43:42,331 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:43:42,331 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:43:42,331 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:43:42,331 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:43:42,332 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:43:42,332 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:43:42,332 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:43:42,332 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:43:42,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:43:42,333 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:43:42,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:43:42,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:43:42,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:43:42,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:43:42,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:43:42,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:43:42,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:43:42,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:43:42,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:43:42,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:43:42,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:43:42,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:43:42,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:43:42,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:43:42,348 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:43:42,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:43:42,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:43:42,349 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:43:42,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:43:42,349 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:43:42,349 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:43:42,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 [2022-11-03 03:43:42,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:43:42,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:43:42,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:43:42,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:43:42,660 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:43:42,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2022-11-03 03:43:42,745 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/data/87c8af147/81134471b5c146488b9c81b9b5cfe709/FLAGc5badb32b [2022-11-03 03:43:43,293 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:43:43,293 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2022-11-03 03:43:43,302 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/data/87c8af147/81134471b5c146488b9c81b9b5cfe709/FLAGc5badb32b [2022-11-03 03:43:43,643 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/data/87c8af147/81134471b5c146488b9c81b9b5cfe709 [2022-11-03 03:43:43,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:43:43,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:43:43,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:43:43,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:43:43,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:43:43,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:43:43" (1/1) ... [2022-11-03 03:43:43,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15bd2cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:43, skipping insertion in model container [2022-11-03 03:43:43,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:43:43" (1/1) ... [2022-11-03 03:43:43,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:43:43,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:43:43,996 WARN L230 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_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-11-03 03:43:44,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:43:44,017 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:43:44,062 WARN L230 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_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-11-03 03:43:44,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:43:44,084 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:43:44,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44 WrapperNode [2022-11-03 03:43:44,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:43:44,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:43:44,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:43:44,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:43:44,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,165 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 460 [2022-11-03 03:43:44,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:43:44,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:43:44,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:43:44,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:43:44,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,222 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:43:44,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:43:44,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:43:44,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:43:44,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (1/1) ... [2022-11-03 03:43:44,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:43:44,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:44,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:43:44,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:43:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:43:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:43:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:43:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:43:44,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 03:43:44,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 03:43:44,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 03:43:44,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 03:43:44,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 03:43:44,410 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 03:43:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-03 03:43:44,410 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-03 03:43:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:43:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:43:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:43:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:43:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:43:44,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:43:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:43:44,414 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:43:44,601 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:43:44,603 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:43:45,468 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:43:45,911 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:43:45,911 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-03 03:43:45,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:43:45 BoogieIcfgContainer [2022-11-03 03:43:45,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:43:45,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:43:45,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:43:45,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:43:45,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:43:43" (1/3) ... [2022-11-03 03:43:45,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb1efd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:43:45, skipping insertion in model container [2022-11-03 03:43:45,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:44" (2/3) ... [2022-11-03 03:43:45,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb1efd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:43:45, skipping insertion in model container [2022-11-03 03:43:45,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:43:45" (3/3) ... [2022-11-03 03:43:45,931 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2022-11-03 03:43:45,944 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:43:45,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:43:45,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:43:45,957 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:43:46,104 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-03 03:43:46,175 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:43:46,193 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 332 places, 356 transitions, 744 flow [2022-11-03 03:43:46,199 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 332 places, 356 transitions, 744 flow [2022-11-03 03:43:46,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 356 transitions, 744 flow [2022-11-03 03:43:46,405 INFO L130 PetriNetUnfolder]: 37/352 cut-off events. [2022-11-03 03:43:46,406 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-03 03:43:46,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 352 events. 37/352 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 308. Up to 8 conditions per place. [2022-11-03 03:43:46,421 INFO L118 LiptonReduction]: Number of co-enabled transitions 5184 [2022-11-03 03:44:06,075 INFO L133 LiptonReduction]: Checked pairs total: 5200 [2022-11-03 03:44:06,076 INFO L135 LiptonReduction]: Total number of compositions: 386 [2022-11-03 03:44:06,086 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 38 transitions, 108 flow [2022-11-03 03:44:06,117 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 96 states, 95 states have (on average 3.663157894736842) internal successors, (348), 95 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) [2022-11-03 03:44:06,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:44:06,147 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2423e036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:44:06,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-03 03:44:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 95 states have (on average 3.663157894736842) internal successors, (348), 95 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) [2022-11-03 03:44:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:44:06,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:06,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:06,162 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:44:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1623473605, now seen corresponding path program 1 times [2022-11-03 03:44:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:06,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291423468] [2022-11-03 03:44:06,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:06,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:06,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:06,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291423468] [2022-11-03 03:44:06,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291423468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:44:06,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:44:06,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:44:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618641109] [2022-11-03 03:44:06,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:44:06,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:44:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:06,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:44:06,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:44:06,995 INFO L87 Difference]: Start difference. First operand has 96 states, 95 states have (on average 3.663157894736842) internal successors, (348), 95 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) Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:07,176 INFO L93 Difference]: Finished difference Result 185 states and 685 transitions. [2022-11-03 03:44:07,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:44:07,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 03:44:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:07,200 INFO L225 Difference]: With dead ends: 185 [2022-11-03 03:44:07,200 INFO L226 Difference]: Without dead ends: 176 [2022-11-03 03:44:07,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:44:07,206 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:07,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:44:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-03 03:44:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-11-03 03:44:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 3.7542857142857144) internal successors, (657), 175 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 657 transitions. [2022-11-03 03:44:07,295 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 657 transitions. Word has length 25 [2022-11-03 03:44:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:07,296 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 657 transitions. [2022-11-03 03:44:07,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 657 transitions. [2022-11-03 03:44:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:44:07,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:07,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:07,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:44:07,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:44:07,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1575999644, now seen corresponding path program 1 times [2022-11-03 03:44:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:07,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748690363] [2022-11-03 03:44:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:08,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:08,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748690363] [2022-11-03 03:44:08,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748690363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:44:08,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:44:08,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:44:08,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178058140] [2022-11-03 03:44:08,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:44:08,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:44:08,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:08,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:44:08,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:44:08,021 INFO L87 Difference]: Start difference. First operand 176 states and 657 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:08,139 INFO L93 Difference]: Finished difference Result 172 states and 619 transitions. [2022-11-03 03:44:08,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:44:08,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 03:44:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:08,142 INFO L225 Difference]: With dead ends: 172 [2022-11-03 03:44:08,142 INFO L226 Difference]: Without dead ends: 170 [2022-11-03 03:44:08,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:44:08,144 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:08,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:44:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-03 03:44:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-11-03 03:44:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.621301775147929) internal successors, (612), 169 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 612 transitions. [2022-11-03 03:44:08,160 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 612 transitions. Word has length 26 [2022-11-03 03:44:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:08,160 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 612 transitions. [2022-11-03 03:44:08,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 612 transitions. [2022-11-03 03:44:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:44:08,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:08,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:08,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:44:08,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:44:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:08,164 INFO L85 PathProgramCache]: Analyzing trace with hash 295726212, now seen corresponding path program 1 times [2022-11-03 03:44:08,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:08,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665676438] [2022-11-03 03:44:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:08,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665676438] [2022-11-03 03:44:08,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665676438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:44:08,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:44:08,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:44:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936237867] [2022-11-03 03:44:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:44:08,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:44:08,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:44:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:44:08,476 INFO L87 Difference]: Start difference. First operand 170 states and 612 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:08,634 INFO L93 Difference]: Finished difference Result 339 states and 1163 transitions. [2022-11-03 03:44:08,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:44:08,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 03:44:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:08,638 INFO L225 Difference]: With dead ends: 339 [2022-11-03 03:44:08,638 INFO L226 Difference]: Without dead ends: 325 [2022-11-03 03:44:08,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:44:08,640 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:08,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:44:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-03 03:44:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 273. [2022-11-03 03:44:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 3.5845588235294117) internal successors, (975), 272 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 975 transitions. [2022-11-03 03:44:08,658 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 975 transitions. Word has length 26 [2022-11-03 03:44:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:08,658 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 975 transitions. [2022-11-03 03:44:08,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 975 transitions. [2022-11-03 03:44:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:44:08,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:08,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:08,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:44:08,662 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:44:08,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash 149566685, now seen corresponding path program 1 times [2022-11-03 03:44:08,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:08,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025234596] [2022-11-03 03:44:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:08,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:08,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:08,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025234596] [2022-11-03 03:44:08,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025234596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:44:08,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:44:08,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:44:08,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181996310] [2022-11-03 03:44:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:44:08,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:44:08,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:08,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:44:08,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:44:08,987 INFO L87 Difference]: Start difference. First operand 273 states and 975 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:09,122 INFO L93 Difference]: Finished difference Result 505 states and 1795 transitions. [2022-11-03 03:44:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:44:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 03:44:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:09,126 INFO L225 Difference]: With dead ends: 505 [2022-11-03 03:44:09,126 INFO L226 Difference]: Without dead ends: 489 [2022-11-03 03:44:09,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:44:09,128 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:09,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:44:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-11-03 03:44:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 293. [2022-11-03 03:44:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 3.565068493150685) internal successors, (1041), 292 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 1041 transitions. [2022-11-03 03:44:09,146 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 1041 transitions. Word has length 26 [2022-11-03 03:44:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:09,146 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 1041 transitions. [2022-11-03 03:44:09,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 1041 transitions. [2022-11-03 03:44:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:44:09,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:09,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:09,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:44:09,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:44:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1107126800, now seen corresponding path program 1 times [2022-11-03 03:44:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:09,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327233082] [2022-11-03 03:44:09,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:09,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:09,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:09,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327233082] [2022-11-03 03:44:09,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327233082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:44:09,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:44:09,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:44:09,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108363619] [2022-11-03 03:44:09,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:44:09,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:44:09,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:09,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:44:09,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:44:09,545 INFO L87 Difference]: Start difference. First operand 293 states and 1041 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:09,688 INFO L93 Difference]: Finished difference Result 303 states and 947 transitions. [2022-11-03 03:44:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:44:09,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 03:44:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:09,691 INFO L225 Difference]: With dead ends: 303 [2022-11-03 03:44:09,691 INFO L226 Difference]: Without dead ends: 251 [2022-11-03 03:44:09,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:44:09,693 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:09,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:44:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-03 03:44:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 167. [2022-11-03 03:44:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 3.283132530120482) internal successors, (545), 166 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 545 transitions. [2022-11-03 03:44:09,708 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 545 transitions. Word has length 26 [2022-11-03 03:44:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:09,709 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 545 transitions. [2022-11-03 03:44:09,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 545 transitions. [2022-11-03 03:44:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:44:09,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:09,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:09,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:44:09,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:44:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash -125952793, now seen corresponding path program 1 times [2022-11-03 03:44:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:09,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615008472] [2022-11-03 03:44:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:09,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:44:10,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:10,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615008472] [2022-11-03 03:44:10,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615008472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:10,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744329477] [2022-11-03 03:44:10,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:10,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:10,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:10,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:10,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:44:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:10,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:44:10,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:44:10,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:44:10,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744329477] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:11,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [841973805] [2022-11-03 03:44:11,010 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:44:11,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:44:11,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-11-03 03:44:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831370704] [2022-11-03 03:44:11,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:44:11,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:44:11,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:11,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:44:11,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:44:11,027 INFO L87 Difference]: Start difference. First operand 167 states and 545 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 5 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) [2022-11-03 03:44:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:11,177 INFO L93 Difference]: Finished difference Result 228 states and 734 transitions. [2022-11-03 03:44:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:44:11,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 5 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 [2022-11-03 03:44:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:11,180 INFO L225 Difference]: With dead ends: 228 [2022-11-03 03:44:11,180 INFO L226 Difference]: Without dead ends: 205 [2022-11-03 03:44:11,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:44:11,181 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:11,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:44:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-03 03:44:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-11-03 03:44:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 3.269607843137255) internal successors, (667), 204 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 667 transitions. [2022-11-03 03:44:11,193 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 667 transitions. Word has length 27 [2022-11-03 03:44:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:11,193 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 667 transitions. [2022-11-03 03:44:11,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 5 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) [2022-11-03 03:44:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 667 transitions. [2022-11-03 03:44:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:44:11,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:11,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:11,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:44:11,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 03:44:11,415 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:44:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:11,415 INFO L85 PathProgramCache]: Analyzing trace with hash 623955282, now seen corresponding path program 1 times [2022-11-03 03:44:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:11,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965127685] [2022-11-03 03:44:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:13,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:13,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965127685] [2022-11-03 03:44:13,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965127685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:13,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772548990] [2022-11-03 03:44:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:13,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:13,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:13,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:13,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:44:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:13,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 03:44:13,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:13,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:44:13,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 03:44:13,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 03:44:13,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 03:44:14,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 03:44:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:14,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:20,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (<= c_~manager_back~0 c_~manager_front~0)) (.cse6 (= c_~client_state~0 0))) (let ((.cse9 (not .cse6)) (.cse10 (= 3 c_~manager_state~0)) (.cse7 (not (< c_~manager_back~0 c_~manager_size~0))) (.cse8 (<= (+ c_~manager_back~0 1) c_~manager_front~0)) (.cse12 (or .cse3 .cse6)) (.cse0 (= c_~manager_state~0 0)) (.cse4 (< c_~manager_front~0 0)) (.cse5 (<= c_~manager_size~0 c_~manager_front~0))) (and (or .cse0 (let ((.cse1 (= 5 c_~manager_state~0))) (and (or (let ((.cse2 (= c_~manager_state~0 4))) (and (or (and (or .cse1 .cse2) (or .cse3 .cse4 .cse5 (not .cse2))) .cse6) (or .cse7 (and .cse2 (or .cse8 .cse4)) .cse9 (not (<= 0 c_~manager_back~0))))) .cse10) (or (and (forall ((v_ArrVal_320 (Array Int Int)) (~client_back~0 Int)) (or (forall ((~client~0.base Int) (~client~0.offset Int) (v_~client_front~0_80 Int)) (or (<= (+ ~client_back~0 1) v_~client_front~0_80) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_320) ~client~0.base))) (= (select .cse11 (+ (- 4) (* v_~client_front~0_80 4) ~client~0.offset)) (select .cse11 (+ (* ~client_back~0 4) ~client~0.offset)))) (< v_~client_front~0_80 1))) (not (<= 0 ~client_back~0)))) (= c_~client_state~0 1)) (not .cse1) .cse6)))) (or (and .cse12 (or .cse7 .cse8 .cse9)) (not .cse10) .cse4 .cse5) (or (and (or .cse7 .cse8 (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_320) c_~manager~0.base))) (= (select .cse13 (+ c_~manager~0.offset (* c_~manager_back~0 4))) (select .cse13 (+ (* 4 c_~manager_front~0) c_~manager~0.offset)))))) .cse12) (not .cse0) .cse4 .cse5)))) is different from false [2022-11-03 03:44:22,327 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (<= c_~manager_back~0 c_~manager_front~0)) (.cse6 (= c_~client_state~0 0))) (let ((.cse9 (not .cse6)) (.cse10 (= 3 c_~manager_state~0)) (.cse0 (= c_~manager_state~0 0)) (.cse12 (or .cse3 .cse6)) (.cse7 (not (< c_~manager_back~0 c_~manager_size~0))) (.cse8 (<= (+ c_~manager_back~0 1) c_~manager_front~0)) (.cse4 (< c_~manager_front~0 0)) (.cse5 (<= c_~manager_size~0 c_~manager_front~0))) (and (or .cse0 (let ((.cse1 (= 5 c_~manager_state~0))) (and (or (let ((.cse2 (= c_~manager_state~0 4))) (and (or (and (or .cse1 .cse2) (or .cse3 .cse4 .cse5 (not .cse2))) .cse6) (or .cse7 (and .cse2 (or .cse8 .cse4)) .cse9 (not (<= 0 c_~manager_back~0))))) .cse10) (or (not .cse1) .cse6 (and (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~client_back~0 Int)) (or (forall ((~client~0.base Int) (~client~0.offset Int) (v_~client_front~0_80 Int)) (or (<= (+ ~client_back~0 1) v_~client_front~0_80) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_320) ~client~0.base))) (= (select .cse11 (+ (- 4) (* v_~client_front~0_80 4) ~client~0.offset)) (select .cse11 (+ (* ~client_back~0 4) ~client~0.offset)))) (< v_~client_front~0_80 1))) (not (<= 0 ~client_back~0)))) (= c_~client_state~0 1)))))) (or (and .cse12 (or .cse7 .cse8 .cse9)) (not .cse10) .cse4 .cse5) (or (not .cse0) (and .cse12 (or .cse7 .cse8 (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_320) c_~manager~0.base))) (= (select .cse13 (+ c_~manager~0.offset (* c_~manager_back~0 4))) (select .cse13 (+ (* 4 c_~manager_front~0) c_~manager~0.offset))))))) .cse4 .cse5)))) is different from false [2022-11-03 03:44:22,807 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~manager_back~0 c_~manager_front~0)) (.cse2 (= c_~client_state~0 0))) (let ((.cse0 (= c_~manager_state~0 0)) (.cse12 (or .cse5 .cse2)) (.cse8 (not (< c_~manager_back~0 c_~manager_size~0))) (.cse9 (<= (+ c_~manager_back~0 1) c_~manager_front~0)) (.cse10 (not .cse2)) (.cse11 (= 3 c_~manager_state~0)) (.cse6 (< c_~manager_front~0 0)) (.cse7 (<= c_~manager_size~0 c_~manager_front~0))) (and (or .cse0 (let ((.cse1 (= 5 c_~manager_state~0))) (and (or (not .cse1) .cse2 (and (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~client_back~0 Int)) (or (forall ((~client~0.base Int) (~client~0.offset Int) (v_~client_front~0_80 Int)) (or (let ((.cse3 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_320) ~client~0.base))) (= (select .cse3 (+ (- 4) (* v_~client_front~0_80 4) ~client~0.offset)) (select .cse3 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_80) (< v_~client_front~0_80 1))) (not (<= 0 ~client_back~0)))) (= c_~client_state~0 1))) (or (let ((.cse4 (= c_~manager_state~0 4))) (and (or (and (or .cse1 .cse4) (or .cse5 .cse6 .cse7 (not .cse4))) .cse2) (or .cse8 (and .cse4 (or .cse9 .cse6)) .cse10 (not (<= 0 c_~manager_back~0))))) .cse11)))) (or (not .cse0) .cse6 .cse7 (and .cse12 (or .cse8 (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (let ((.cse13 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_320) c_~manager~0.base))) (= (select .cse13 (+ (* 4 c_~manager_front~0) c_~manager~0.offset)) (select .cse13 (+ c_~manager~0.offset (* c_~manager_back~0 4)))))) .cse9))) (or (and .cse12 (or .cse8 .cse9 .cse10)) (not .cse11) .cse6 .cse7)))) is different from false [2022-11-03 03:44:24,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:44:24,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 56 [2022-11-03 03:44:24,189 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-03 03:44:24,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3222 treesize of output 3101 [2022-11-03 03:44:24,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:44:24,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1547 treesize of output 1355 [2022-11-03 03:44:24,281 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:44:24,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2902 treesize of output 2518 [2022-11-03 03:44:24,322 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:44:24,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2518 treesize of output 1750 [2022-11-03 03:44:24,361 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:44:24,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1750 treesize of output 1654 [2022-11-03 03:44:49,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:44:49,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 [2022-11-03 03:44:49,488 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 03:44:49,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 830 treesize of output 796 [2022-11-03 03:44:49,508 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 03:44:49,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 796 treesize of output 588 [2022-11-03 03:44:49,527 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 03:44:49,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 588 treesize of output 484 [2022-11-03 03:44:49,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:44:49,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 242 treesize of output 216 [2022-11-03 03:44:49,564 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 03:44:49,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 458 treesize of output 406 [2022-11-03 03:44:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:50,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772548990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:50,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1678017366] [2022-11-03 03:44:50,433 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:44:50,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:44:50,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 25 [2022-11-03 03:44:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650312220] [2022-11-03 03:44:50,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:44:50,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:44:50,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:50,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:44:50,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=430, Unknown=8, NotChecked=138, Total=702 [2022-11-03 03:44:50,435 INFO L87 Difference]: Start difference. First operand 205 states and 667 transitions. Second operand has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 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) [2022-11-03 03:44:51,054 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~client_state~0 0))) (let ((.cse9 (= 3 c_~manager_state~0)) (.cse11 (not (< c_~manager_back~0 c_~manager_size~0))) (.cse4 (= c_~manager_state~0 4)) (.cse15 (<= (+ c_~manager_back~0 1) c_~manager_front~0)) (.cse6 (< c_~manager_front~0 0)) (.cse16 (not .cse2)) (.cse5 (<= c_~manager_back~0 c_~manager_front~0))) (let ((.cse13 (* 4 c_~manager_front~0)) (.cse14 (* c_~manager_back~0 4)) (.cse10 (or .cse5 .cse2)) (.cse7 (<= c_~manager_size~0 c_~manager_front~0)) (.cse8 (or .cse11 (and .cse4 (or .cse15 .cse6)) .cse16 (not (<= 0 c_~manager_back~0)))) (.cse0 (= c_~manager_state~0 0)) (.cse17 (not .cse9))) (and (or .cse0 (let ((.cse1 (= 5 c_~manager_state~0))) (and (or (not .cse1) .cse2 (and (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~client_back~0 Int)) (or (forall ((~client~0.base Int) (~client~0.offset Int) (v_~client_front~0_80 Int)) (or (let ((.cse3 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_320) ~client~0.base))) (= (select .cse3 (+ (- 4) (* v_~client_front~0_80 4) ~client~0.offset)) (select .cse3 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_80) (< v_~client_front~0_80 1))) (not (<= 0 ~client_back~0)))) (= c_~client_state~0 1))) (or (and (or (and (or .cse1 .cse4) (or .cse5 .cse6 .cse7 (not .cse4))) .cse2) .cse8) .cse9)))) (or (not .cse0) .cse6 .cse7 (and .cse10 (or .cse11 (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (let ((.cse12 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_320) c_~manager~0.base))) (= (select .cse12 (+ .cse13 c_~manager~0.offset)) (select .cse12 (+ c_~manager~0.offset .cse14))))) .cse15))) (= c_~safe~0 1) (or (and .cse10 (or .cse11 .cse15 .cse16)) .cse17 .cse6 .cse7) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (and (or .cse11 .cse15 (= .cse13 .cse14)) .cse10) .cse6 .cse7) (or (and (or .cse2 .cse4) .cse8) .cse0 .cse9) (or .cse11 .cse15 .cse17 .cse16 .cse6))))))) is different from false [2022-11-03 03:44:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:51,542 INFO L93 Difference]: Finished difference Result 509 states and 1602 transitions. [2022-11-03 03:44:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 03:44:51,543 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 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 28 [2022-11-03 03:44:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:51,546 INFO L225 Difference]: With dead ends: 509 [2022-11-03 03:44:51,546 INFO L226 Difference]: Without dead ends: 492 [2022-11-03 03:44:51,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=203, Invalid=674, Unknown=9, NotChecked=236, Total=1122 [2022-11-03 03:44:51,548 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 667 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:51,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 287 Invalid, 0 Unknown, 667 Unchecked, 0.4s Time] [2022-11-03 03:44:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-03 03:44:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 315. [2022-11-03 03:44:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 3.3980891719745223) internal successors, (1067), 314 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1067 transitions. [2022-11-03 03:44:51,562 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1067 transitions. Word has length 28 [2022-11-03 03:44:51,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:51,563 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 1067 transitions. [2022-11-03 03:44:51,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 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) [2022-11-03 03:44:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1067 transitions. [2022-11-03 03:44:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:44:51,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:51,565 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:51,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:44:51,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:51,779 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:44:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1749967070, now seen corresponding path program 2 times [2022-11-03 03:44:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:51,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337646883] [2022-11-03 03:44:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:52,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337646883] [2022-11-03 03:44:52,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337646883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027216534] [2022-11-03 03:44:52,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:44:52,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:52,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:52,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:52,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:44:52,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:44:52,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:44:52,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 03:44:52,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:44:53,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:53,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:44:53,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 284 [2022-11-03 03:44:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:44:54,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027216534] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:54,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [748118715] [2022-11-03 03:44:54,143 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:44:54,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:44:54,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-03 03:44:54,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611058703] [2022-11-03 03:44:54,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:44:54,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:44:54,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:54,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:44:54,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:44:54,148 INFO L87 Difference]: Start difference. First operand 315 states and 1067 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:54,984 INFO L93 Difference]: Finished difference Result 996 states and 3016 transitions. [2022-11-03 03:44:54,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 03:44:54,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 03:44:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:54,991 INFO L225 Difference]: With dead ends: 996 [2022-11-03 03:44:54,991 INFO L226 Difference]: Without dead ends: 692 [2022-11-03 03:44:54,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:44:54,993 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 419 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:54,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 0 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:44:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-03 03:44:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 434. [2022-11-03 03:44:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.4526558891454964) internal successors, (1495), 433 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1495 transitions. [2022-11-03 03:44:55,014 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1495 transitions. Word has length 28 [2022-11-03 03:44:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:55,014 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 1495 transitions. [2022-11-03 03:44:55,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:44:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1495 transitions. [2022-11-03 03:44:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:44:55,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:55,017 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:55,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:44:55,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:55,223 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:44:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:55,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1883863495, now seen corresponding path program 2 times [2022-11-03 03:44:55,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:55,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056231414] [2022-11-03 03:44:55,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:55,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:44:57,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056231414] [2022-11-03 03:44:57,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056231414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052283470] [2022-11-03 03:44:57,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:44:57,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:57,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:57,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:57,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:44:57,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:44:57,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:44:57,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 03:44:57,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:44:58,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:59,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:44:59,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 422 treesize of output 613 [2022-11-03 03:45:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:45:10,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052283470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:45:10,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1444718372] [2022-11-03 03:45:10,534 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:45:10,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:45:10,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 13 [2022-11-03 03:45:10,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551219282] [2022-11-03 03:45:10,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:45:10,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 03:45:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:45:10,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 03:45:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-11-03 03:45:10,538 INFO L87 Difference]: Start difference. First operand 434 states and 1495 transitions. Second operand has 15 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 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) [2022-11-03 03:45:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:45:10,893 INFO L93 Difference]: Finished difference Result 638 states and 2111 transitions. [2022-11-03 03:45:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:45:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 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 29 [2022-11-03 03:45:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:45:10,899 INFO L225 Difference]: With dead ends: 638 [2022-11-03 03:45:10,899 INFO L226 Difference]: Without dead ends: 621 [2022-11-03 03:45:10,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:45:10,900 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:45:10,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 201 Invalid, 0 Unknown, 28 Unchecked, 0.3s Time] [2022-11-03 03:45:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-11-03 03:45:10,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 366. [2022-11-03 03:45:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.7315068493150685) internal successors, (1362), 365 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1362 transitions. [2022-11-03 03:45:10,920 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1362 transitions. Word has length 29 [2022-11-03 03:45:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:45:10,921 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 1362 transitions. [2022-11-03 03:45:10,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 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) [2022-11-03 03:45:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1362 transitions. [2022-11-03 03:45:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:45:10,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:45:10,924 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:45:10,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:45:11,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-03 03:45:11,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:45:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:45:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1898698169, now seen corresponding path program 3 times [2022-11-03 03:45:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:45:11,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184420319] [2022-11-03 03:45:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:45:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:45:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:45:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:45:12,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:45:12,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184420319] [2022-11-03 03:45:12,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184420319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:45:12,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919611520] [2022-11-03 03:45:12,209 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:45:12,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:45:12,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:45:12,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:45:12,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:45:12,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:45:12,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:45:12,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:45:12,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:45:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:45:12,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:45:14,508 INFO L356 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-11-03 03:45:14,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 859 treesize of output 1003 [2022-11-03 03:45:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:45:42,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919611520] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:45:42,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1397281656] [2022-11-03 03:45:42,441 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:45:42,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:45:42,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-11-03 03:45:42,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13148063] [2022-11-03 03:45:42,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:45:42,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:45:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:45:42,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:45:42,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:45:42,446 INFO L87 Difference]: Start difference. First operand 366 states and 1362 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:45:43,467 INFO L93 Difference]: Finished difference Result 1595 states and 6011 transitions. [2022-11-03 03:45:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 03:45:43,468 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 [2022-11-03 03:45:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:45:43,481 INFO L225 Difference]: With dead ends: 1595 [2022-11-03 03:45:43,482 INFO L226 Difference]: Without dead ends: 1571 [2022-11-03 03:45:43,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2022-11-03 03:45:43,483 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 275 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:45:43,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 0 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:45:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2022-11-03 03:45:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 729. [2022-11-03 03:45:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 3.7074175824175826) internal successors, (2699), 728 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2699 transitions. [2022-11-03 03:45:43,534 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 2699 transitions. Word has length 29 [2022-11-03 03:45:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:45:43,535 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 2699 transitions. [2022-11-03 03:45:43,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 2699 transitions. [2022-11-03 03:45:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:45:43,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:45:43,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:45:43,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-03 03:45:43,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:45:43,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:45:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:45:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash -212924262, now seen corresponding path program 1 times [2022-11-03 03:45:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:45:43,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092383976] [2022-11-03 03:45:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:45:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:45:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:45:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:45:44,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:45:44,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092383976] [2022-11-03 03:45:44,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092383976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:45:44,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:45:44,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:45:44,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418475163] [2022-11-03 03:45:44,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:45:44,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:45:44,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:45:44,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:45:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:45:44,384 INFO L87 Difference]: Start difference. First operand 729 states and 2699 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:45:44,733 INFO L93 Difference]: Finished difference Result 1209 states and 4245 transitions. [2022-11-03 03:45:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:45:44,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 [2022-11-03 03:45:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:45:44,743 INFO L225 Difference]: With dead ends: 1209 [2022-11-03 03:45:44,743 INFO L226 Difference]: Without dead ends: 1145 [2022-11-03 03:45:44,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:45:44,744 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:45:44,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:45:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-11-03 03:45:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 729. [2022-11-03 03:45:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 3.5604395604395602) internal successors, (2592), 728 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2592 transitions. [2022-11-03 03:45:44,786 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 2592 transitions. Word has length 29 [2022-11-03 03:45:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:45:44,787 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 2592 transitions. [2022-11-03 03:45:44,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 2592 transitions. [2022-11-03 03:45:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:45:44,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:45:44,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:45:44,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:45:44,791 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:45:44,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:45:44,792 INFO L85 PathProgramCache]: Analyzing trace with hash 956023217, now seen corresponding path program 1 times [2022-11-03 03:45:44,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:45:44,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541970164] [2022-11-03 03:45:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:45:44,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:45:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:45:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:45:45,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:45:45,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541970164] [2022-11-03 03:45:45,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541970164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:45:45,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:45:45,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:45:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193885079] [2022-11-03 03:45:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:45:45,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:45:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:45:45,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:45:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:45:45,469 INFO L87 Difference]: Start difference. First operand 729 states and 2592 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:45:45,586 INFO L93 Difference]: Finished difference Result 845 states and 2840 transitions. [2022-11-03 03:45:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:45:45,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 [2022-11-03 03:45:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:45:45,593 INFO L225 Difference]: With dead ends: 845 [2022-11-03 03:45:45,593 INFO L226 Difference]: Without dead ends: 703 [2022-11-03 03:45:45,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:45:45,594 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:45:45,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:45:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-11-03 03:45:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 595. [2022-11-03 03:45:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 3.6363636363636362) internal successors, (2160), 594 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 2160 transitions. [2022-11-03 03:45:45,623 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 2160 transitions. Word has length 29 [2022-11-03 03:45:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:45:45,624 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 2160 transitions. [2022-11-03 03:45:45,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:45:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 2160 transitions. [2022-11-03 03:45:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:45:45,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:45:45,627 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:45:45,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:45:45,628 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:45:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:45:45,628 INFO L85 PathProgramCache]: Analyzing trace with hash 628381520, now seen corresponding path program 1 times [2022-11-03 03:45:45,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:45:45,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096405432] [2022-11-03 03:45:45,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:45:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:45:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:45:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:45:47,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:45:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096405432] [2022-11-03 03:45:47,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096405432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:45:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212058379] [2022-11-03 03:45:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:45:47,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:45:47,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:45:47,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:45:47,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:45:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:45:47,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 03:45:47,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:45:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:45:47,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:45:52,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:45:52,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 487 treesize of output 881 [2022-11-03 03:46:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:46:05,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212058379] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:46:05,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [308311241] [2022-11-03 03:46:05,895 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:46:05,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:46:05,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-03 03:46:05,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644355389] [2022-11-03 03:46:05,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:46:05,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 03:46:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:05,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 03:46:05,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-11-03 03:46:05,899 INFO L87 Difference]: Start difference. First operand 595 states and 2160 transitions. Second operand has 19 states, 18 states have (on average 4.5) internal successors, (81), 18 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) [2022-11-03 03:46:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:07,364 INFO L93 Difference]: Finished difference Result 1268 states and 4590 transitions. [2022-11-03 03:46:07,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:46:07,365 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.5) internal successors, (81), 18 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 [2022-11-03 03:46:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:07,375 INFO L225 Difference]: With dead ends: 1268 [2022-11-03 03:46:07,375 INFO L226 Difference]: Without dead ends: 1217 [2022-11-03 03:46:07,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:46:07,376 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:07,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 600 Invalid, 0 Unknown, 88 Unchecked, 0.9s Time] [2022-11-03 03:46:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2022-11-03 03:46:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 794. [2022-11-03 03:46:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 3.8663303909205546) internal successors, (3066), 793 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3066 transitions. [2022-11-03 03:46:07,422 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3066 transitions. Word has length 30 [2022-11-03 03:46:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:07,422 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 3066 transitions. [2022-11-03 03:46:07,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.5) internal successors, (81), 18 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) [2022-11-03 03:46:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3066 transitions. [2022-11-03 03:46:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:46:07,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:07,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:07,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:46:07,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:46:07,643 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:46:07,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1980811869, now seen corresponding path program 1 times [2022-11-03 03:46:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:07,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574379158] [2022-11-03 03:46:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:46:08,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:08,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574379158] [2022-11-03 03:46:08,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574379158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:08,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:08,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:46:08,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682810279] [2022-11-03 03:46:08,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:08,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:46:08,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:08,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:46:08,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:46:08,184 INFO L87 Difference]: Start difference. First operand 794 states and 3066 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:08,310 INFO L93 Difference]: Finished difference Result 850 states and 3079 transitions. [2022-11-03 03:46:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:46:08,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 03:46:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:08,316 INFO L225 Difference]: With dead ends: 850 [2022-11-03 03:46:08,316 INFO L226 Difference]: Without dead ends: 826 [2022-11-03 03:46:08,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:46:08,317 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:08,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:46:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-11-03 03:46:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 740. [2022-11-03 03:46:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 3.756427604871448) internal successors, (2776), 739 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2776 transitions. [2022-11-03 03:46:08,351 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2776 transitions. Word has length 30 [2022-11-03 03:46:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:08,351 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 2776 transitions. [2022-11-03 03:46:08,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2776 transitions. [2022-11-03 03:46:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:46:08,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:08,355 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:08,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 03:46:08,355 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:46:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2115735534, now seen corresponding path program 1 times [2022-11-03 03:46:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:08,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215629666] [2022-11-03 03:46:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:08,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:46:09,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:09,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215629666] [2022-11-03 03:46:09,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215629666] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:46:09,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300773017] [2022-11-03 03:46:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:09,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:46:09,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:46:09,162 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:46:09,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:46:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:09,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:46:09,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:46:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:46:09,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:46:12,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:46:12,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 533 treesize of output 722 [2022-11-03 03:46:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:46:22,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300773017] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:46:22,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1377786708] [2022-11-03 03:46:22,381 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:46:22,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:46:22,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-11-03 03:46:22,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716458031] [2022-11-03 03:46:22,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:46:22,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 03:46:22,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:22,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 03:46:22,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-11-03 03:46:22,385 INFO L87 Difference]: Start difference. First operand 740 states and 2776 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:23,368 INFO L93 Difference]: Finished difference Result 927 states and 3241 transitions. [2022-11-03 03:46:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:46:23,369 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 03:46:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:23,376 INFO L225 Difference]: With dead ends: 927 [2022-11-03 03:46:23,377 INFO L226 Difference]: Without dead ends: 927 [2022-11-03 03:46:23,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:46:23,385 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:23,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 197 Invalid, 0 Unknown, 88 Unchecked, 0.3s Time] [2022-11-03 03:46:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-11-03 03:46:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 771. [2022-11-03 03:46:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 3.7194805194805194) internal successors, (2864), 770 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 2864 transitions. [2022-11-03 03:46:23,424 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 2864 transitions. Word has length 30 [2022-11-03 03:46:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:23,425 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 2864 transitions. [2022-11-03 03:46:23,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 2864 transitions. [2022-11-03 03:46:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:46:23,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:23,431 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:23,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:46:23,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 03:46:23,639 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:46:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -444401728, now seen corresponding path program 2 times [2022-11-03 03:46:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:23,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45713568] [2022-11-03 03:46:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:23,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:46:24,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:24,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45713568] [2022-11-03 03:46:24,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45713568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:46:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384524430] [2022-11-03 03:46:24,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:46:24,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:46:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:46:24,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:46:24,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:46:24,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:46:24,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:46:24,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 03:46:24,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:46:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:46:24,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:46:25,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:46:25,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 283 [2022-11-03 03:46:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:46:25,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384524430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:46:25,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [769394324] [2022-11-03 03:46:25,675 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:46:25,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:46:25,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-11-03 03:46:25,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150373402] [2022-11-03 03:46:25,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:46:25,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 03:46:25,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:25,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 03:46:25,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:46:25,679 INFO L87 Difference]: Start difference. First operand 771 states and 2864 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 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) [2022-11-03 03:46:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:26,432 INFO L93 Difference]: Finished difference Result 1294 states and 4449 transitions. [2022-11-03 03:46:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:46:26,433 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 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 30 [2022-11-03 03:46:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:26,442 INFO L225 Difference]: With dead ends: 1294 [2022-11-03 03:46:26,442 INFO L226 Difference]: Without dead ends: 1060 [2022-11-03 03:46:26,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:46:26,443 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 231 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:26,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 0 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:46:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2022-11-03 03:46:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 570. [2022-11-03 03:46:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 3.768014059753954) internal successors, (2144), 569 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 2144 transitions. [2022-11-03 03:46:26,476 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 2144 transitions. Word has length 30 [2022-11-03 03:46:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:26,476 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 2144 transitions. [2022-11-03 03:46:26,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 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) [2022-11-03 03:46:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 2144 transitions. [2022-11-03 03:46:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 03:46:26,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:26,480 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:26,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:46:26,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 03:46:26,686 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:46:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1914615944, now seen corresponding path program 2 times [2022-11-03 03:46:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:26,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842143033] [2022-11-03 03:46:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:46:28,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:28,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842143033] [2022-11-03 03:46:28,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842143033] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:46:28,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884082704] [2022-11-03 03:46:28,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:46:28,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:46:28,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:46:28,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:46:28,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff818fc8-1011-4036-92b4-c8bb02cf1bcf/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:46:29,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:46:29,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:46:29,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 03:46:29,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:46:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:46:29,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:46:34,151 INFO L356 Elim1Store]: treesize reduction 240, result has 70.0 percent of original size [2022-11-03 03:46:34,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 1285 treesize of output 1588