./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0 --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 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca --- 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-e04fb08 [2022-11-16 20:23:13,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:23:13,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:23:13,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:23:13,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:23:13,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:23:13,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:23:13,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:23:13,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:23:13,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:23:13,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:23:13,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:23:13,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:23:13,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:23:13,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:23:13,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:23:13,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:23:13,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:23:13,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:23:13,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:23:13,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:23:13,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:23:13,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:23:13,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:23:13,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:23:13,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:23:13,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:23:13,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:23:13,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:23:13,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:23:13,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:23:13,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:23:13,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:23:13,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:23:13,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:23:13,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:23:13,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:23:13,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:23:13,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:23:13,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:23:13,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:23:13,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 20:23:13,252 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:23:13,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:23:13,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:23:13,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:23:13,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:23:13,255 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:23:13,255 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:23:13,255 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:23:13,255 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:23:13,256 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:23:13,257 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:23:13,257 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:23:13,257 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:23:13,258 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:23:13,258 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:23:13,258 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:23:13,258 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:23:13,259 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:23:13,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:23:13,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:23:13,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:23:13,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:23:13,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:23:13,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 20:23:13,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:23:13,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 20:23:13,263 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:23:13,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 20:23:13,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:23:13,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 20:23:13,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:23:13,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:23:13,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:23:13,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:23:13,265 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:23:13,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:23:13,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 20:23:13,266 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:23:13,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:23:13,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 20:23:13,267 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:23:13,267 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_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/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_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0 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 -> 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca [2022-11-16 20:23:13,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:23:13,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:23:13,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:23:13,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:23:13,734 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:23:13,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2022-11-16 20:23:13,827 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/data/b40dc6236/dc6a2d73de9646a0a9da783c165f18ff/FLAGd7290822c [2022-11-16 20:23:14,431 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:23:14,432 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2022-11-16 20:23:14,443 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/data/b40dc6236/dc6a2d73de9646a0a9da783c165f18ff/FLAGd7290822c [2022-11-16 20:23:14,732 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/data/b40dc6236/dc6a2d73de9646a0a9da783c165f18ff [2022-11-16 20:23:14,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:23:14,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:23:14,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:23:14,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:23:14,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:23:14,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:23:14" (1/1) ... [2022-11-16 20:23:14,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dff33cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:14, skipping insertion in model container [2022-11-16 20:23:14,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:23:14" (1/1) ... [2022-11-16 20:23:14,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:23:14,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:23:15,165 WARN L229 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_d0033a5d-90fa-4f16-9b11-c2967198c366/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-11-16 20:23:15,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:23:15,203 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:23:15,254 WARN L229 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_d0033a5d-90fa-4f16-9b11-c2967198c366/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-11-16 20:23:15,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:23:15,292 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:23:15,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15 WrapperNode [2022-11-16 20:23:15,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:23:15,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:23:15,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:23:15,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:23:15,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,364 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-11-16 20:23:15,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:23:15,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:23:15,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:23:15,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:23:15,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:23:15,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:23:15,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:23:15,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:23:15,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (1/1) ... [2022-11-16 20:23:15,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:23:15,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:23:15,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:23:15,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:23:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:23:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 20:23:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 20:23:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 20:23:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 20:23:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 20:23:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 20:23:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 20:23:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 20:23:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 20:23:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-16 20:23:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-16 20:23:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:23:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 20:23:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 20:23:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 20:23:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:23:15,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:23:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 20:23:15,533 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 20:23:15,665 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:23:15,668 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:23:16,271 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:23:16,446 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:23:16,447 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 20:23:16,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:23:16 BoogieIcfgContainer [2022-11-16 20:23:16,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:23:16,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:23:16,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:23:16,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:23:16,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:23:14" (1/3) ... [2022-11-16 20:23:16,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38aff1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:23:16, skipping insertion in model container [2022-11-16 20:23:16,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:23:15" (2/3) ... [2022-11-16 20:23:16,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38aff1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:23:16, skipping insertion in model container [2022-11-16 20:23:16,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:23:16" (3/3) ... [2022-11-16 20:23:16,467 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-11-16 20:23:16,478 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 20:23:16,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:23:16,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 20:23:16,492 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 20:23:16,643 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-16 20:23:16,695 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 20:23:16,713 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 172 transitions, 376 flow [2022-11-16 20:23:16,716 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 172 transitions, 376 flow [2022-11-16 20:23:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 172 transitions, 376 flow [2022-11-16 20:23:16,894 INFO L130 PetriNetUnfolder]: 12/168 cut-off events. [2022-11-16 20:23:16,894 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 20:23:16,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 168 events. 12/168 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-11-16 20:23:16,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 2280 [2022-11-16 20:23:27,456 INFO L134 LiptonReduction]: Checked pairs total: 3875 [2022-11-16 20:23:27,457 INFO L136 LiptonReduction]: Total number of compositions: 160 [2022-11-16 20:23:27,470 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 104 flow [2022-11-16 20:23:27,577 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 397 states, 396 states have (on average 3.7222222222222223) internal successors, (1474), 396 states have internal predecessors, (1474), 0 states have call successors, (0), 0 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-16 20:23:27,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:23:27,615 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;@3bef4e3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:23:27,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-16 20:23:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 396 states have (on average 3.7222222222222223) internal successors, (1474), 396 states have internal predecessors, (1474), 0 states have call successors, (0), 0 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-16 20:23:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 20:23:27,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:27,649 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-16 20:23:27,650 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-16 20:23:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash 880255615, now seen corresponding path program 1 times [2022-11-16 20:23:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:27,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525630879] [2022-11-16 20:23:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:28,200 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-16 20:23:28,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:28,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525630879] [2022-11-16 20:23:28,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525630879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:23:28,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:23:28,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:23:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770347275] [2022-11-16 20:23:28,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:23:28,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:23:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:23:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:23:28,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:23:28,243 INFO L87 Difference]: Start difference. First operand has 397 states, 396 states have (on average 3.7222222222222223) internal successors, (1474), 396 states have internal predecessors, (1474), 0 states have call successors, (0), 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 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:23:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:23:28,453 INFO L93 Difference]: Finished difference Result 479 states and 1790 transitions. [2022-11-16 20:23:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:23:28,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 20:23:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:23:28,476 INFO L225 Difference]: With dead ends: 479 [2022-11-16 20:23:28,476 INFO L226 Difference]: Without dead ends: 479 [2022-11-16 20:23:28,477 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-16 20:23:28,481 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:23:28,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:23:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-16 20:23:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2022-11-16 20:23:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 3.7447698744769875) internal successors, (1790), 478 states have internal predecessors, (1790), 0 states have call successors, (0), 0 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-16 20:23:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1790 transitions. [2022-11-16 20:23:28,583 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1790 transitions. Word has length 27 [2022-11-16 20:23:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:23:28,584 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 1790 transitions. [2022-11-16 20:23:28,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:23:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1790 transitions. [2022-11-16 20:23:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 20:23:28,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:28,589 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-16 20:23:28,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:23:28,590 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-16 20:23:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1826105199, now seen corresponding path program 1 times [2022-11-16 20:23:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:28,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802210729] [2022-11-16 20:23:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:23:28,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:28,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802210729] [2022-11-16 20:23:28,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802210729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:23:28,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:23:28,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:23:28,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484464123] [2022-11-16 20:23:28,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:23:28,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:23:28,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:23:28,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:23:28,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:23:28,893 INFO L87 Difference]: Start difference. First operand 479 states and 1790 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-16 20:23:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:23:29,027 INFO L93 Difference]: Finished difference Result 619 states and 2336 transitions. [2022-11-16 20:23:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:23:29,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-16 20:23:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:23:29,039 INFO L225 Difference]: With dead ends: 619 [2022-11-16 20:23:29,039 INFO L226 Difference]: Without dead ends: 619 [2022-11-16 20:23:29,041 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-16 20:23:29,044 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:23:29,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:23:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-11-16 20:23:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-11-16 20:23:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 3.779935275080906) internal successors, (2336), 618 states have internal predecessors, (2336), 0 states have call successors, (0), 0 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-16 20:23:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 2336 transitions. [2022-11-16 20:23:29,114 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 2336 transitions. Word has length 28 [2022-11-16 20:23:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:23:29,116 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 2336 transitions. [2022-11-16 20:23:29,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-16 20:23:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 2336 transitions. [2022-11-16 20:23:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 20:23:29,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:29,123 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-16 20:23:29,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 20:23:29,124 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-16 20:23:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash -239951207, now seen corresponding path program 1 times [2022-11-16 20:23:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:29,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030160056] [2022-11-16 20:23:29,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:29,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:23:29,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:29,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030160056] [2022-11-16 20:23:29,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030160056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:23:29,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:23:29,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:23:29,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774070061] [2022-11-16 20:23:29,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:23:29,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:23:29,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:23:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:23:29,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:23:29,420 INFO L87 Difference]: Start difference. First operand 619 states and 2336 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-16 20:23:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:23:29,574 INFO L93 Difference]: Finished difference Result 765 states and 2902 transitions. [2022-11-16 20:23:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:23:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-16 20:23:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:23:29,582 INFO L225 Difference]: With dead ends: 765 [2022-11-16 20:23:29,583 INFO L226 Difference]: Without dead ends: 765 [2022-11-16 20:23:29,583 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-16 20:23:29,585 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:23:29,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:23:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-11-16 20:23:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2022-11-16 20:23:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 3.798429319371728) internal successors, (2902), 764 states have internal predecessors, (2902), 0 states have call successors, (0), 0 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-16 20:23:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 2902 transitions. [2022-11-16 20:23:29,626 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 2902 transitions. Word has length 29 [2022-11-16 20:23:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:23:29,626 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 2902 transitions. [2022-11-16 20:23:29,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-16 20:23:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 2902 transitions. [2022-11-16 20:23:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 20:23:29,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:29,631 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-16 20:23:29,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 20:23:29,632 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-16 20:23:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1676809106, now seen corresponding path program 1 times [2022-11-16 20:23:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:29,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722902647] [2022-11-16 20:23:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:23:29,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:29,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722902647] [2022-11-16 20:23:29,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722902647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:23:29,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:23:29,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:23:29,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688539275] [2022-11-16 20:23:29,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:23:29,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:23:29,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:23:29,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:23:29,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:23:29,903 INFO L87 Difference]: Start difference. First operand 765 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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-16 20:23:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:23:30,014 INFO L93 Difference]: Finished difference Result 766 states and 2903 transitions. [2022-11-16 20:23:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:23:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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-16 20:23:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:23:30,022 INFO L225 Difference]: With dead ends: 766 [2022-11-16 20:23:30,022 INFO L226 Difference]: Without dead ends: 766 [2022-11-16 20:23:30,023 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-16 20:23:30,026 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:23:30,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:23:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-11-16 20:23:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2022-11-16 20:23:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 3.794771241830065) internal successors, (2903), 765 states have internal predecessors, (2903), 0 states have call successors, (0), 0 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-16 20:23:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2903 transitions. [2022-11-16 20:23:30,069 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 2903 transitions. Word has length 30 [2022-11-16 20:23:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:23:30,071 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 2903 transitions. [2022-11-16 20:23:30,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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-16 20:23:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 2903 transitions. [2022-11-16 20:23:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:23:30,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:30,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:23:30,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 20:23:30,083 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-16 20:23:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1888809452, now seen corresponding path program 1 times [2022-11-16 20:23:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:30,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713556169] [2022-11-16 20:23:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:23:30,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:30,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713556169] [2022-11-16 20:23:30,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713556169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:23:30,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:23:30,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:23:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727096133] [2022-11-16 20:23:30,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:23:30,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:23:30,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:23:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:23:30,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:23:30,672 INFO L87 Difference]: Start difference. First operand 766 states and 2903 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:23:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:23:30,860 INFO L93 Difference]: Finished difference Result 921 states and 3414 transitions. [2022-11-16 20:23:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:23:30,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 20:23:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:23:30,867 INFO L225 Difference]: With dead ends: 921 [2022-11-16 20:23:30,868 INFO L226 Difference]: Without dead ends: 670 [2022-11-16 20:23:30,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:23:30,869 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:23:30,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:23:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-11-16 20:23:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2022-11-16 20:23:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 3.705530642750374) internal successors, (2479), 669 states have internal predecessors, (2479), 0 states have call successors, (0), 0 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-16 20:23:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2479 transitions. [2022-11-16 20:23:30,903 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 2479 transitions. Word has length 31 [2022-11-16 20:23:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:23:30,903 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 2479 transitions. [2022-11-16 20:23:30,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:23:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 2479 transitions. [2022-11-16 20:23:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:23:30,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:30,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:23:30,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 20:23:30,908 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-16 20:23:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1202776224, now seen corresponding path program 2 times [2022-11-16 20:23:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:30,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704021706] [2022-11-16 20:23:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:30,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:23:31,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:31,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704021706] [2022-11-16 20:23:31,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704021706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:23:31,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592932925] [2022-11-16 20:23:31,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:23:31,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:23:31,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:23:31,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:23:31,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 20:23:31,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 20:23:31,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:23:32,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 20:23:32,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:23:32,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:23:32,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:23:32,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 20:23:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:23:32,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:23:35,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2022-11-16 20:23:35,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 20:23:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:23:35,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592932925] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 20:23:35,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:23:35,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 22 [2022-11-16 20:23:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416137519] [2022-11-16 20:23:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:23:35,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 20:23:35,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:23:35,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 20:23:35,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=438, Unknown=7, NotChecked=0, Total=552 [2022-11-16 20:23:35,377 INFO L87 Difference]: Start difference. First operand 670 states and 2479 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:23:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:23:36,520 INFO L93 Difference]: Finished difference Result 2021 states and 7596 transitions. [2022-11-16 20:23:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 20:23:36,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 20:23:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:23:36,535 INFO L225 Difference]: With dead ends: 2021 [2022-11-16 20:23:36,536 INFO L226 Difference]: Without dead ends: 1597 [2022-11-16 20:23:36,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=211, Invalid=1114, Unknown=7, NotChecked=0, Total=1332 [2022-11-16 20:23:36,537 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 20:23:36,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 33 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 346 Invalid, 0 Unknown, 261 Unchecked, 0.5s Time] [2022-11-16 20:23:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2022-11-16 20:23:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 763. [2022-11-16 20:23:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 762 states have (on average 3.6929133858267718) internal successors, (2814), 762 states have internal predecessors, (2814), 0 states have call successors, (0), 0 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-16 20:23:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 2814 transitions. [2022-11-16 20:23:36,593 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 2814 transitions. Word has length 31 [2022-11-16 20:23:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:23:36,595 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 2814 transitions. [2022-11-16 20:23:36,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:23:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 2814 transitions. [2022-11-16 20:23:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:23:36,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:36,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:23:36,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 20:23:36,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 20:23:36,811 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-16 20:23:36,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1816651040, now seen corresponding path program 3 times [2022-11-16 20:23:36,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:36,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763375591] [2022-11-16 20:23:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:23:38,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:38,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763375591] [2022-11-16 20:23:38,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763375591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:23:38,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582287792] [2022-11-16 20:23:38,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:23:38,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:23:38,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:23:38,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:23:38,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 20:23:38,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:23:38,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:23:38,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 20:23:38,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:23:38,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2022-11-16 20:23:38,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:23:38,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:23:38,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:23:38,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 20:23:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:23:38,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:23:38,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582287792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:23:38,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 20:23:38,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 19 [2022-11-16 20:23:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935411005] [2022-11-16 20:23:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:23:38,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 20:23:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:23:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 20:23:38,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-11-16 20:23:38,949 INFO L87 Difference]: Start difference. First operand 763 states and 2814 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:23:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:23:39,895 INFO L93 Difference]: Finished difference Result 1585 states and 5878 transitions. [2022-11-16 20:23:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 20:23:39,896 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 20:23:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:23:39,906 INFO L225 Difference]: With dead ends: 1585 [2022-11-16 20:23:39,906 INFO L226 Difference]: Without dead ends: 1033 [2022-11-16 20:23:39,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-11-16 20:23:39,911 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 249 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 20:23:39,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 18 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 20:23:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-11-16 20:23:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 765. [2022-11-16 20:23:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 3.647905759162304) internal successors, (2787), 764 states have internal predecessors, (2787), 0 states have call successors, (0), 0 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-16 20:23:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 2787 transitions. [2022-11-16 20:23:39,965 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 2787 transitions. Word has length 31 [2022-11-16 20:23:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:23:39,966 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 2787 transitions. [2022-11-16 20:23:39,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:23:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 2787 transitions. [2022-11-16 20:23:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:23:39,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:39,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:23:39,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 20:23:40,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:23:40,178 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-16 20:23:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1727509458, now seen corresponding path program 4 times [2022-11-16 20:23:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:40,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514277383] [2022-11-16 20:23:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:23:41,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:41,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514277383] [2022-11-16 20:23:41,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514277383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:23:41,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339536753] [2022-11-16 20:23:41,272 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:23:41,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:23:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:23:41,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:23:41,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 20:23:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:41,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 20:23:41,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:23:41,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 20:23:41,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 20:23:41,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:23:41,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:23:42,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:23:42,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:23:42,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:23:42,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:23:42,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-16 20:23:42,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 20:23:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:23:42,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:23:42,805 WARN L833 $PredicateComparison]: unable to prove that (or (= c_~b1~0 (* 256 (div c_~b1~0 256))) (forall ((v_ArrVal_354 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_354) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ .cse0 1)) (< 2147483647 .cse0))))) is different from false [2022-11-16 20:23:45,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_354 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_354) c_~A~0.base) c_~A~0.offset))) (or (< 2147483647 .cse0) (< (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1))))) is different from false [2022-11-16 20:23:46,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:23:46,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 60 [2022-11-16 20:23:46,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 841 treesize of output 773 [2022-11-16 20:23:46,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 651 treesize of output 617 [2022-11-16 20:23:46,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 730 treesize of output 718 [2022-11-16 20:23:46,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 718 treesize of output 694 [2022-11-16 20:23:46,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 694 treesize of output 646 [2022-11-16 20:26:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:26:29,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339536753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:26:29,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1895070780] [2022-11-16 20:26:29,456 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-16 20:26:29,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:26:29,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 36 [2022-11-16 20:26:29,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146777954] [2022-11-16 20:26:29,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:26:29,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 20:26:29,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:26:29,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 20:26:29,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1019, Unknown=38, NotChecked=138, Total=1406 [2022-11-16 20:26:29,463 INFO L87 Difference]: Start difference. First operand 765 states and 2787 transitions. Second operand has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-16 20:26:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:26:47,644 INFO L93 Difference]: Finished difference Result 9297 states and 34034 transitions. [2022-11-16 20:26:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-11-16 20:26:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 20:26:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:26:47,676 INFO L225 Difference]: With dead ends: 9297 [2022-11-16 20:26:47,676 INFO L226 Difference]: Without dead ends: 3675 [2022-11-16 20:26:47,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 51 SyntacticMatches, 56 SemanticMatches, 147 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11656 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=4446, Invalid=16959, Unknown=65, NotChecked=582, Total=22052 [2022-11-16 20:26:47,683 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1553 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 6124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3334 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-16 20:26:47,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 86 Invalid, 6124 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [161 Valid, 2629 Invalid, 0 Unknown, 3334 Unchecked, 3.9s Time] [2022-11-16 20:26:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2022-11-16 20:26:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 789. [2022-11-16 20:26:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 3.535532994923858) internal successors, (2786), 788 states have internal predecessors, (2786), 0 states have call successors, (0), 0 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-16 20:26:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2786 transitions. [2022-11-16 20:26:47,771 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2786 transitions. Word has length 31 [2022-11-16 20:26:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:26:47,771 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 2786 transitions. [2022-11-16 20:26:47,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-16 20:26:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2786 transitions. [2022-11-16 20:26:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:26:47,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:26:47,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:26:47,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 20:26:47,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 20:26:47,985 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-16 20:26:47,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:26:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1832191372, now seen corresponding path program 5 times [2022-11-16 20:26:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:26:47,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938986863] [2022-11-16 20:26:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:26:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:26:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:26:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:26:48,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:26:48,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938986863] [2022-11-16 20:26:48,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938986863] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:26:48,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683928848] [2022-11-16 20:26:48,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:26:48,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:26:48,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:26:48,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:26:49,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 20:26:49,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 20:26:49,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:26:49,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 20:26:49,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:26:49,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:26:49,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:26:49,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:26:49,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:26:49,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-16 20:26:50,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:26:50,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:26:50,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 20:26:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:26:50,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:26:50,633 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_425 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_425) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0)))) (= c_~b1~0 (* 256 (div c_~b1~0 256)))) is different from false [2022-11-16 20:26:50,922 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse5 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse2 (select .cse4 .cse5)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) (and (forall ((v_ArrVal_424 Int)) (let ((.cse1 (store .cse4 .cse5 v_ArrVal_424))) (or (forall ((v_ArrVal_425 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base .cse1) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_425) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ .cse0 2))))) (not (<= (+ v_ArrVal_424 1) .cse2)) (not (< c_~min~0 (select .cse1 .cse3)))))) (forall ((v_ArrVal_424 Int)) (let ((.cse8 (store .cse4 .cse5 v_ArrVal_424))) (let ((.cse6 (select .cse8 .cse3))) (or (< c_~min~0 .cse6) (not (<= (+ v_ArrVal_424 1) .cse2)) (forall ((v_ArrVal_425 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_int| c_~A~0.base .cse8) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_425) c_~A~0.base) c_~A~0.offset))) (or (< .cse6 (+ .cse7 2)) (< 2147483646 .cse7))))))))))) (= c_~b1~0 (* 256 (div c_~b1~0 256)))) is different from false [2022-11-16 20:26:52,999 WARN L833 $PredicateComparison]: unable to prove that (or (= c_~b1~0 (* 256 (div c_~b1~0 256))) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse4 c_~A~0.offset)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) (and (forall ((v_ArrVal_424 Int)) (let ((.cse2 (store .cse4 c_~A~0.offset v_ArrVal_424))) (or (not (<= (+ v_ArrVal_424 1) .cse0)) (forall ((v_ArrVal_425 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| c_~A~0.base .cse2) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_425) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse1) (< c_~min~0 (+ .cse1 2))))) (not (< c_~min~0 (select .cse2 .cse3)))))) (forall ((v_ArrVal_424 Int)) (let ((.cse7 (store .cse4 c_~A~0.offset v_ArrVal_424))) (let ((.cse5 (select .cse7 .cse3))) (or (not (<= (+ v_ArrVal_424 1) .cse0)) (< c_~min~0 .cse5) (forall ((v_ArrVal_425 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_int| c_~A~0.base .cse7) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_425) c_~A~0.base) c_~A~0.offset))) (or (< .cse5 (+ .cse6 2)) (< 2147483646 .cse6)))))))))))) is different from false [2022-11-16 20:26:55,533 WARN L833 $PredicateComparison]: unable to prove that (or (= c_~b1~0 (* 256 (div c_~b1~0 256))) (let ((.cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) (and (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_422 (Array Int Int)) (v_ArrVal_424 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_421) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_422))) (let ((.cse0 (select .cse2 c_~A~0.base))) (let ((.cse3 (store .cse0 c_~A~0.offset v_ArrVal_424))) (or (not (<= (+ v_ArrVal_424 1) (select .cse0 c_~A~0.offset))) (forall ((v_ArrVal_425 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 c_~A~0.base .cse3) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_425) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse1) (< c_~min~0 (+ .cse1 2))))) (not (< c_~min~0 (select .cse3 .cse4)))))))) (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_422 (Array Int Int)) (v_ArrVal_424 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_421) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_422))) (let ((.cse5 (select .cse8 c_~A~0.base))) (let ((.cse9 (store .cse5 c_~A~0.offset v_ArrVal_424))) (let ((.cse6 (select .cse9 .cse4))) (or (not (<= (+ v_ArrVal_424 1) (select .cse5 c_~A~0.offset))) (forall ((v_ArrVal_425 (Array Int Int))) (let ((.cse7 (select (select (store (store .cse8 c_~A~0.base .cse9) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_425) c_~A~0.base) c_~A~0.offset))) (or (< .cse6 (+ .cse7 2)) (< 2147483646 .cse7)))) (< c_~min~0 .cse6)))))))))) is different from false [2022-11-16 20:26:55,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 559 treesize of output 547 [2022-11-16 20:26:55,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 522 [2022-11-16 20:26:55,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 522 treesize of output 506 [2022-11-16 20:26:55,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 506 treesize of output 502 [2022-11-16 20:26:55,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 502 treesize of output 500 [2022-11-16 20:26:55,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 498 [2022-11-16 20:26:55,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 498 treesize of output 482 [2022-11-16 20:26:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-11-16 20:26:58,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683928848] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:26:58,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1884801615] [2022-11-16 20:26:58,714 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-16 20:26:58,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:26:58,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 35 [2022-11-16 20:26:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775728888] [2022-11-16 20:26:58,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:26:58,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-16 20:26:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:26:58,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-16 20:26:58,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=893, Unknown=18, NotChecked=260, Total=1332 [2022-11-16 20:26:58,719 INFO L87 Difference]: Start difference. First operand 789 states and 2786 transitions. Second operand has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-16 20:27:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:10,868 INFO L93 Difference]: Finished difference Result 3166 states and 11448 transitions. [2022-11-16 20:27:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 20:27:10,869 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 20:27:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:10,882 INFO L225 Difference]: With dead ends: 3166 [2022-11-16 20:27:10,882 INFO L226 Difference]: Without dead ends: 1947 [2022-11-16 20:27:10,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 38 SyntacticMatches, 17 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=1090, Invalid=3878, Unknown=18, NotChecked=564, Total=5550 [2022-11-16 20:27:10,885 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 715 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1006 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:10,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 34 Invalid, 3350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2239 Invalid, 0 Unknown, 1006 Unchecked, 2.7s Time] [2022-11-16 20:27:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2022-11-16 20:27:10,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 787. [2022-11-16 20:27:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 3.5368956743002546) internal successors, (2780), 786 states have internal predecessors, (2780), 0 states have call successors, (0), 0 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-16 20:27:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 2780 transitions. [2022-11-16 20:27:10,928 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 2780 transitions. Word has length 31 [2022-11-16 20:27:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:10,929 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 2780 transitions. [2022-11-16 20:27:10,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-16 20:27:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 2780 transitions. [2022-11-16 20:27:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:27:10,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:10,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:10,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:11,145 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-16 20:27:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -825068236, now seen corresponding path program 6 times [2022-11-16 20:27:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31005821] [2022-11-16 20:27:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:11,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:11,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:11,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31005821] [2022-11-16 20:27:11,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31005821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:11,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289869859] [2022-11-16 20:27:11,491 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:27:11,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:11,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:11,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 20:27:11,665 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:27:11,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:11,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 20:27:11,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:11,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:27:11,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 39 [2022-11-16 20:27:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:11,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:12,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289869859] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:12,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:27:12,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2022-11-16 20:27:12,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225370729] [2022-11-16 20:27:12,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:27:12,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:27:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:12,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:27:12,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-16 20:27:12,093 INFO L87 Difference]: Start difference. First operand 787 states and 2780 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:27:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:12,343 INFO L93 Difference]: Finished difference Result 1137 states and 4020 transitions. [2022-11-16 20:27:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:27:12,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 20:27:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:12,352 INFO L225 Difference]: With dead ends: 1137 [2022-11-16 20:27:12,352 INFO L226 Difference]: Without dead ends: 1078 [2022-11-16 20:27:12,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-11-16 20:27:12,353 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:12,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 18 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 162 Unchecked, 0.1s Time] [2022-11-16 20:27:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2022-11-16 20:27:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 924. [2022-11-16 20:27:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 3.5568797399783314) internal successors, (3283), 923 states have internal predecessors, (3283), 0 states have call successors, (0), 0 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-16 20:27:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 3283 transitions. [2022-11-16 20:27:12,389 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 3283 transitions. Word has length 31 [2022-11-16 20:27:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:12,389 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 3283 transitions. [2022-11-16 20:27:12,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:27:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 3283 transitions. [2022-11-16 20:27:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:27:12,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:12,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:12,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:12,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 20:27:12,599 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-16 20:27:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1950860262, now seen corresponding path program 7 times [2022-11-16 20:27:12,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:12,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954266819] [2022-11-16 20:27:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:12,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:27:13,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:13,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954266819] [2022-11-16 20:27:13,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954266819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:13,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390465220] [2022-11-16 20:27:13,031 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:27:13,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:13,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:13,033 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:13,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 20:27:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:13,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 20:27:13,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:13,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:13,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-16 20:27:13,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:13,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-16 20:27:13,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 20:27:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:27:13,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:19,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 439 treesize of output 387 [2022-11-16 20:27:19,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 372 [2022-11-16 20:27:19,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 368 [2022-11-16 20:27:19,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 356 [2022-11-16 20:27:19,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 332 [2022-11-16 20:27:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:27:19,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390465220] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:19,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [302985067] [2022-11-16 20:27:19,742 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-16 20:27:19,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:19,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 27 [2022-11-16 20:27:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246134488] [2022-11-16 20:27:19,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:19,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 20:27:19,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:19,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 20:27:19,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=610, Unknown=12, NotChecked=0, Total=756 [2022-11-16 20:27:19,746 INFO L87 Difference]: Start difference. First operand 924 states and 3283 transitions. Second operand has 28 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 28 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-16 20:27:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:24,697 INFO L93 Difference]: Finished difference Result 4591 states and 16606 transitions. [2022-11-16 20:27:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 20:27:24,697 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 28 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 20:27:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:24,726 INFO L225 Difference]: With dead ends: 4591 [2022-11-16 20:27:24,726 INFO L226 Difference]: Without dead ends: 3387 [2022-11-16 20:27:24,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1821 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1468, Invalid=4372, Unknown=12, NotChecked=0, Total=5852 [2022-11-16 20:27:24,729 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1118 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1121 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:24,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 95 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1056 Invalid, 0 Unknown, 1121 Unchecked, 1.4s Time] [2022-11-16 20:27:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2022-11-16 20:27:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 1348. [2022-11-16 20:27:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1347 states have (on average 3.6674090571640683) internal successors, (4940), 1347 states have internal predecessors, (4940), 0 states have call successors, (0), 0 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-16 20:27:24,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 4940 transitions. [2022-11-16 20:27:24,815 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 4940 transitions. Word has length 31 [2022-11-16 20:27:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:24,816 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 4940 transitions. [2022-11-16 20:27:24,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 28 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-16 20:27:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 4940 transitions. [2022-11-16 20:27:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:27:24,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:24,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:24,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:25,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:25,029 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-16 20:27:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash 389166918, now seen corresponding path program 8 times [2022-11-16 20:27:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:25,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828828277] [2022-11-16 20:27:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:25,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:25,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828828277] [2022-11-16 20:27:25,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828828277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:25,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243134071] [2022-11-16 20:27:25,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:27:25,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:25,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:25,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:25,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 20:27:25,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 20:27:25,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:25,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 20:27:25,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:25,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 20:27:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:25,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:26,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243134071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:26,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1392442858] [2022-11-16 20:27:26,223 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-16 20:27:26,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:26,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2022-11-16 20:27:26,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000304545] [2022-11-16 20:27:26,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:26,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 20:27:26,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:26,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 20:27:26,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-16 20:27:26,225 INFO L87 Difference]: Start difference. First operand 1348 states and 4940 transitions. Second operand has 18 states, 17 states have (on average 4.764705882352941) 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-16 20:27:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:28,029 INFO L93 Difference]: Finished difference Result 4624 states and 17252 transitions. [2022-11-16 20:27:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 20:27:28,030 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.764705882352941) 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 31 [2022-11-16 20:27:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:28,039 INFO L225 Difference]: With dead ends: 4624 [2022-11-16 20:27:28,040 INFO L226 Difference]: Without dead ends: 1891 [2022-11-16 20:27:28,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=658, Invalid=1504, Unknown=0, NotChecked=0, Total=2162 [2022-11-16 20:27:28,041 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 368 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:28,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 45 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-16 20:27:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-11-16 20:27:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1193. [2022-11-16 20:27:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1192 states have (on average 3.6459731543624163) internal successors, (4346), 1192 states have internal predecessors, (4346), 0 states have call successors, (0), 0 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-16 20:27:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 4346 transitions. [2022-11-16 20:27:28,094 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 4346 transitions. Word has length 31 [2022-11-16 20:27:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:28,095 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 4346 transitions. [2022-11-16 20:27:28,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.764705882352941) 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-16 20:27:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 4346 transitions. [2022-11-16 20:27:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:27:28,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:28,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:28,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 20:27:28,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 20:27:28,307 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-16 20:27:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash 866137670, now seen corresponding path program 9 times [2022-11-16 20:27:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:28,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722932730] [2022-11-16 20:27:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:28,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:28,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722932730] [2022-11-16 20:27:28,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722932730] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:28,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149718892] [2022-11-16 20:27:28,849 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:27:28,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:28,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:28,852 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:28,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 20:27:29,053 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:27:29,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:29,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 20:27:29,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:29,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:29,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:27:29,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:29,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:27:29,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 20:27:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:29,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:30,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2022-11-16 20:27:30,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-16 20:27:30,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 20:27:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:30,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149718892] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:30,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293891422] [2022-11-16 20:27:30,182 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-16 20:27:30,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:30,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-11-16 20:27:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474941245] [2022-11-16 20:27:30,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 20:27:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:30,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 20:27:30,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=627, Unknown=8, NotChecked=0, Total=756 [2022-11-16 20:27:30,184 INFO L87 Difference]: Start difference. First operand 1193 states and 4346 transitions. Second operand has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:34,230 INFO L93 Difference]: Finished difference Result 3469 states and 12680 transitions. [2022-11-16 20:27:34,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-16 20:27:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 20:27:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:34,237 INFO L225 Difference]: With dead ends: 3469 [2022-11-16 20:27:34,237 INFO L226 Difference]: Without dead ends: 1275 [2022-11-16 20:27:34,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1640, Invalid=3754, Unknown=8, NotChecked=0, Total=5402 [2022-11-16 20:27:34,240 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1053 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:34,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 57 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1091 Invalid, 0 Unknown, 71 Unchecked, 1.3s Time] [2022-11-16 20:27:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-11-16 20:27:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 639. [2022-11-16 20:27:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 3.310344827586207) internal successors, (2112), 638 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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-16 20:27:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2112 transitions. [2022-11-16 20:27:34,267 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 2112 transitions. Word has length 31 [2022-11-16 20:27:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:34,268 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 2112 transitions. [2022-11-16 20:27:34,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 2112 transitions. [2022-11-16 20:27:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:27:34,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:34,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:34,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:34,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 20:27:34,477 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-16 20:27:34,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:34,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1791944268, now seen corresponding path program 10 times [2022-11-16 20:27:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:34,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153316282] [2022-11-16 20:27:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:34,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:27:34,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:34,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153316282] [2022-11-16 20:27:34,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153316282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:27:34,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:27:34,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:27:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352015019] [2022-11-16 20:27:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:27:34,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:27:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:34,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:27:34,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:27:34,745 INFO L87 Difference]: Start difference. First operand 639 states and 2112 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:27:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:34,924 INFO L93 Difference]: Finished difference Result 694 states and 2285 transitions. [2022-11-16 20:27:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:27:34,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 20:27:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:34,927 INFO L225 Difference]: With dead ends: 694 [2022-11-16 20:27:34,927 INFO L226 Difference]: Without dead ends: 463 [2022-11-16 20:27:34,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:27:34,928 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:34,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:27:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-11-16 20:27:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 459. [2022-11-16 20:27:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 3.296943231441048) internal successors, (1510), 458 states have internal predecessors, (1510), 0 states have call successors, (0), 0 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-16 20:27:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1510 transitions. [2022-11-16 20:27:34,944 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1510 transitions. Word has length 31 [2022-11-16 20:27:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:34,944 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 1510 transitions. [2022-11-16 20:27:34,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-16 20:27:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1510 transitions. [2022-11-16 20:27:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 20:27:34,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:34,947 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, 1] [2022-11-16 20:27:34,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 20:27:34,947 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-16 20:27:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash -468015174, now seen corresponding path program 11 times [2022-11-16 20:27:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:34,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996004241] [2022-11-16 20:27:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:35,101 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-16 20:27:35,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:35,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996004241] [2022-11-16 20:27:35,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996004241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:35,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98224028] [2022-11-16 20:27:35,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:27:35,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:35,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:35,107 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:35,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 20:27:35,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 20:27:35,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:35,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 20:27:35,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:35,764 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-16 20:27:35,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:35,858 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-16 20:27:35,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98224028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:35,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1989785224] [2022-11-16 20:27:35,859 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-16 20:27:35,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:35,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-16 20:27:35,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246261666] [2022-11-16 20:27:35,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:35,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 20:27:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:35,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 20:27:35,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-16 20:27:35,861 INFO L87 Difference]: Start difference. First operand 459 states and 1510 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-16 20:27:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:36,245 INFO L93 Difference]: Finished difference Result 823 states and 2513 transitions. [2022-11-16 20:27:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:27:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-16 20:27:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:36,251 INFO L225 Difference]: With dead ends: 823 [2022-11-16 20:27:36,251 INFO L226 Difference]: Without dead ends: 757 [2022-11-16 20:27:36,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-16 20:27:36,252 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 137 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:36,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 6 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:27:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-11-16 20:27:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 669. [2022-11-16 20:27:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 3.1347305389221556) internal successors, (2094), 668 states have internal predecessors, (2094), 0 states have call successors, (0), 0 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-16 20:27:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 2094 transitions. [2022-11-16 20:27:36,275 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 2094 transitions. Word has length 32 [2022-11-16 20:27:36,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:36,276 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 2094 transitions. [2022-11-16 20:27:36,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-16 20:27:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 2094 transitions. [2022-11-16 20:27:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 20:27:36,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:36,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:36,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:36,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:36,485 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-16 20:27:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash 356452796, now seen corresponding path program 12 times [2022-11-16 20:27:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:36,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151613303] [2022-11-16 20:27:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:27:36,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:36,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151613303] [2022-11-16 20:27:36,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151613303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:36,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82491358] [2022-11-16 20:27:36,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:27:36,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:36,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:36,645 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:36,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 20:27:36,830 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:27:36,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:36,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 20:27:36,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:27:36,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:27:36,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82491358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:36,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2077511062] [2022-11-16 20:27:36,989 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-16 20:27:36,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:36,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-16 20:27:36,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825980906] [2022-11-16 20:27:36,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:36,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 20:27:36,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:36,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 20:27:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-16 20:27:36,996 INFO L87 Difference]: Start difference. First operand 669 states and 2094 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:37,351 INFO L93 Difference]: Finished difference Result 819 states and 2530 transitions. [2022-11-16 20:27:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:27:37,352 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-16 20:27:37,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:37,355 INFO L225 Difference]: With dead ends: 819 [2022-11-16 20:27:37,355 INFO L226 Difference]: Without dead ends: 819 [2022-11-16 20:27:37,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-11-16 20:27:37,356 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 249 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:37,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 13 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:27:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-11-16 20:27:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 731. [2022-11-16 20:27:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 3.16027397260274) internal successors, (2307), 730 states have internal predecessors, (2307), 0 states have call successors, (0), 0 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-16 20:27:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 2307 transitions. [2022-11-16 20:27:37,381 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 2307 transitions. Word has length 33 [2022-11-16 20:27:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:37,381 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 2307 transitions. [2022-11-16 20:27:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 2307 transitions. [2022-11-16 20:27:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 20:27:37,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:37,394 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 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-16 20:27:37,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:37,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 20:27:37,611 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-16 20:27:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1769181790, now seen corresponding path program 13 times [2022-11-16 20:27:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:37,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838384372] [2022-11-16 20:27:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:27:37,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:37,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838384372] [2022-11-16 20:27:37,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838384372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:37,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885705224] [2022-11-16 20:27:37,782 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:27:37,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:37,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:37,784 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:37,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 20:27:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:37,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 20:27:37,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:38,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:27:38,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885705224] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:38,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [236920455] [2022-11-16 20:27:38,150 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-16 20:27:38,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:38,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-11-16 20:27:38,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879577992] [2022-11-16 20:27:38,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:38,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 20:27:38,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 20:27:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-11-16 20:27:38,152 INFO L87 Difference]: Start difference. First operand 731 states and 2307 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:38,604 INFO L93 Difference]: Finished difference Result 583 states and 1835 transitions. [2022-11-16 20:27:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:27:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-16 20:27:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:38,606 INFO L225 Difference]: With dead ends: 583 [2022-11-16 20:27:38,607 INFO L226 Difference]: Without dead ends: 522 [2022-11-16 20:27:38,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-16 20:27:38,608 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 96 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:38,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 23 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 20:27:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-16 20:27:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2022-11-16 20:27:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 3.309021113243762) internal successors, (1724), 521 states have internal predecessors, (1724), 0 states have call successors, (0), 0 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-16 20:27:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1724 transitions. [2022-11-16 20:27:38,625 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1724 transitions. Word has length 33 [2022-11-16 20:27:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:38,626 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 1724 transitions. [2022-11-16 20:27:38,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1724 transitions. [2022-11-16 20:27:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 20:27:38,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:38,628 INFO L195 NwaCegarLoop]: trace histogram [3, 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-16 20:27:38,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:38,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 20:27:38,835 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 20:27:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1557885084, now seen corresponding path program 14 times [2022-11-16 20:27:38,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:38,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357463901] [2022-11-16 20:27:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 20:27:39,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:39,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357463901] [2022-11-16 20:27:39,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357463901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:39,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602870949] [2022-11-16 20:27:39,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:27:39,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:39,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:39,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 20:27:39,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 20:27:39,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:39,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 20:27:39,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 20:27:39,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 20:27:39,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602870949] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:39,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [941121404] [2022-11-16 20:27:39,698 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-16 20:27:39,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:39,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-16 20:27:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762473405] [2022-11-16 20:27:39,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:39,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 20:27:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 20:27:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-16 20:27:39,700 INFO L87 Difference]: Start difference. First operand 522 states and 1724 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:39,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:39,932 INFO L93 Difference]: Finished difference Result 702 states and 2298 transitions. [2022-11-16 20:27:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:27:39,933 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-16 20:27:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:39,936 INFO L225 Difference]: With dead ends: 702 [2022-11-16 20:27:39,936 INFO L226 Difference]: Without dead ends: 702 [2022-11-16 20:27:39,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-11-16 20:27:39,937 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 139 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:39,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 2 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:27:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-11-16 20:27:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 639. [2022-11-16 20:27:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 3.3385579937304075) internal successors, (2130), 638 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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-16 20:27:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2130 transitions. [2022-11-16 20:27:39,957 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 2130 transitions. Word has length 34 [2022-11-16 20:27:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:39,958 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 2130 transitions. [2022-11-16 20:27:39,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 2130 transitions. [2022-11-16 20:27:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 20:27:39,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:39,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:39,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:40,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 20:27:40,167 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 20:27:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:40,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1168338766, now seen corresponding path program 15 times [2022-11-16 20:27:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:40,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724661672] [2022-11-16 20:27:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:27:40,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:40,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724661672] [2022-11-16 20:27:40,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724661672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:40,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238184848] [2022-11-16 20:27:40,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:27:40,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:40,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:40,331 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:40,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 20:27:40,497 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:27:40,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:40,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 20:27:40,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:27:40,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:27:40,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238184848] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:40,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [527379038] [2022-11-16 20:27:40,660 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-16 20:27:40,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:40,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-11-16 20:27:40,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515165043] [2022-11-16 20:27:40,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:40,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 20:27:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 20:27:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-16 20:27:40,663 INFO L87 Difference]: Start difference. First operand 639 states and 2130 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-16 20:27:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:41,105 INFO L93 Difference]: Finished difference Result 727 states and 2468 transitions. [2022-11-16 20:27:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 20:27:41,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-16 20:27:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:41,107 INFO L225 Difference]: With dead ends: 727 [2022-11-16 20:27:41,107 INFO L226 Difference]: Without dead ends: 727 [2022-11-16 20:27:41,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2022-11-16 20:27:41,108 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 177 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:41,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 11 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:27:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-11-16 20:27:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2022-11-16 20:27:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 3.399449035812672) internal successors, (2468), 726 states have internal predecessors, (2468), 0 states have call successors, (0), 0 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-16 20:27:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 2468 transitions. [2022-11-16 20:27:41,131 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 2468 transitions. Word has length 34 [2022-11-16 20:27:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:41,131 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 2468 transitions. [2022-11-16 20:27:41,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-16 20:27:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 2468 transitions. [2022-11-16 20:27:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 20:27:41,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:41,134 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:41,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:41,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:41,340 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 20:27:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1267090739, now seen corresponding path program 16 times [2022-11-16 20:27:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:41,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168981288] [2022-11-16 20:27:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:27:42,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168981288] [2022-11-16 20:27:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168981288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707977164] [2022-11-16 20:27:42,683 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:27:42,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:42,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:42,699 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:42,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 20:27:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:42,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 20:27:42,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:42,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:42,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:42,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-11-16 20:27:43,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:43,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-16 20:27:43,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:43,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-16 20:27:43,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-16 20:27:43,806 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-16 20:27:43,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-16 20:27:43,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:43,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 20:27:43,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 20:27:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:27:43,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:59,227 WARN L233 SmtUtils]: Spent 13.26s on a formula simplification. DAG size of input: 90 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:28:03,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 583 treesize of output 557 [2022-11-16 20:28:03,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:28:03,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 313 [2022-11-16 20:28:03,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:28:03,840 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-16 20:28:03,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 425 treesize of output 404 [2022-11-16 20:28:03,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 501 treesize of output 497 [2022-11-16 20:28:03,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 545 treesize of output 537 [2022-11-16 20:28:04,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:28:04,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:28:04,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:28:04,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2022-11-16 20:28:04,200 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 20:28:04,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 1 [2022-11-16 20:28:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:28:04,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707977164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:28:04,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1285570822] [2022-11-16 20:28:04,400 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-16 20:28:04,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:28:04,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-11-16 20:28:04,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653892544] [2022-11-16 20:28:04,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:28:04,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-16 20:28:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:28:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-16 20:28:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1580, Unknown=46, NotChecked=0, Total=1892 [2022-11-16 20:28:04,404 INFO L87 Difference]: Start difference. First operand 727 states and 2468 transitions. Second operand has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:29:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:29:31,891 INFO L93 Difference]: Finished difference Result 4141 states and 13989 transitions. [2022-11-16 20:29:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-11-16 20:29:31,891 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 20:29:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:29:31,901 INFO L225 Difference]: With dead ends: 4141 [2022-11-16 20:29:31,901 INFO L226 Difference]: Without dead ends: 2755 [2022-11-16 20:29:31,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 76 SyntacticMatches, 21 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6243 ImplicationChecksByTransitivity, 104.9s TimeCoverageRelationStatistics Valid=2314, Invalid=14649, Unknown=67, NotChecked=0, Total=17030 [2022-11-16 20:29:31,906 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 912 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2802 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:29:31,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 54 Invalid, 5206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2348 Invalid, 0 Unknown, 2802 Unchecked, 2.2s Time] [2022-11-16 20:29:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2022-11-16 20:29:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1224. [2022-11-16 20:29:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1223 states have (on average 3.4039247751430906) internal successors, (4163), 1223 states have internal predecessors, (4163), 0 states have call successors, (0), 0 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-16 20:29:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 4163 transitions. [2022-11-16 20:29:31,958 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 4163 transitions. Word has length 35 [2022-11-16 20:29:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:29:31,958 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 4163 transitions. [2022-11-16 20:29:31,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:29:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 4163 transitions. [2022-11-16 20:29:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 20:29:31,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:29:31,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:29:31,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 20:29:32,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:29:32,169 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 20:29:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:29:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1280388401, now seen corresponding path program 17 times [2022-11-16 20:29:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:29:32,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002325472] [2022-11-16 20:29:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:29:32,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:29:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:29:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:29:33,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:29:33,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002325472] [2022-11-16 20:29:33,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002325472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:29:33,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230534016] [2022-11-16 20:29:33,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:29:33,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:29:33,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:29:33,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:29:33,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 20:29:34,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 20:29:34,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:29:34,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 20:29:34,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:29:34,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:34,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:34,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-11-16 20:29:34,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:34,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-16 20:29:34,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:34,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-16 20:29:34,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-16 20:29:35,079 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-16 20:29:35,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-16 20:29:35,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:35,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 20:29:35,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 20:29:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:29:35,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:29:40,415 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_113| Int) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1227 Int)) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1223) c_~A~0.base))) (let ((.cse1 (select (store (store .cse2 c_~A~0.offset v_ArrVal_1225) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_113| 4)) v_ArrVal_1227) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse1)) (not (<= (select .cse2 c_~A~0.offset) (+ v_ArrVal_1225 1))) (< 2147483646 .cse1) (not (<= 1 |v_thread3Thread1of1ForFork3_~i~2#1_113|))))))) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_113| Int)) (or (not (<= 1 |v_thread3Thread1of1ForFork3_~i~2#1_113|)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1225 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1223) c_~A~0.base))) (or (forall ((v_ArrVal_1227 Int)) (let ((.cse4 (select (store (store .cse5 c_~A~0.offset v_ArrVal_1225) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_113| 4)) v_ArrVal_1227) c_~A~0.offset))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse3 (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse3) (< .cse3 (+ 2 .cse4))))) (< 2147483646 .cse4)))) (not (<= (select .cse5 c_~A~0.offset) (+ v_ArrVal_1225 1)))))))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-11-16 20:29:40,588 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse0 (< c_~min~0 .cse1))) (and (or .cse0 (and (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_113| Int)) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1225 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1223) c_~A~0.base))) (or (forall ((v_ArrVal_1227 Int)) (let ((.cse3 (select (store (store .cse5 c_~A~0.offset v_ArrVal_1225) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_113| 4)) v_ArrVal_1227) c_~A~0.offset))) (or (forall ((v_subst_3 Int)) (let ((.cse2 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< .cse1 .cse2) (< .cse2 (+ 2 .cse3))))) (< 2147483646 .cse3)))) (not (<= (select .cse5 c_~A~0.offset) (+ v_ArrVal_1225 1)))))) (not (<= 1 |v_thread3Thread1of1ForFork3_~i~2#1_113|)))) (or (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_113| Int) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1227 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1223) c_~A~0.base))) (let ((.cse6 (select (store (store .cse7 c_~A~0.offset v_ArrVal_1225) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_113| 4)) v_ArrVal_1227) c_~A~0.offset))) (or (< .cse1 (+ 2 .cse6)) (not (<= (select .cse7 c_~A~0.offset) (+ v_ArrVal_1225 1))) (< 2147483646 .cse6) (not (<= 1 |v_thread3Thread1of1ForFork3_~i~2#1_113|)))))) (forall ((v_subst_4 Int)) (not (< .cse1 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_4))))))))) (or (not .cse0) (and (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select .cse4 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_113| Int) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1227 Int)) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1223) c_~A~0.base))) (let ((.cse8 (select (store (store .cse9 c_~A~0.offset v_ArrVal_1225) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_113| 4)) v_ArrVal_1227) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse8)) (not (<= (select .cse9 c_~A~0.offset) (+ v_ArrVal_1225 1))) (< 2147483646 .cse8) (not (<= 1 |v_thread3Thread1of1ForFork3_~i~2#1_113|))))))) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_113| Int)) (or (not (<= 1 |v_thread3Thread1of1ForFork3_~i~2#1_113|)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1225 Int)) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1223) c_~A~0.base))) (or (forall ((v_ArrVal_1227 Int)) (let ((.cse11 (select (store (store .cse12 c_~A~0.offset v_ArrVal_1225) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_113| 4)) v_ArrVal_1227) c_~A~0.offset))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse10 (select .cse4 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse10) (< .cse10 (+ 2 .cse11))))) (< 2147483646 .cse11)))) (not (<= (select .cse12 c_~A~0.offset) (+ v_ArrVal_1225 1)))))))))))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-11-16 20:29:47,526 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 88 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:29:47,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 614 treesize of output 588 [2022-11-16 20:29:47,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:47,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 481 treesize of output 473 [2022-11-16 20:29:47,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:47,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 273 [2022-11-16 20:29:47,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:47,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 395 [2022-11-16 20:29:47,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:29:47,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 378 treesize of output 324 [2022-11-16 20:29:47,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:47,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:47,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:47,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2022-11-16 20:29:47,848 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 20:29:47,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 1 [2022-11-16 20:29:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2022-11-16 20:29:47,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230534016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:29:47,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [488634222] [2022-11-16 20:29:47,966 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-16 20:29:47,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:29:47,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 46 [2022-11-16 20:29:47,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254257773] [2022-11-16 20:29:47,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:29:47,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 20:29:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:29:47,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 20:29:47,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1799, Unknown=34, NotChecked=178, Total=2256 [2022-11-16 20:29:47,970 INFO L87 Difference]: Start difference. First operand 1224 states and 4163 transitions. Second operand has 48 states, 47 states have (on average 2.148936170212766) internal successors, (101), 47 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:30:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:30:11,861 INFO L93 Difference]: Finished difference Result 4522 states and 16487 transitions. [2022-11-16 20:30:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-11-16 20:30:11,862 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.148936170212766) internal successors, (101), 47 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 20:30:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:30:11,875 INFO L225 Difference]: With dead ends: 4522 [2022-11-16 20:30:11,875 INFO L226 Difference]: Without dead ends: 4337 [2022-11-16 20:30:11,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 76 SyntacticMatches, 53 SemanticMatches, 189 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15166 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=6277, Invalid=29228, Unknown=35, NotChecked=750, Total=36290 [2022-11-16 20:30:11,880 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1188 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2466 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-16 20:30:11,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 49 Invalid, 5335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2646 Invalid, 0 Unknown, 2466 Unchecked, 2.9s Time] [2022-11-16 20:30:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2022-11-16 20:30:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 1248. [2022-11-16 20:30:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 3.3825180433039295) internal successors, (4218), 1247 states have internal predecessors, (4218), 0 states have call successors, (0), 0 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-16 20:30:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 4218 transitions. [2022-11-16 20:30:11,947 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 4218 transitions. Word has length 35 [2022-11-16 20:30:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:30:11,948 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 4218 transitions. [2022-11-16 20:30:11,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.148936170212766) internal successors, (101), 47 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:30:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 4218 transitions. [2022-11-16 20:30:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 20:30:11,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:30:11,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:30:11,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 20:30:12,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:30:12,158 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 20:30:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:30:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash 914493763, now seen corresponding path program 18 times [2022-11-16 20:30:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:30:12,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407679624] [2022-11-16 20:30:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:30:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:30:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:30:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:30:13,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:30:13,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407679624] [2022-11-16 20:30:13,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407679624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:30:13,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987307566] [2022-11-16 20:30:13,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:30:13,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:30:13,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:30:13,227 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:30:13,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 20:30:13,462 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:30:13,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:30:13,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 20:30:13,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:30:13,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:13,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-11-16 20:30:14,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:14,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-11-16 20:30:14,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:14,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-11-16 20:30:14,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:14,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:30:14,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 38 [2022-11-16 20:30:14,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:14,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:30:14,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 36 [2022-11-16 20:30:14,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 20:30:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:30:14,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:30:15,067 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1302 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1302) c_~A~0.base) c_~A~0.offset))) (or (< 2147483647 .cse0) (< c_~min~0 (+ .cse0 1))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-11-16 20:30:16,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:30:16,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1224 treesize of output 990 [2022-11-16 20:30:16,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 987 treesize of output 955 [2022-11-16 20:30:16,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 955 treesize of output 891 [2022-11-16 20:30:16,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 891 treesize of output 875 [2022-11-16 20:30:16,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:16,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:16,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:30:16,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987307566] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:30:16,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [738408913] [2022-11-16 20:30:16,985 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-16 20:30:16,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:30:16,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 43 [2022-11-16 20:30:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775879169] [2022-11-16 20:30:16,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:30:16,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 20:30:16,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:30:16,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 20:30:16,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1631, Unknown=41, NotChecked=84, Total=1980 [2022-11-16 20:30:16,988 INFO L87 Difference]: Start difference. First operand 1248 states and 4218 transitions. Second operand has 45 states, 44 states have (on average 2.272727272727273) internal successors, (100), 44 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:30:38,581 WARN L233 SmtUtils]: Spent 18.22s on a formula simplification. DAG size of input: 61 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:30:57,144 WARN L233 SmtUtils]: Spent 16.23s on a formula simplification. DAG size of input: 64 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:31:14,461 WARN L233 SmtUtils]: Spent 16.23s on a formula simplification. DAG size of input: 67 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:31:25,718 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 68 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:31:36,859 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 69 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:31:53,161 WARN L233 SmtUtils]: Spent 16.23s on a formula simplification. DAG size of input: 66 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:31:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:31:54,378 INFO L93 Difference]: Finished difference Result 9036 states and 31925 transitions. [2022-11-16 20:31:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-16 20:31:54,379 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.272727272727273) internal successors, (100), 44 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 20:31:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:31:54,398 INFO L225 Difference]: With dead ends: 9036 [2022-11-16 20:31:54,398 INFO L226 Difference]: Without dead ends: 7647 [2022-11-16 20:31:54,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 61 SyntacticMatches, 11 SemanticMatches, 127 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5195 ImplicationChecksByTransitivity, 95.6s TimeCoverageRelationStatistics Valid=2599, Invalid=13619, Unknown=42, NotChecked=252, Total=16512 [2022-11-16 20:31:54,401 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1083 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2986 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 6742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3618 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:31:54,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 86 Invalid, 6742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2986 Invalid, 0 Unknown, 3618 Unchecked, 3.3s Time] [2022-11-16 20:31:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7647 states. [2022-11-16 20:31:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7647 to 2084. [2022-11-16 20:31:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 2083 states have (on average 3.312530004800768) internal successors, (6900), 2083 states have internal predecessors, (6900), 0 states have call successors, (0), 0 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-16 20:31:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 6900 transitions. [2022-11-16 20:31:54,510 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 6900 transitions. Word has length 35 [2022-11-16 20:31:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:31:54,510 INFO L495 AbstractCegarLoop]: Abstraction has 2084 states and 6900 transitions. [2022-11-16 20:31:54,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.272727272727273) internal successors, (100), 44 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:31:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 6900 transitions. [2022-11-16 20:31:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 20:31:54,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:31:54,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:31:54,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 20:31:54,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:31:54,728 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 20:31:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:31:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash -209506453, now seen corresponding path program 19 times [2022-11-16 20:31:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:31:54,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908134444] [2022-11-16 20:31:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:31:54,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:31:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:31:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:31:56,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:31:56,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908134444] [2022-11-16 20:31:56,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908134444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:31:56,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194853529] [2022-11-16 20:31:56,435 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:31:56,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:31:56,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:31:56,436 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:31:56,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 20:31:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:31:56,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 20:31:56,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:31:57,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:57,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-11-16 20:31:57,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:57,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-11-16 20:31:57,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:57,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-11-16 20:31:57,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:57,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:31:57,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:31:57,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2022-11-16 20:31:57,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:57,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:31:57,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 35 [2022-11-16 20:31:57,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:31:57,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 22 [2022-11-16 20:31:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:31:57,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:31:59,131 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1381) c_~A~0.base) (+ c_~A~0.offset 4)))) (or (< c_~min~0 (+ .cse0 1)) (< 2147483647 .cse0)))) is different from false [2022-11-16 20:32:00,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:32:00,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 263 [2022-11-16 20:32:00,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 227 [2022-11-16 20:32:00,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 211 [2022-11-16 20:32:00,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2022-11-16 20:32:00,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:32:00,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:32:00,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:32:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 3 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:32:00,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194853529] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:32:00,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [642257093] [2022-11-16 20:32:00,595 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-16 20:32:00,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:32:00,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 17] total 47 [2022-11-16 20:32:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398973015] [2022-11-16 20:32:00,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:32:00,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-16 20:32:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:32:00,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 20:32:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1948, Unknown=50, NotChecked=92, Total=2352 [2022-11-16 20:32:00,599 INFO L87 Difference]: Start difference. First operand 2084 states and 6900 transitions. Second operand has 49 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 48 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:32:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:32:44,737 INFO L93 Difference]: Finished difference Result 11348 states and 40059 transitions. [2022-11-16 20:32:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-11-16 20:32:44,738 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 48 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 20:32:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:32:44,749 INFO L225 Difference]: With dead ends: 11348 [2022-11-16 20:32:44,749 INFO L226 Difference]: Without dead ends: 5139 [2022-11-16 20:32:44,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 62 SyntacticMatches, 107 SemanticMatches, 201 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23779 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=7201, Invalid=33355, Unknown=50, NotChecked=400, Total=41006 [2022-11-16 20:32:44,751 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2532 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6495 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2532 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 9757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 6495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3014 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:32:44,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2532 Valid, 78 Invalid, 9757 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [248 Valid, 6495 Invalid, 0 Unknown, 3014 Unchecked, 7.2s Time] [2022-11-16 20:32:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2022-11-16 20:32:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 1610. [2022-11-16 20:32:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 3.3735239279055316) internal successors, (5428), 1609 states have internal predecessors, (5428), 0 states have call successors, (0), 0 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-16 20:32:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 5428 transitions. [2022-11-16 20:32:44,839 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 5428 transitions. Word has length 35 [2022-11-16 20:32:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:32:44,840 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 5428 transitions. [2022-11-16 20:32:44,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 48 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:32:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 5428 transitions. [2022-11-16 20:32:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 20:32:44,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:32:44,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:32:44,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-16 20:32:45,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 20:32:45,051 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 20:32:45,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:32:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1702322083, now seen corresponding path program 20 times [2022-11-16 20:32:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:32:45,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43191900] [2022-11-16 20:32:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:32:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:32:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:32:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 20:32:45,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:32:45,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43191900] [2022-11-16 20:32:45,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43191900] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:32:45,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534762759] [2022-11-16 20:32:45,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:32:45,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:32:45,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:32:45,959 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:32:45,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 20:32:46,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 20:32:46,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:32:46,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 20:32:46,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:32:46,703 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-16 20:32:46,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-16 20:32:46,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:32:46,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 20:32:46,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 20:32:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:32:46,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:32:57,322 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:33:29,775 WARN L233 SmtUtils]: Spent 22.24s on a formula simplification. DAG size of input: 78 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:33:52,047 WARN L233 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:33:52,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2022-11-16 20:33:52,106 INFO L321 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2022-11-16 20:33:52,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 338 treesize of output 295 [2022-11-16 20:33:52,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2022-11-16 20:33:52,249 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-16 20:33:52,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 141 treesize of output 1 [2022-11-16 20:34:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:34:00,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534762759] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:34:00,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [331754481] [2022-11-16 20:34:00,289 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-16 20:34:00,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:34:00,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2022-11-16 20:34:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270613853] [2022-11-16 20:34:00,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:34:00,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 20:34:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:34:00,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 20:34:00,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=510, Unknown=16, NotChecked=0, Total=650 [2022-11-16 20:34:00,292 INFO L87 Difference]: Start difference. First operand 1610 states and 5428 transitions. Second operand has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-16 20:34:32,807 WARN L233 SmtUtils]: Spent 16.15s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:35:04,994 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:35:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:29,777 INFO L93 Difference]: Finished difference Result 2754 states and 9513 transitions. [2022-11-16 20:35:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 20:35:29,778 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 20:35:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:29,781 INFO L225 Difference]: With dead ends: 2754 [2022-11-16 20:35:29,781 INFO L226 Difference]: Without dead ends: 1974 [2022-11-16 20:35:29,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 162.0s TimeCoverageRelationStatistics Valid=357, Invalid=1577, Unknown=46, NotChecked=0, Total=1980 [2022-11-16 20:35:29,782 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 171 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:29,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 5 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 491 Invalid, 0 Unknown, 209 Unchecked, 0.4s Time] [2022-11-16 20:35:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2022-11-16 20:35:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1814. [2022-11-16 20:35:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 3.3331494760066187) internal successors, (6043), 1813 states have internal predecessors, (6043), 0 states have call successors, (0), 0 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-16 20:35:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 6043 transitions. [2022-11-16 20:35:29,818 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 6043 transitions. Word has length 35 [2022-11-16 20:35:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:29,819 INFO L495 AbstractCegarLoop]: Abstraction has 1814 states and 6043 transitions. [2022-11-16 20:35:29,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-16 20:35:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 6043 transitions. [2022-11-16 20:35:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 20:35:29,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:29,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:35:29,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 20:35:30,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 20:35:30,029 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 20:35:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1269449059, now seen corresponding path program 21 times [2022-11-16 20:35:30,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:30,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840663874] [2022-11-16 20:35:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:35:30,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:30,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840663874] [2022-11-16 20:35:30,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840663874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:35:30,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588222760] [2022-11-16 20:35:30,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:35:30,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:35:30,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:35:30,723 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:35:30,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0033a5d-90fa-4f16-9b11-c2967198c366/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 20:35:30,964 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:35:30,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:35:30,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 20:35:30,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:35:31,345 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-16 20:35:31,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-16 20:35:31,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:35:31,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 20:35:31,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 20:35:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:35:31,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:36:22,980 WARN L233 SmtUtils]: Spent 30.24s on a formula simplification. DAG size of input: 84 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:36:39,368 WARN L233 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:36:39,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2022-11-16 20:36:39,431 INFO L321 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-11-16 20:36:39,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 287 treesize of output 279 [2022-11-16 20:36:39,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2022-11-16 20:36:39,503 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-16 20:36:39,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 166 treesize of output 1 [2022-11-16 20:36:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:36:41,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588222760] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:36:41,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [867083660] [2022-11-16 20:36:41,568 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-16 20:36:41,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:36:41,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 34 [2022-11-16 20:36:41,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511790197] [2022-11-16 20:36:41,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:36:41,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-16 20:36:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:36:41,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-16 20:36:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1014, Unknown=11, NotChecked=0, Total=1190 [2022-11-16 20:36:41,570 INFO L87 Difference]: Start difference. First operand 1814 states and 6043 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:37:08,970 WARN L233 SmtUtils]: Spent 16.53s on a formula simplification. DAG size of input: 99 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)