./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack_longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack_longest-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW --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 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 --- 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-4e7fbc6 [2022-11-23 13:45:14,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:45:14,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:45:14,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:45:14,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:45:14,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:45:14,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:45:14,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:45:14,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:45:14,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:45:14,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:45:14,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:45:14,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:45:14,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:45:14,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:45:14,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:45:14,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:45:14,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:45:14,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:45:14,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:45:14,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:45:14,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:45:14,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:45:14,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:45:14,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:45:14,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:45:14,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:45:14,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:45:14,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:45:14,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:45:14,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:45:14,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:45:14,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:45:14,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:45:14,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:45:14,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:45:14,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:45:14,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:45:14,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:45:14,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:45:14,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:45:14,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 13:45:14,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:45:14,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:45:14,392 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:45:14,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:45:14,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:45:14,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:45:14,393 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:45:14,394 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:45:14,394 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:45:14,394 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:45:14,395 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:45:14,395 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:45:14,395 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:45:14,396 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:45:14,396 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:45:14,396 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:45:14,396 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:45:14,396 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:45:14,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:45:14,397 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:45:14,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:45:14,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:45:14,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:45:14,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 13:45:14,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:45:14,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 13:45:14,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:45:14,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 13:45:14,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:45:14,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 13:45:14,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:45:14,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:45:14,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:45:14,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:45:14,401 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:45:14,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:45:14,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 13:45:14,401 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:45:14,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:45:14,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 13:45:14,402 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:45:14,404 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_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/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_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW 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 -> 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 [2022-11-23 13:45:14,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:45:14,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:45:14,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:45:14,762 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:45:14,763 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:45:14,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread/stack_longest-2.i [2022-11-23 13:45:17,896 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:45:18,314 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:45:18,315 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/sv-benchmarks/c/pthread/stack_longest-2.i [2022-11-23 13:45:18,334 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/data/1ba27b27e/17a82a42142442e5936abcf9d7bdb241/FLAG27ee3c082 [2022-11-23 13:45:18,353 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/data/1ba27b27e/17a82a42142442e5936abcf9d7bdb241 [2022-11-23 13:45:18,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:45:18,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:45:18,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:45:18,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:45:18,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:45:18,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:45:18" (1/1) ... [2022-11-23 13:45:18,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d91bb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:18, skipping insertion in model container [2022-11-23 13:45:18,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:45:18" (1/1) ... [2022-11-23 13:45:18,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:45:18,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:45:18,969 WARN L237 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_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/sv-benchmarks/c/pthread/stack_longest-2.i[41530,41543] [2022-11-23 13:45:18,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:45:19,007 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:45:19,059 WARN L237 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_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/sv-benchmarks/c/pthread/stack_longest-2.i[41530,41543] [2022-11-23 13:45:19,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:45:19,122 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:45:19,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19 WrapperNode [2022-11-23 13:45:19,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:45:19,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:45:19,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:45:19,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:45:19,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,188 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-11-23 13:45:19,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:45:19,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:45:19,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:45:19,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:45:19,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,214 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:45:19,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:45:19,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:45:19,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:45:19,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (1/1) ... [2022-11-23 13:45:19,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:45:19,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:45:19,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:45:19,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:45:19,300 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-23 13:45:19,300 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-23 13:45:19,300 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-23 13:45:19,301 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-23 13:45:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:45:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:45:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 13:45:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 13:45:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-23 13:45:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:45:19,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:45:19,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:45:19,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:45:19,303 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 13:45:19,508 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:45:19,510 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:45:19,824 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:45:19,833 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:45:19,833 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 13:45:19,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:45:19 BoogieIcfgContainer [2022-11-23 13:45:19,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:45:19,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:45:19,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:45:19,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:45:19,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:45:18" (1/3) ... [2022-11-23 13:45:19,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b29578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:45:19, skipping insertion in model container [2022-11-23 13:45:19,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:19" (2/3) ... [2022-11-23 13:45:19,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b29578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:45:19, skipping insertion in model container [2022-11-23 13:45:19,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:45:19" (3/3) ... [2022-11-23 13:45:19,845 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-11-23 13:45:19,854 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 13:45:19,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:45:19,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 13:45:19,866 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:45:20,001 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 13:45:20,039 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:45:20,053 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 170 transitions, 356 flow [2022-11-23 13:45:20,056 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 170 transitions, 356 flow [2022-11-23 13:45:20,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 170 transitions, 356 flow [2022-11-23 13:45:20,189 INFO L130 PetriNetUnfolder]: 10/168 cut-off events. [2022-11-23 13:45:20,189 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 13:45:20,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 10/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 408 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2022-11-23 13:45:20,212 INFO L119 LiptonReduction]: Number of co-enabled transitions 8324 [2022-11-23 13:45:24,937 INFO L134 LiptonReduction]: Checked pairs total: 10718 [2022-11-23 13:45:24,937 INFO L136 LiptonReduction]: Total number of compositions: 158 [2022-11-23 13:45:24,948 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 36 transitions, 88 flow [2022-11-23 13:45:25,015 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 0 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-23 13:45:25,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:45:25,046 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;@69839c8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:45:25,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 13:45:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 0 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-23 13:45:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 13:45:25,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:25,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 13:45:25,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1033172424, now seen corresponding path program 1 times [2022-11-23 13:45:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:25,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888181663] [2022-11-23 13:45:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:25,445 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-23 13:45:25,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:25,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888181663] [2022-11-23 13:45:25,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888181663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:45:25,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:45:25,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:45:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129718459] [2022-11-23 13:45:25,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:45:25,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:45:25,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:25,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:45:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:45:25,485 INFO L87 Difference]: Start difference. First operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-23 13:45:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:25,617 INFO L93 Difference]: Finished difference Result 414 states and 1064 transitions. [2022-11-23 13:45:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:45:25,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-23 13:45:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:25,633 INFO L225 Difference]: With dead ends: 414 [2022-11-23 13:45:25,633 INFO L226 Difference]: Without dead ends: 396 [2022-11-23 13:45:25,634 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-23 13:45:25,637 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:25,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:45:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-23 13:45:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 372. [2022-11-23 13:45:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 369 states have (on average 2.6856368563685638) internal successors, (991), 371 states have internal predecessors, (991), 0 states have call successors, (0), 0 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-23 13:45:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 991 transitions. [2022-11-23 13:45:25,698 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 991 transitions. Word has length 6 [2022-11-23 13:45:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:25,698 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 991 transitions. [2022-11-23 13:45:25,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-23 13:45:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 991 transitions. [2022-11-23 13:45:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 13:45:25,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:25,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:25,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:45:25,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -521452384, now seen corresponding path program 1 times [2022-11-23 13:45:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:25,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700852066] [2022-11-23 13:45:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:25,794 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-23 13:45:25,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700852066] [2022-11-23 13:45:25,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700852066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:45:25,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:45:25,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:45:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130565901] [2022-11-23 13:45:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:45:25,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:45:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:45:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:45:25,797 INFO L87 Difference]: Start difference. First operand 372 states and 991 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:25,868 INFO L93 Difference]: Finished difference Result 410 states and 1089 transitions. [2022-11-23 13:45:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:45:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 13:45:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:25,872 INFO L225 Difference]: With dead ends: 410 [2022-11-23 13:45:25,872 INFO L226 Difference]: Without dead ends: 410 [2022-11-23 13:45:25,872 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-23 13:45:25,874 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:25,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:45:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-23 13:45:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-11-23 13:45:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 407 states have (on average 2.675675675675676) internal successors, (1089), 409 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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-23 13:45:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1089 transitions. [2022-11-23 13:45:25,903 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1089 transitions. Word has length 10 [2022-11-23 13:45:25,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:25,904 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 1089 transitions. [2022-11-23 13:45:25,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1089 transitions. [2022-11-23 13:45:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:45:25,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:25,905 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:25,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:45:25,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash 310677680, now seen corresponding path program 1 times [2022-11-23 13:45:25,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:25,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817982623] [2022-11-23 13:45:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:26,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:26,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817982623] [2022-11-23 13:45:26,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817982623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:45:26,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240022158] [2022-11-23 13:45:26,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:26,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:26,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:45:26,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:45:26,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 13:45:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:26,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 13:45:26,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:45:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:26,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:45:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:26,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240022158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:45:26,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [593579318] [2022-11-23 13:45:26,392 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-23 13:45:26,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:45:26,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-23 13:45:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716008145] [2022-11-23 13:45:26,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:45:26,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 13:45:26,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 13:45:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:45:26,407 INFO L87 Difference]: Start difference. First operand 410 states and 1089 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-23 13:45:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:26,896 INFO L93 Difference]: Finished difference Result 998 states and 2565 transitions. [2022-11-23 13:45:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:45:26,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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 13 [2022-11-23 13:45:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:26,903 INFO L225 Difference]: With dead ends: 998 [2022-11-23 13:45:26,903 INFO L226 Difference]: Without dead ends: 986 [2022-11-23 13:45:26,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-11-23 13:45:26,905 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:26,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:45:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-11-23 13:45:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 678. [2022-11-23 13:45:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 675 states have (on average 2.6977777777777776) internal successors, (1821), 677 states have internal predecessors, (1821), 0 states have call successors, (0), 0 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-23 13:45:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1821 transitions. [2022-11-23 13:45:26,966 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1821 transitions. Word has length 13 [2022-11-23 13:45:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:26,967 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1821 transitions. [2022-11-23 13:45:26,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-23 13:45:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1821 transitions. [2022-11-23 13:45:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 13:45:26,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:26,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:26,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 13:45:27,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:27,170 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:27,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1690454114, now seen corresponding path program 1 times [2022-11-23 13:45:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:27,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397680815] [2022-11-23 13:45:27,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:27,297 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-23 13:45:27,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:27,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397680815] [2022-11-23 13:45:27,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397680815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:45:27,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:45:27,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:45:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615551783] [2022-11-23 13:45:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:45:27,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:45:27,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:27,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:45:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:45:27,301 INFO L87 Difference]: Start difference. First operand 678 states and 1821 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-23 13:45:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:27,367 INFO L93 Difference]: Finished difference Result 300 states and 681 transitions. [2022-11-23 13:45:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:45:27,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-23 13:45:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:27,370 INFO L225 Difference]: With dead ends: 300 [2022-11-23 13:45:27,370 INFO L226 Difference]: Without dead ends: 300 [2022-11-23 13:45:27,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:45:27,372 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:27,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:45:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-23 13:45:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2022-11-23 13:45:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.25) internal successors, (630), 281 states have internal predecessors, (630), 0 states have call successors, (0), 0 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-23 13:45:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 630 transitions. [2022-11-23 13:45:27,383 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 630 transitions. Word has length 16 [2022-11-23 13:45:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:27,384 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 630 transitions. [2022-11-23 13:45:27,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-23 13:45:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 630 transitions. [2022-11-23 13:45:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 13:45:27,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:27,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:27,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 13:45:27,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:27,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1060230643, now seen corresponding path program 1 times [2022-11-23 13:45:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:27,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224043673] [2022-11-23 13:45:27,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:27,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:27,433 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-23 13:45:27,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:27,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224043673] [2022-11-23 13:45:27,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224043673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:45:27,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:45:27,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:45:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243249186] [2022-11-23 13:45:27,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:45:27,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:45:27,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:45:27,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:45:27,436 INFO L87 Difference]: Start difference. First operand 282 states and 630 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:27,523 INFO L93 Difference]: Finished difference Result 340 states and 756 transitions. [2022-11-23 13:45:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:45:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 13:45:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:27,526 INFO L225 Difference]: With dead ends: 340 [2022-11-23 13:45:27,526 INFO L226 Difference]: Without dead ends: 340 [2022-11-23 13:45:27,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:45:27,528 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:27,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:45:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-23 13:45:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 284. [2022-11-23 13:45:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 282 states have (on average 2.2588652482269502) internal successors, (637), 283 states have internal predecessors, (637), 0 states have call successors, (0), 0 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-23 13:45:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 637 transitions. [2022-11-23 13:45:27,547 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 637 transitions. Word has length 17 [2022-11-23 13:45:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:27,548 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 637 transitions. [2022-11-23 13:45:27,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 637 transitions. [2022-11-23 13:45:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 13:45:27,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:27,552 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] [2022-11-23 13:45:27,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 13:45:27,553 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:27,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1312516165, now seen corresponding path program 1 times [2022-11-23 13:45:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:27,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522153769] [2022-11-23 13:45:27,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:28,473 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-23 13:45:28,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522153769] [2022-11-23 13:45:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522153769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:45:28,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:45:28,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 13:45:28,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085696317] [2022-11-23 13:45:28,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:45:28,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 13:45:28,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:28,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 13:45:28,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:45:28,481 INFO L87 Difference]: Start difference. First operand 284 states and 637 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:29,182 INFO L93 Difference]: Finished difference Result 489 states and 1074 transitions. [2022-11-23 13:45:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:45:29,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 13:45:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:29,185 INFO L225 Difference]: With dead ends: 489 [2022-11-23 13:45:29,185 INFO L226 Difference]: Without dead ends: 440 [2022-11-23 13:45:29,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:45:29,186 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 102 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:29,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 21 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:45:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-11-23 13:45:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 340. [2022-11-23 13:45:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 338 states have (on average 2.275147928994083) internal successors, (769), 339 states have internal predecessors, (769), 0 states have call successors, (0), 0 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-23 13:45:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 769 transitions. [2022-11-23 13:45:29,204 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 769 transitions. Word has length 21 [2022-11-23 13:45:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:29,205 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 769 transitions. [2022-11-23 13:45:29,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 769 transitions. [2022-11-23 13:45:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 13:45:29,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:29,207 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] [2022-11-23 13:45:29,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 13:45:29,207 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1075003249, now seen corresponding path program 2 times [2022-11-23 13:45:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:29,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439802064] [2022-11-23 13:45:29,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:29,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:30,013 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-23 13:45:30,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:30,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439802064] [2022-11-23 13:45:30,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439802064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:45:30,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:45:30,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 13:45:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907100685] [2022-11-23 13:45:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:45:30,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 13:45:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 13:45:30,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:45:30,015 INFO L87 Difference]: Start difference. First operand 340 states and 769 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:30,721 INFO L93 Difference]: Finished difference Result 516 states and 1134 transitions. [2022-11-23 13:45:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:45:30,721 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 13:45:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:30,724 INFO L225 Difference]: With dead ends: 516 [2022-11-23 13:45:30,724 INFO L226 Difference]: Without dead ends: 466 [2022-11-23 13:45:30,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:45:30,725 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 118 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:30,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 23 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:45:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-23 13:45:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 328. [2022-11-23 13:45:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 326 states have (on average 2.2607361963190185) internal successors, (737), 327 states have internal predecessors, (737), 0 states have call successors, (0), 0 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-23 13:45:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 737 transitions. [2022-11-23 13:45:30,754 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 737 transitions. Word has length 21 [2022-11-23 13:45:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:30,754 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 737 transitions. [2022-11-23 13:45:30,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 737 transitions. [2022-11-23 13:45:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 13:45:30,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:30,756 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] [2022-11-23 13:45:30,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 13:45:30,756 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash 214505450, now seen corresponding path program 1 times [2022-11-23 13:45:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:30,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701798998] [2022-11-23 13:45:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:30,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:30,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701798998] [2022-11-23 13:45:30,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701798998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:45:30,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918227677] [2022-11-23 13:45:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:30,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:30,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:45:30,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:45:30,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 13:45:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:31,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:45:31,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:45:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 13:45:31,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:45:31,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918227677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:45:31,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:45:31,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-23 13:45:31,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756318454] [2022-11-23 13:45:31,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:45:31,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:45:31,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:31,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:45:31,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:45:31,085 INFO L87 Difference]: Start difference. First operand 328 states and 737 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:31,244 INFO L93 Difference]: Finished difference Result 438 states and 953 transitions. [2022-11-23 13:45:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:45:31,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 13:45:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:31,247 INFO L225 Difference]: With dead ends: 438 [2022-11-23 13:45:31,247 INFO L226 Difference]: Without dead ends: 430 [2022-11-23 13:45:31,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:45:31,249 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:31,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:45:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-23 13:45:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 380. [2022-11-23 13:45:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 378 states have (on average 2.240740740740741) internal successors, (847), 379 states have internal predecessors, (847), 0 states have call successors, (0), 0 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-23 13:45:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 847 transitions. [2022-11-23 13:45:31,265 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 847 transitions. Word has length 24 [2022-11-23 13:45:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:31,266 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 847 transitions. [2022-11-23 13:45:31,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 847 transitions. [2022-11-23 13:45:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:45:31,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:31,268 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-11-23 13:45:31,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 13:45:31,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:31,475 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:31,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1546004400, now seen corresponding path program 2 times [2022-11-23 13:45:31,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:31,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151190084] [2022-11-23 13:45:31,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:31,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:31,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:31,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151190084] [2022-11-23 13:45:31,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151190084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:45:31,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366120213] [2022-11-23 13:45:31,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:45:31,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:31,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:45:31,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:45:31,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 13:45:31,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 13:45:31,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:45:31,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:45:31,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:45:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:32,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:45:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:32,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366120213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:45:32,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933008002] [2022-11-23 13:45:32,143 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:45:32,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:45:32,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2022-11-23 13:45:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361466890] [2022-11-23 13:45:32,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:45:32,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:45:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:32,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:45:32,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:45:32,149 INFO L87 Difference]: Start difference. First operand 380 states and 847 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:32,620 INFO L93 Difference]: Finished difference Result 868 states and 1863 transitions. [2022-11-23 13:45:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:45:32,621 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-23 13:45:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:32,624 INFO L225 Difference]: With dead ends: 868 [2022-11-23 13:45:32,625 INFO L226 Difference]: Without dead ends: 868 [2022-11-23 13:45:32,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:45:32,626 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:32,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 0 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:45:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-11-23 13:45:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 604. [2022-11-23 13:45:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 602 states have (on average 2.250830564784053) internal successors, (1355), 603 states have internal predecessors, (1355), 0 states have call successors, (0), 0 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-23 13:45:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1355 transitions. [2022-11-23 13:45:32,646 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1355 transitions. Word has length 27 [2022-11-23 13:45:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:32,646 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 1355 transitions. [2022-11-23 13:45:32,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1355 transitions. [2022-11-23 13:45:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:45:32,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:32,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:32,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 13:45:32,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 13:45:32,854 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash -102544791, now seen corresponding path program 3 times [2022-11-23 13:45:32,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:32,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058402977] [2022-11-23 13:45:32,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:32,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:45:33,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:33,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058402977] [2022-11-23 13:45:33,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058402977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:45:33,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:45:33,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:45:33,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921005831] [2022-11-23 13:45:33,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:45:33,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 13:45:33,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 13:45:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-23 13:45:33,674 INFO L87 Difference]: Start difference. First operand 604 states and 1355 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 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-23 13:45:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:35,283 INFO L93 Difference]: Finished difference Result 1237 states and 2747 transitions. [2022-11-23 13:45:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 13:45:35,284 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 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-23 13:45:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:35,289 INFO L225 Difference]: With dead ends: 1237 [2022-11-23 13:45:35,289 INFO L226 Difference]: Without dead ends: 1205 [2022-11-23 13:45:35,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 13:45:35,290 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 196 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:35,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 7 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 13:45:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2022-11-23 13:45:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 726. [2022-11-23 13:45:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 724 states have (on average 2.341160220994475) internal successors, (1695), 725 states have internal predecessors, (1695), 0 states have call successors, (0), 0 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-23 13:45:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1695 transitions. [2022-11-23 13:45:35,315 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1695 transitions. Word has length 28 [2022-11-23 13:45:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:35,316 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1695 transitions. [2022-11-23 13:45:35,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 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-23 13:45:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1695 transitions. [2022-11-23 13:45:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:45:35,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:35,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:35,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 13:45:35,320 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:35,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash 825654039, now seen corresponding path program 4 times [2022-11-23 13:45:35,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:35,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125379786] [2022-11-23 13:45:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:45:36,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:36,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125379786] [2022-11-23 13:45:36,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125379786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:45:36,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447211932] [2022-11-23 13:45:36,257 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:45:36,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:36,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:45:36,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:45:36,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 13:45:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:36,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-23 13:45:36,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:45:36,451 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:45:36,452 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 15 treesize of output 15 [2022-11-23 13:45:36,884 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 19 treesize of output 15 [2022-11-23 13:45:37,000 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 56 treesize of output 52 [2022-11-23 13:45:37,629 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 76 treesize of output 44 [2022-11-23 13:45:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:37,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:45:38,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:45:38,304 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 29 treesize of output 30 [2022-11-23 13:45:38,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:45:38,314 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 49 treesize of output 52 [2022-11-23 13:45:38,327 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 28 treesize of output 22 [2022-11-23 13:45:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:45:38,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447211932] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:45:38,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [527219937] [2022-11-23 13:45:38,665 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-23 13:45:38,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:45:38,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 44 [2022-11-23 13:45:38,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913473998] [2022-11-23 13:45:38,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:45:38,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-23 13:45:38,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:38,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-23 13:45:38,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1894, Unknown=7, NotChecked=0, Total=2070 [2022-11-23 13:45:38,668 INFO L87 Difference]: Start difference. First operand 726 states and 1695 transitions. Second operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:47,208 INFO L93 Difference]: Finished difference Result 1303 states and 2889 transitions. [2022-11-23 13:45:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-23 13:45:47,209 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:45:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:47,215 INFO L225 Difference]: With dead ends: 1303 [2022-11-23 13:45:47,215 INFO L226 Difference]: Without dead ends: 1303 [2022-11-23 13:45:47,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2895 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1382, Invalid=9323, Unknown=7, NotChecked=0, Total=10712 [2022-11-23 13:45:47,219 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4569 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:47,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 0 Invalid, 4642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4569 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-23 13:45:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2022-11-23 13:45:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 660. [2022-11-23 13:45:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 658 states have (on average 2.2963525835866263) internal successors, (1511), 659 states have internal predecessors, (1511), 0 states have call successors, (0), 0 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-23 13:45:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1511 transitions. [2022-11-23 13:45:47,245 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1511 transitions. Word has length 28 [2022-11-23 13:45:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:47,245 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 1511 transitions. [2022-11-23 13:45:47,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:45:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1511 transitions. [2022-11-23 13:45:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 13:45:47,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:47,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:47,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 13:45:47,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:47,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:45:47,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 971690586, now seen corresponding path program 1 times [2022-11-23 13:45:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:47,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184698166] [2022-11-23 13:45:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:51,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:51,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184698166] [2022-11-23 13:45:51,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184698166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:45:51,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123083209] [2022-11-23 13:45:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:51,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:51,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:45:51,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:45:51,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 13:45:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:51,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-23 13:45:51,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:45:51,678 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 19 treesize of output 15 [2022-11-23 13:45:52,275 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 69 treesize of output 41 [2022-11-23 13:45:58,760 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-11-23 13:45:58,760 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 112 treesize of output 47 [2022-11-23 13:45:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:45:58,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:46:05,355 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 57 treesize of output 48 [2022-11-23 13:46:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:46:06,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123083209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:46:06,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1162115127] [2022-11-23 13:46:06,001 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-23 13:46:06,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:46:06,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 19] total 63 [2022-11-23 13:46:06,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054543564] [2022-11-23 13:46:06,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:46:06,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-23 13:46:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:46:06,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-23 13:46:06,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=3726, Unknown=3, NotChecked=0, Total=4160 [2022-11-23 13:46:06,004 INFO L87 Difference]: Start difference. First operand 660 states and 1511 transitions. Second operand has 65 states, 64 states have (on average 1.6875) internal successors, (108), 64 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-23 13:47:41,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:47:43,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:47:45,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:47:51,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:48:17,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:48:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:18,186 INFO L93 Difference]: Finished difference Result 2153 states and 4571 transitions. [2022-11-23 13:48:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2022-11-23 13:48:18,187 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.6875) internal successors, (108), 64 states have internal predecessors, (108), 0 states have call successors, (0), 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 36 [2022-11-23 13:48:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:18,195 INFO L225 Difference]: With dead ends: 2153 [2022-11-23 13:48:18,195 INFO L226 Difference]: Without dead ends: 1864 [2022-11-23 13:48:18,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12886 ImplicationChecksByTransitivity, 114.0s TimeCoverageRelationStatistics Valid=5142, Invalid=35858, Unknown=6, NotChecked=0, Total=41006 [2022-11-23 13:48:18,205 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1674 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6202 mSolverCounterSat, 193 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1674 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 6202 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:18,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1674 Valid, 0 Invalid, 6400 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [193 Valid, 6202 Invalid, 5 Unknown, 0 Unchecked, 32.5s Time] [2022-11-23 13:48:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-11-23 13:48:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 927. [2022-11-23 13:48:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 925 states have (on average 2.3005405405405406) internal successors, (2128), 926 states have internal predecessors, (2128), 0 states have call successors, (0), 0 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-23 13:48:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2128 transitions. [2022-11-23 13:48:18,239 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2128 transitions. Word has length 36 [2022-11-23 13:48:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:18,239 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 2128 transitions. [2022-11-23 13:48:18,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.6875) internal successors, (108), 64 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-23 13:48:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2128 transitions. [2022-11-23 13:48:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 13:48:18,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:18,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:48:18,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:18,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:48:18,448 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:48:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1943558000, now seen corresponding path program 2 times [2022-11-23 13:48:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:48:18,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950495940] [2022-11-23 13:48:18,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:48:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:20,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:48:20,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950495940] [2022-11-23 13:48:20,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950495940] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:48:20,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71316473] [2022-11-23 13:48:20,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:48:20,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:48:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:48:20,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:48:20,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 13:48:20,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 13:48:20,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:48:20,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-23 13:48:20,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:20,710 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-23 13:48:20,710 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 29 treesize of output 34 [2022-11-23 13:48:21,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-11-23 13:48:21,136 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 56 treesize of output 52 [2022-11-23 13:48:21,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:48:21,721 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 49 treesize of output 36 [2022-11-23 13:48:22,750 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 76 treesize of output 44 [2022-11-23 13:48:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:22,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:48:24,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:48:24,544 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 29 treesize of output 30 [2022-11-23 13:48:24,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:48:24,554 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 49 treesize of output 52 [2022-11-23 13:48:24,559 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 28 treesize of output 22 [2022-11-23 13:48:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:24,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71316473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:48:24,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1232434509] [2022-11-23 13:48:24,923 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-23 13:48:24,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:48:24,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 19] total 62 [2022-11-23 13:48:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808150271] [2022-11-23 13:48:24,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:48:24,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-23 13:48:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:48:24,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-23 13:48:24,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3745, Unknown=11, NotChecked=0, Total=4032 [2022-11-23 13:48:24,928 INFO L87 Difference]: Start difference. First operand 927 states and 2128 transitions. Second operand has 64 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-23 13:49:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:25,758 INFO L93 Difference]: Finished difference Result 3028 states and 6586 transitions. [2022-11-23 13:49:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-11-23 13:49:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 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 36 [2022-11-23 13:49:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:25,769 INFO L225 Difference]: With dead ends: 3028 [2022-11-23 13:49:25,769 INFO L226 Difference]: Without dead ends: 2894 [2022-11-23 13:49:25,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21232 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=5442, Invalid=54480, Unknown=348, NotChecked=0, Total=60270 [2022-11-23 13:49:25,776 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2053 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9966 mSolverCounterSat, 228 mSolverCounterUnsat, 126 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2053 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 9966 IncrementalHoareTripleChecker+Invalid, 126 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:25,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2053 Valid, 0 Invalid, 10320 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [228 Valid, 9966 Invalid, 126 Unknown, 0 Unchecked, 15.9s Time] [2022-11-23 13:49:25,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2022-11-23 13:49:25,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1071. [2022-11-23 13:49:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1069 states have (on average 2.3985032740879326) internal successors, (2564), 1070 states have internal predecessors, (2564), 0 states have call successors, (0), 0 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-23 13:49:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 2564 transitions. [2022-11-23 13:49:25,841 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 2564 transitions. Word has length 36 [2022-11-23 13:49:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:25,843 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 2564 transitions. [2022-11-23 13:49:25,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-23 13:49:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 2564 transitions. [2022-11-23 13:49:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 13:49:25,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:25,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:25,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-23 13:49:26,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:26,051 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:49:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1425537788, now seen corresponding path program 3 times [2022-11-23 13:49:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:49:26,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976628490] [2022-11-23 13:49:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:49:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:27,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:49:27,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976628490] [2022-11-23 13:49:27,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976628490] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:49:27,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662625703] [2022-11-23 13:49:27,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:49:27,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:27,840 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:49:27,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 13:49:28,032 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:49:28,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:49:28,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-23 13:49:28,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:28,054 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:49:28,054 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 15 treesize of output 15 [2022-11-23 13:49:28,351 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 19 treesize of output 15 [2022-11-23 13:49:28,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:28,921 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 69 treesize of output 41 [2022-11-23 13:49:29,049 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 60 treesize of output 56 [2022-11-23 13:49:30,137 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 108 treesize of output 44 [2022-11-23 13:49:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:30,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:32,475 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-11-23 13:49:32,476 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 2 case distinctions, treesize of input 53 treesize of output 60 [2022-11-23 13:49:32,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:49:32,493 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 67 treesize of output 70 [2022-11-23 13:49:32,500 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 28 treesize of output 22 [2022-11-23 13:49:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:36,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662625703] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:36,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [20648386] [2022-11-23 13:49:36,990 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-23 13:49:36,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:49:36,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 65 [2022-11-23 13:49:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76647874] [2022-11-23 13:49:36,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:49:36,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-23 13:49:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:49:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-23 13:49:36,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=4129, Unknown=33, NotChecked=0, Total=4422 [2022-11-23 13:49:36,994 INFO L87 Difference]: Start difference. First operand 1071 states and 2564 transitions. Second operand has 67 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-23 13:50:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:05,482 INFO L93 Difference]: Finished difference Result 2775 states and 6245 transitions. [2022-11-23 13:50:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-23 13:50:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 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 36 [2022-11-23 13:50:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:05,492 INFO L225 Difference]: With dead ends: 2775 [2022-11-23 13:50:05,492 INFO L226 Difference]: Without dead ends: 2775 [2022-11-23 13:50:05,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4904 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=2668, Invalid=17605, Unknown=33, NotChecked=0, Total=20306 [2022-11-23 13:50:05,494 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2011 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3933 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:05,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 0 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3933 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-23 13:50:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2022-11-23 13:50:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 839. [2022-11-23 13:50:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 837 states have (on average 2.303464755077658) internal successors, (1928), 838 states have internal predecessors, (1928), 0 states have call successors, (0), 0 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-23 13:50:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1928 transitions. [2022-11-23 13:50:05,530 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1928 transitions. Word has length 36 [2022-11-23 13:50:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:05,531 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 1928 transitions. [2022-11-23 13:50:05,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-23 13:50:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1928 transitions. [2022-11-23 13:50:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-23 13:50:05,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:05,533 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:05,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 13:50:05,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:50:05,740 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:50:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 729673642, now seen corresponding path program 2 times [2022-11-23 13:50:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:05,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524814954] [2022-11-23 13:50:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 13:50:06,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:06,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524814954] [2022-11-23 13:50:06,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524814954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:50:06,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492196884] [2022-11-23 13:50:06,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:50:06,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:50:06,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:50:06,061 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:50:06,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 13:50:06,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 13:50:06,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:50:06,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 13:50:06,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 13:50:06,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:50:06,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492196884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:06,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:50:06,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2022-11-23 13:50:06,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567419872] [2022-11-23 13:50:06,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:06,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:50:06,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:06,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:50:06,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:50:06,302 INFO L87 Difference]: Start difference. First operand 839 states and 1928 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-23 13:50:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:06,522 INFO L93 Difference]: Finished difference Result 1107 states and 2474 transitions. [2022-11-23 13:50:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:50:06,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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 38 [2022-11-23 13:50:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:06,527 INFO L225 Difference]: With dead ends: 1107 [2022-11-23 13:50:06,528 INFO L226 Difference]: Without dead ends: 1107 [2022-11-23 13:50:06,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:50:06,529 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:06,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:50:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-11-23 13:50:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 891. [2022-11-23 13:50:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 2.3172103487064115) internal successors, (2060), 890 states have internal predecessors, (2060), 0 states have call successors, (0), 0 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-23 13:50:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 2060 transitions. [2022-11-23 13:50:06,552 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 2060 transitions. Word has length 38 [2022-11-23 13:50:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:06,552 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 2060 transitions. [2022-11-23 13:50:06,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-23 13:50:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 2060 transitions. [2022-11-23 13:50:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 13:50:06,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:06,554 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:06,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 13:50:06,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 13:50:06,761 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:50:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash 441694721, now seen corresponding path program 3 times [2022-11-23 13:50:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:06,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135115155] [2022-11-23 13:50:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:07,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:07,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135115155] [2022-11-23 13:50:07,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135115155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:50:07,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349550171] [2022-11-23 13:50:07,007 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:50:07,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:50:07,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:50:07,012 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:50:07,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 13:50:07,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:50:07,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:50:07,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 13:50:07,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 13:50:07,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:50:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 13:50:07,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349550171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:50:07,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1082139830] [2022-11-23 13:50:07,437 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-23 13:50:07,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:50:07,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2022-11-23 13:50:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357282549] [2022-11-23 13:50:07,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:50:07,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 13:50:07,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:07,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 13:50:07,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-23 13:50:07,439 INFO L87 Difference]: Start difference. First operand 891 states and 2060 transitions. Second operand has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 18 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-23 13:50:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:07,916 INFO L93 Difference]: Finished difference Result 1220 states and 2685 transitions. [2022-11-23 13:50:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:50:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 18 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 39 [2022-11-23 13:50:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:07,921 INFO L225 Difference]: With dead ends: 1220 [2022-11-23 13:50:07,921 INFO L226 Difference]: Without dead ends: 1143 [2022-11-23 13:50:07,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2022-11-23 13:50:07,922 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 226 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:07,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 0 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:50:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-11-23 13:50:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 823. [2022-11-23 13:50:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 821 states have (on average 2.2496954933008526) internal successors, (1847), 822 states have internal predecessors, (1847), 0 states have call successors, (0), 0 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-23 13:50:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1847 transitions. [2022-11-23 13:50:07,966 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1847 transitions. Word has length 39 [2022-11-23 13:50:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:07,967 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1847 transitions. [2022-11-23 13:50:07,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 18 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-23 13:50:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1847 transitions. [2022-11-23 13:50:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 13:50:07,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:07,969 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:07,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 13:50:08,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 13:50:08,175 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:50:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1620838142, now seen corresponding path program 4 times [2022-11-23 13:50:08,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:08,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227609294] [2022-11-23 13:50:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 13:50:08,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:08,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227609294] [2022-11-23 13:50:08,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227609294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:50:08,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559617171] [2022-11-23 13:50:08,556 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:50:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:50:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:50:08,558 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:50:08,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 13:50:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:08,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 13:50:08,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 13:50:08,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:50:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 13:50:09,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559617171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:50:09,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [864736559] [2022-11-23 13:50:09,010 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:50:09,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:50:09,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-11-23 13:50:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027897379] [2022-11-23 13:50:09,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:50:09,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 13:50:09,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 13:50:09,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2022-11-23 13:50:09,015 INFO L87 Difference]: Start difference. First operand 823 states and 1847 transitions. Second operand has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-23 13:50:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:09,697 INFO L93 Difference]: Finished difference Result 1973 states and 4192 transitions. [2022-11-23 13:50:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 13:50:09,698 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-23 13:50:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:09,705 INFO L225 Difference]: With dead ends: 1973 [2022-11-23 13:50:09,705 INFO L226 Difference]: Without dead ends: 1973 [2022-11-23 13:50:09,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 13:50:09,706 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 298 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:09,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 0 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:50:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2022-11-23 13:50:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1091. [2022-11-23 13:50:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1089 states have (on average 2.318640955004591) internal successors, (2525), 1090 states have internal predecessors, (2525), 0 states have call successors, (0), 0 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-23 13:50:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 2525 transitions. [2022-11-23 13:50:09,739 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 2525 transitions. Word has length 45 [2022-11-23 13:50:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:09,740 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 2525 transitions. [2022-11-23 13:50:09,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-23 13:50:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2525 transitions. [2022-11-23 13:50:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-23 13:50:09,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:09,742 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:09,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 13:50:09,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 13:50:09,948 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:50:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash 40895197, now seen corresponding path program 4 times [2022-11-23 13:50:09,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:09,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855069592] [2022-11-23 13:50:09,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:09,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:12,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:12,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855069592] [2022-11-23 13:50:12,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855069592] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:50:12,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987979355] [2022-11-23 13:50:12,015 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:50:12,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:50:12,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:50:12,020 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:50:12,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 13:50:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:12,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-23 13:50:12,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:12,595 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 19 treesize of output 15 [2022-11-23 13:50:13,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:50:13,115 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 49 treesize of output 36 [2022-11-23 13:50:13,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:50:13,617 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 49 treesize of output 36 [2022-11-23 13:50:14,830 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 76 treesize of output 44 [2022-11-23 13:50:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:14,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:50:17,142 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 54 treesize of output 46 [2022-11-23 13:50:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:17,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987979355] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:50:17,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [797440369] [2022-11-23 13:50:17,469 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-23 13:50:17,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:50:17,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 72 [2022-11-23 13:50:17,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142185908] [2022-11-23 13:50:17,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:50:17,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-23 13:50:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:17,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-23 13:50:17,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4998, Unknown=0, NotChecked=0, Total=5256 [2022-11-23 13:50:17,473 INFO L87 Difference]: Start difference. First operand 1091 states and 2525 transitions. Second operand has 73 states, 72 states have (on average 2.125) internal successors, (153), 73 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-23 13:51:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:34,119 INFO L93 Difference]: Finished difference Result 5367 states and 11981 transitions. [2022-11-23 13:51:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-11-23 13:51:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.125) internal successors, (153), 73 states have internal predecessors, (153), 0 states have call successors, (0), 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 51 [2022-11-23 13:51:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:34,134 INFO L225 Difference]: With dead ends: 5367 [2022-11-23 13:51:34,134 INFO L226 Difference]: Without dead ends: 5118 [2022-11-23 13:51:34,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18227 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=4145, Invalid=48525, Unknown=0, NotChecked=0, Total=52670 [2022-11-23 13:51:34,138 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1304 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12636 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 12636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:34,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 0 Invalid, 12753 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [117 Valid, 12636 Invalid, 0 Unknown, 0 Unchecked, 23.9s Time] [2022-11-23 13:51:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2022-11-23 13:51:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 2076. [2022-11-23 13:51:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 2074 states have (on average 2.422854387656702) internal successors, (5025), 2075 states have internal predecessors, (5025), 0 states have call successors, (0), 0 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-23 13:51:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 5025 transitions. [2022-11-23 13:51:34,214 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 5025 transitions. Word has length 51 [2022-11-23 13:51:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:34,215 INFO L495 AbstractCegarLoop]: Abstraction has 2076 states and 5025 transitions. [2022-11-23 13:51:34,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.125) internal successors, (153), 73 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-23 13:51:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 5025 transitions. [2022-11-23 13:51:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-23 13:51:34,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:34,219 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:34,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 13:51:34,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 13:51:34,436 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:51:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash -185517593, now seen corresponding path program 5 times [2022-11-23 13:51:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:34,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568399367] [2022-11-23 13:51:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:37,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:37,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568399367] [2022-11-23 13:51:37,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568399367] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:51:37,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019087527] [2022-11-23 13:51:37,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:51:37,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:51:37,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:51:37,031 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:51:37,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 13:51:37,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 13:51:37,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:51:37,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-23 13:51:37,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:51:37,527 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:51:37,528 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 15 treesize of output 15 [2022-11-23 13:51:37,836 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 19 treesize of output 15 [2022-11-23 13:51:37,932 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 56 treesize of output 52 [2022-11-23 13:51:38,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:51:38,471 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 49 treesize of output 36 [2022-11-23 13:51:39,012 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-23 13:51:39,012 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 1 case distinctions, treesize of input 53 treesize of output 48 [2022-11-23 13:51:40,334 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 76 treesize of output 44 [2022-11-23 13:51:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:40,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:51:42,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_983) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-11-23 13:51:42,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:51:42,448 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 29 treesize of output 30 [2022-11-23 13:51:42,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:51:42,462 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 49 treesize of output 52 [2022-11-23 13:51:42,467 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 28 treesize of output 22 [2022-11-23 13:51:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:42,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019087527] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:51:42,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [105892203] [2022-11-23 13:51:42,913 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-23 13:51:42,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:51:42,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24, 24] total 75 [2022-11-23 13:51:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684466991] [2022-11-23 13:51:42,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:51:42,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-23 13:51:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:42,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-23 13:51:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=5366, Unknown=1, NotChecked=148, Total=5852 [2022-11-23 13:51:42,918 INFO L87 Difference]: Start difference. First operand 2076 states and 5025 transitions. Second operand has 77 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 76 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-23 13:53:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:41,387 INFO L93 Difference]: Finished difference Result 6936 states and 15380 transitions. [2022-11-23 13:53:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2022-11-23 13:53:41,388 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 76 states have internal predecessors, (150), 0 states have call successors, (0), 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 51 [2022-11-23 13:53:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:41,403 INFO L225 Difference]: With dead ends: 6936 [2022-11-23 13:53:41,404 INFO L226 Difference]: Without dead ends: 6646 [2022-11-23 13:53:41,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 53 SyntacticMatches, 13 SemanticMatches, 310 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37436 ImplicationChecksByTransitivity, 89.5s TimeCoverageRelationStatistics Valid=8826, Invalid=87481, Unknown=107, NotChecked=618, Total=97032 [2022-11-23 13:53:41,444 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 3096 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14372 mSolverCounterSat, 448 mSolverCounterUnsat, 90 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 15462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 14372 IncrementalHoareTripleChecker+Invalid, 90 IncrementalHoareTripleChecker+Unknown, 552 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:41,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3096 Valid, 0 Invalid, 15462 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [448 Valid, 14372 Invalid, 90 Unknown, 552 Unchecked, 32.9s Time] [2022-11-23 13:53:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2022-11-23 13:53:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 1514. [2022-11-23 13:53:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 2.337962962962963) internal successors, (3535), 1513 states have internal predecessors, (3535), 0 states have call successors, (0), 0 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-23 13:53:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 3535 transitions. [2022-11-23 13:53:41,523 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 3535 transitions. Word has length 51 [2022-11-23 13:53:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:41,523 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 3535 transitions. [2022-11-23 13:53:41,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 76 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-23 13:53:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 3535 transitions. [2022-11-23 13:53:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-23 13:53:41,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:41,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:41,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:41,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:41,735 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:53:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 781649401, now seen corresponding path program 6 times [2022-11-23 13:53:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:41,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761891235] [2022-11-23 13:53:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:44,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:44,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761891235] [2022-11-23 13:53:44,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761891235] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:44,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248492491] [2022-11-23 13:53:44,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:53:44,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:44,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:44,156 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:44,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 13:53:44,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:53:44,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:44,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-23 13:53:44,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:44,397 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:53:44,397 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 15 treesize of output 15 [2022-11-23 13:53:44,707 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 19 treesize of output 15 [2022-11-23 13:53:45,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:45,262 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 69 treesize of output 41 [2022-11-23 13:53:45,290 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 60 treesize of output 56 [2022-11-23 13:53:45,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:45,796 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 69 treesize of output 41 [2022-11-23 13:53:47,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 108 treesize of output 44 [2022-11-23 13:53:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:47,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:48,953 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1078 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1078) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-11-23 13:53:50,258 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-11-23 13:53:50,258 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 2 case distinctions, treesize of input 53 treesize of output 60 [2022-11-23 13:53:50,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:50,273 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 67 treesize of output 70 [2022-11-23 13:53:50,279 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 28 treesize of output 22 [2022-11-23 13:53:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:54,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248492491] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:53:54,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1337975360] [2022-11-23 13:53:54,804 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-23 13:53:54,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:53:54,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2022-11-23 13:53:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858593261] [2022-11-23 13:53:54,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:53:54,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-23 13:53:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-23 13:53:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=5389, Unknown=17, NotChecked=148, Total=5852 [2022-11-23 13:53:54,809 INFO L87 Difference]: Start difference. First operand 1514 states and 3535 transitions. Second operand has 77 states, 76 states have (on average 2.013157894736842) internal successors, (153), 76 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-23 13:54:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:49,404 INFO L93 Difference]: Finished difference Result 5074 states and 11259 transitions. [2022-11-23 13:54:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-11-23 13:54:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.013157894736842) internal successors, (153), 76 states have internal predecessors, (153), 0 states have call successors, (0), 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 51 [2022-11-23 13:54:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:49,415 INFO L225 Difference]: With dead ends: 5074 [2022-11-23 13:54:49,415 INFO L226 Difference]: Without dead ends: 5074 [2022-11-23 13:54:49,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 52 SyntacticMatches, 15 SemanticMatches, 191 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10702 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=4752, Invalid=31907, Unknown=17, NotChecked=380, Total=37056 [2022-11-23 13:54:49,418 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2871 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5488 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2871 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 5488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:49,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2871 Valid, 0 Invalid, 6117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 5488 Invalid, 0 Unknown, 284 Unchecked, 7.3s Time] [2022-11-23 13:54:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2022-11-23 13:54:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 1471. [2022-11-23 13:54:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1469 states have (on average 2.341729067392784) internal successors, (3440), 1470 states have internal predecessors, (3440), 0 states have call successors, (0), 0 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-23 13:54:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 3440 transitions. [2022-11-23 13:54:49,480 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 3440 transitions. Word has length 51 [2022-11-23 13:54:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:49,480 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 3440 transitions. [2022-11-23 13:54:49,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.013157894736842) internal successors, (153), 76 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-23 13:54:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 3440 transitions. [2022-11-23 13:54:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-23 13:54:49,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:49,484 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2022-11-23 13:54:49,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 13:54:49,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:49,690 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:54:49,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1046702672, now seen corresponding path program 3 times [2022-11-23 13:54:49,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:49,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611070541] [2022-11-23 13:54:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 7 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:50,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:50,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611070541] [2022-11-23 13:54:50,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611070541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:54:50,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860787286] [2022-11-23 13:54:50,467 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:54:50,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:50,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:54:50,468 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:54:50,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 13:54:50,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:54:50,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:54:50,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 13:54:50,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:54:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 7 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:50,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:54:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 7 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:51,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860787286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:54:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891742776] [2022-11-23 13:54:51,180 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-23 13:54:51,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:54:51,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 39 [2022-11-23 13:54:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257088778] [2022-11-23 13:54:51,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:54:51,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-23 13:54:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:51,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-23 13:54:51,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1152, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 13:54:51,183 INFO L87 Difference]: Start difference. First operand 1471 states and 3440 transitions. Second operand has 40 states, 40 states have (on average 3.25) internal successors, (130), 39 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:52,094 INFO L93 Difference]: Finished difference Result 2582 states and 5763 transitions. [2022-11-23 13:54:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-23 13:54:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.25) internal successors, (130), 39 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-23 13:54:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:52,101 INFO L225 Difference]: With dead ends: 2582 [2022-11-23 13:54:52,101 INFO L226 Difference]: Without dead ends: 2582 [2022-11-23 13:54:52,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=857, Invalid=2335, Unknown=0, NotChecked=0, Total=3192 [2022-11-23 13:54:52,102 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 854 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:52,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 0 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 13:54:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2022-11-23 13:54:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1991. [2022-11-23 13:54:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1989 states have (on average 2.340874811463047) internal successors, (4656), 1990 states have internal predecessors, (4656), 0 states have call successors, (0), 0 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-23 13:54:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4656 transitions. [2022-11-23 13:54:52,149 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4656 transitions. Word has length 55 [2022-11-23 13:54:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:52,150 INFO L495 AbstractCegarLoop]: Abstraction has 1991 states and 4656 transitions. [2022-11-23 13:54:52,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.25) internal successors, (130), 39 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4656 transitions. [2022-11-23 13:54:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-23 13:54:52,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:52,154 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:52,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 13:54:52,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:52,361 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:54:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:52,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1878999228, now seen corresponding path program 5 times [2022-11-23 13:54:52,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:52,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448679926] [2022-11-23 13:54:52,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:52,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 110 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 13:54:53,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:53,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448679926] [2022-11-23 13:54:53,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448679926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:54:53,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264409238] [2022-11-23 13:54:53,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:54:53,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:53,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:54:53,008 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:54:53,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 13:54:53,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-23 13:54:53,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:54:53,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 13:54:53,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:54:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 110 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 13:54:53,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:54:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 110 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 13:54:53,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264409238] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:54:53,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1040147391] [2022-11-23 13:54:53,708 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-23 13:54:53,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:54:53,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 31 [2022-11-23 13:54:53,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718347430] [2022-11-23 13:54:53,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:54:53,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 13:54:53,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 13:54:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2022-11-23 13:54:53,710 INFO L87 Difference]: Start difference. First operand 1991 states and 4656 transitions. Second operand has 32 states, 32 states have (on average 3.84375) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-23 13:54:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:54,768 INFO L93 Difference]: Finished difference Result 3830 states and 8431 transitions. [2022-11-23 13:54:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-23 13:54:54,768 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 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 59 [2022-11-23 13:54:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:54,778 INFO L225 Difference]: With dead ends: 3830 [2022-11-23 13:54:54,778 INFO L226 Difference]: Without dead ends: 3830 [2022-11-23 13:54:54,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=2232, Unknown=0, NotChecked=0, Total=2862 [2022-11-23 13:54:54,780 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 479 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:54,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 0 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 13:54:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2022-11-23 13:54:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 2121. [2022-11-23 13:54:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2119 states have (on average 2.3411986786219914) internal successors, (4961), 2120 states have internal predecessors, (4961), 0 states have call successors, (0), 0 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-23 13:54:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 4961 transitions. [2022-11-23 13:54:54,837 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 4961 transitions. Word has length 59 [2022-11-23 13:54:54,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:54,837 INFO L495 AbstractCegarLoop]: Abstraction has 2121 states and 4961 transitions. [2022-11-23 13:54:54,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-23 13:54:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 4961 transitions. [2022-11-23 13:54:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-23 13:54:54,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:54,842 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:54,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 13:54:55,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:55,050 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:54:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1865547242, now seen corresponding path program 7 times [2022-11-23 13:54:55,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:55,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842304590] [2022-11-23 13:54:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:55,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:55,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842304590] [2022-11-23 13:54:55,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842304590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:54:55,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002370064] [2022-11-23 13:54:55,406 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:54:55,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:55,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:54:55,407 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:54:55,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 13:54:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:55,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 13:54:55,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:54:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:55,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:54:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002370064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:54:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1184859573] [2022-11-23 13:54:55,877 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-23 13:54:55,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:54:55,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 15 [2022-11-23 13:54:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534698051] [2022-11-23 13:54:55,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:54:55,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:54:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:54:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:54:55,879 INFO L87 Difference]: Start difference. First operand 2121 states and 4961 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:56,370 INFO L93 Difference]: Finished difference Result 2940 states and 6732 transitions. [2022-11-23 13:54:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 13:54:56,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-23 13:54:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:56,376 INFO L225 Difference]: With dead ends: 2940 [2022-11-23 13:54:56,377 INFO L226 Difference]: Without dead ends: 2831 [2022-11-23 13:54:56,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 13 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-11-23 13:54:56,377 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:56,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:54:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2022-11-23 13:54:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2177. [2022-11-23 13:54:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 2175 states have (on average 2.341149425287356) internal successors, (5092), 2176 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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-23 13:54:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 5092 transitions. [2022-11-23 13:54:56,426 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 5092 transitions. Word has length 59 [2022-11-23 13:54:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:56,426 INFO L495 AbstractCegarLoop]: Abstraction has 2177 states and 5092 transitions. [2022-11-23 13:54:56,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 5092 transitions. [2022-11-23 13:54:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 13:54:56,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:56,431 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:56,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 13:54:56,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 13:54:56,637 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:54:56,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:56,638 INFO L85 PathProgramCache]: Analyzing trace with hash -512551172, now seen corresponding path program 8 times [2022-11-23 13:54:56,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:56,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128883425] [2022-11-23 13:54:56,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:56,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:59,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:59,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128883425] [2022-11-23 13:54:59,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128883425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:54:59,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187086132] [2022-11-23 13:54:59,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:54:59,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:59,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:54:59,226 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:54:59,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095267ba-eb0a-4d6d-b444-fe2d4a42cfef/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 13:54:59,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 13:54:59,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:54:59,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-23 13:54:59,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:54:59,975 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 19 treesize of output 15 [2022-11-23 13:55:00,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:55:00,552 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 49 treesize of output 36 [2022-11-23 13:55:01,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:55:01,050 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 49 treesize of output 36 [2022-11-23 13:55:01,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:55:01,549 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 49 treesize of output 36 [2022-11-23 13:55:03,171 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 76 treesize of output 44 [2022-11-23 13:55:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:03,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:55:06,843 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 54 treesize of output 46 [2022-11-23 13:55:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 3 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:07,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187086132] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:55:07,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1123472170] [2022-11-23 13:55:07,240 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-23 13:55:07,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:55:07,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 32] total 89 [2022-11-23 13:55:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143861185] [2022-11-23 13:55:07,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:55:07,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-11-23 13:55:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:07,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-11-23 13:55:07,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=7655, Unknown=0, NotChecked=0, Total=8010 [2022-11-23 13:55:07,244 INFO L87 Difference]: Start difference. First operand 2177 states and 5092 transitions. Second operand has 90 states, 89 states have (on average 2.2247191011235956) internal successors, (198), 90 states have internal predecessors, (198), 0 states have call successors, (0), 0 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-23 13:55:43,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:55:45,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:09,014 WARN L233 SmtUtils]: Spent 15.65s on a formula simplification. DAG size of input: 119 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:56:14,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:26,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:28,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:41,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:43,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:45,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:47,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:50,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:54,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:56,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:58,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:57:03,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:57:32,257 WARN L233 SmtUtils]: Spent 26.43s on a formula simplification. DAG size of input: 145 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:57:55,399 WARN L233 SmtUtils]: Spent 22.49s on a formula simplification. DAG size of input: 128 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:57:57,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:58:06,213 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 112 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:58:21,265 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 120 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:58:35,949 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 142 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:58:39,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:58:41,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:58:45,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:58:47,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:58:55,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:58:57,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:59:04,224 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 100 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:59:13,731 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 106 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:59:29,236 WARN L233 SmtUtils]: Spent 11.66s on a formula simplification. DAG size of input: 140 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)