./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 04:09:22,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:09:22,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:09:22,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:09:22,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:09:22,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:09:22,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:09:22,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:09:22,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:09:22,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:09:22,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:09:22,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:09:22,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:09:22,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:09:22,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:09:22,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:09:22,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:09:22,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:09:22,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:09:22,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:09:22,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:09:22,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:09:22,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:09:22,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:09:22,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:09:22,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:09:22,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:09:22,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:09:22,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:09:22,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:09:22,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:09:22,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:09:22,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:09:22,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:09:22,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:09:22,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:09:22,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:09:22,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:09:22,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:09:22,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:09:22,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:09:22,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 04:09:22,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:09:22,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:09:22,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:09:22,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:09:22,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:09:22,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:09:22,179 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:09:22,179 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:09:22,180 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:09:22,180 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:09:22,181 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:09:22,181 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:09:22,182 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:09:22,182 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:09:22,182 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:09:22,183 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:09:22,183 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:09:22,183 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:09:22,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:09:22,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:09:22,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:09:22,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:09:22,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:09:22,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:09:22,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:09:22,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:09:22,186 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:09:22,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:09:22,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:09:22,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:09:22,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:09:22,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:09:22,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:09:22,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:09:22,188 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:09:22,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:09:22,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:09:22,189 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:09:22,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:09:22,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:09:22,189 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:09:22,189 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_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2022-11-03 04:09:22,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:09:22,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:09:22,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:09:22,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:09:22,566 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:09:22,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread/triangular-longest-2.i [2022-11-03 04:09:22,652 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/data/664ef2042/3007f9c624c14f6181a782e1ad8ee4fa/FLAGae97e8b1f [2022-11-03 04:09:23,154 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:09:23,154 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/sv-benchmarks/c/pthread/triangular-longest-2.i [2022-11-03 04:09:23,166 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/data/664ef2042/3007f9c624c14f6181a782e1ad8ee4fa/FLAGae97e8b1f [2022-11-03 04:09:23,473 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/data/664ef2042/3007f9c624c14f6181a782e1ad8ee4fa [2022-11-03 04:09:23,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:09:23,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:09:23,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:09:23,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:09:23,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:09:23,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:09:23" (1/1) ... [2022-11-03 04:09:23,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c80180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:23, skipping insertion in model container [2022-11-03 04:09:23,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:09:23" (1/1) ... [2022-11-03 04:09:23,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:09:23,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:09:24,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2022-11-03 04:09:24,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:09:24,021 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:09:24,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2022-11-03 04:09:24,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:09:24,127 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:09:24,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24 WrapperNode [2022-11-03 04:09:24,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:09:24,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:09:24,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:09:24,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:09:24,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,192 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-11-03 04:09:24,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:09:24,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:09:24,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:09:24,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:09:24,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,243 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:09:24,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:09:24,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:09:24,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:09:24,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (1/1) ... [2022-11-03 04:09:24,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:09:24,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:24,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:09:24,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:09:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-03 04:09:24,334 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-03 04:09:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-03 04:09:24,334 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-03 04:09:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 04:09:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 04:09:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:09:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 04:09:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 04:09:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 04:09:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 04:09:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:09:24,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:09:24,337 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 04:09:24,507 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:09:24,509 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:09:24,707 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:09:24,713 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:09:24,713 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 04:09:24,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:09:24 BoogieIcfgContainer [2022-11-03 04:09:24,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:09:24,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:09:24,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:09:24,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:09:24,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:09:23" (1/3) ... [2022-11-03 04:09:24,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232b7315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:09:24, skipping insertion in model container [2022-11-03 04:09:24,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:09:24" (2/3) ... [2022-11-03 04:09:24,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232b7315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:09:24, skipping insertion in model container [2022-11-03 04:09:24,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:09:24" (3/3) ... [2022-11-03 04:09:24,730 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2022-11-03 04:09:24,739 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 04:09:24,750 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:09:24,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 04:09:24,751 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 04:09:24,797 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 04:09:24,836 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 04:09:24,847 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 70 transitions, 150 flow [2022-11-03 04:09:24,850 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 70 transitions, 150 flow [2022-11-03 04:09:24,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 70 transitions, 150 flow [2022-11-03 04:09:24,893 INFO L130 PetriNetUnfolder]: 5/68 cut-off events. [2022-11-03 04:09:24,893 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 04:09:24,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 68 events. 5/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-11-03 04:09:24,909 INFO L118 LiptonReduction]: Number of co-enabled transitions 1122 [2022-11-03 04:09:27,545 INFO L133 LiptonReduction]: Checked pairs total: 1006 [2022-11-03 04:09:27,546 INFO L135 LiptonReduction]: Total number of compositions: 64 [2022-11-03 04:09:27,554 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2022-11-03 04:09:27,570 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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-03 04:09:27,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:09:27,592 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;@45538f03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:09:27,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-03 04:09:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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-03 04:09:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 04:09:27,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:27,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 04:09:27,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:27,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash -425078266, now seen corresponding path program 1 times [2022-11-03 04:09:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:27,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254440255] [2022-11-03 04:09:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:28,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:28,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254440255] [2022-11-03 04:09:28,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254440255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:09:28,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:09:28,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:09:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114486977] [2022-11-03 04:09:28,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:09:28,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:09:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:28,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:09:28,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:09:28,120 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-03 04:09:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:28,217 INFO L93 Difference]: Finished difference Result 60 states and 143 transitions. [2022-11-03 04:09:28,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:09:28,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-03 04:09:28,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:28,229 INFO L225 Difference]: With dead ends: 60 [2022-11-03 04:09:28,229 INFO L226 Difference]: Without dead ends: 54 [2022-11-03 04:09:28,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:09:28,234 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:28,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:09:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-03 04:09:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-11-03 04:09:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.4489795918367347) internal successors, (120), 49 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 120 transitions. [2022-11-03 04:09:28,271 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 120 transitions. Word has length 6 [2022-11-03 04:09:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:28,271 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 120 transitions. [2022-11-03 04:09:28,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-03 04:09:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 120 transitions. [2022-11-03 04:09:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 04:09:28,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:28,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:28,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:09:28,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash -478321401, now seen corresponding path program 1 times [2022-11-03 04:09:28,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:28,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985101870] [2022-11-03 04:09:28,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:28,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:28,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:28,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985101870] [2022-11-03 04:09:28,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985101870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:09:28,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:09:28,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:09:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218518125] [2022-11-03 04:09:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:09:28,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:09:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:09:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:09:28,417 INFO L87 Difference]: Start difference. First operand 50 states and 120 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:28,518 INFO L93 Difference]: Finished difference Result 86 states and 200 transitions. [2022-11-03 04:09:28,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:09:28,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-03 04:09:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:28,521 INFO L225 Difference]: With dead ends: 86 [2022-11-03 04:09:28,521 INFO L226 Difference]: Without dead ends: 78 [2022-11-03 04:09:28,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:09:28,523 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:28,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:09:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-03 04:09:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2022-11-03 04:09:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.4909090909090907) internal successors, (137), 55 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 137 transitions. [2022-11-03 04:09:28,534 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 137 transitions. Word has length 8 [2022-11-03 04:09:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:28,535 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 137 transitions. [2022-11-03 04:09:28,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 137 transitions. [2022-11-03 04:09:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 04:09:28,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:28,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:28,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 04:09:28,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash -478649691, now seen corresponding path program 2 times [2022-11-03 04:09:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:28,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588942112] [2022-11-03 04:09:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:28,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:28,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588942112] [2022-11-03 04:09:28,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588942112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:09:28,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:09:28,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:09:28,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682420121] [2022-11-03 04:09:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:09:28,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:09:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:09:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:09:28,655 INFO L87 Difference]: Start difference. First operand 56 states and 137 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:28,767 INFO L93 Difference]: Finished difference Result 62 states and 143 transitions. [2022-11-03 04:09:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:09:28,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-03 04:09:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:28,770 INFO L225 Difference]: With dead ends: 62 [2022-11-03 04:09:28,770 INFO L226 Difference]: Without dead ends: 50 [2022-11-03 04:09:28,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:09:28,772 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:28,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:09:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-03 04:09:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-11-03 04:09:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2022-11-03 04:09:28,780 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 8 [2022-11-03 04:09:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:28,781 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 98 transitions. [2022-11-03 04:09:28,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 98 transitions. [2022-11-03 04:09:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 04:09:28,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:28,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:28,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 04:09:28,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash -478800568, now seen corresponding path program 1 times [2022-11-03 04:09:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:28,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984706395] [2022-11-03 04:09:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:28,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:28,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984706395] [2022-11-03 04:09:28,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984706395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:09:28,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:09:28,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:09:28,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226766981] [2022-11-03 04:09:28,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:09:28,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:09:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:28,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:09:28,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:09:28,965 INFO L87 Difference]: Start difference. First operand 42 states and 98 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:29,022 INFO L93 Difference]: Finished difference Result 56 states and 130 transitions. [2022-11-03 04:09:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:09:29,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-03 04:09:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:29,029 INFO L225 Difference]: With dead ends: 56 [2022-11-03 04:09:29,033 INFO L226 Difference]: Without dead ends: 50 [2022-11-03 04:09:29,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:09:29,039 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:29,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:09:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-03 04:09:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-11-03 04:09:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 41 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2022-11-03 04:09:29,045 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2022-11-03 04:09:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:29,046 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2022-11-03 04:09:29,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2022-11-03 04:09:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:09:29,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:29,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:29,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 04:09:29,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash -106411191, now seen corresponding path program 1 times [2022-11-03 04:09:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:29,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011535127] [2022-11-03 04:09:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:29,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:29,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011535127] [2022-11-03 04:09:29,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011535127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:09:29,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:09:29,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:09:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632099014] [2022-11-03 04:09:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:09:29,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:09:29,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:09:29,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:09:29,267 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:29,369 INFO L93 Difference]: Finished difference Result 58 states and 132 transitions. [2022-11-03 04:09:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:09:29,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:29,372 INFO L225 Difference]: With dead ends: 58 [2022-11-03 04:09:29,372 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 04:09:29,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 04:09:29,374 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:29,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:09:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 04:09:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-11-03 04:09:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 107 transitions. [2022-11-03 04:09:29,392 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 107 transitions. Word has length 10 [2022-11-03 04:09:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:29,392 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 107 transitions. [2022-11-03 04:09:29,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 107 transitions. [2022-11-03 04:09:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:09:29,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:29,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:29,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 04:09:29,394 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash -421332441, now seen corresponding path program 2 times [2022-11-03 04:09:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:29,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418084173] [2022-11-03 04:09:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:29,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:29,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418084173] [2022-11-03 04:09:29,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418084173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:09:29,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:09:29,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:09:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205417477] [2022-11-03 04:09:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:09:29,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:09:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:29,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:09:29,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:09:29,548 INFO L87 Difference]: Start difference. First operand 45 states and 107 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:29,648 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2022-11-03 04:09:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:09:29,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:29,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:29,650 INFO L225 Difference]: With dead ends: 62 [2022-11-03 04:09:29,650 INFO L226 Difference]: Without dead ends: 56 [2022-11-03 04:09:29,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-03 04:09:29,653 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:29,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:09:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-03 04:09:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2022-11-03 04:09:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 107 transitions. [2022-11-03 04:09:29,668 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 107 transitions. Word has length 10 [2022-11-03 04:09:29,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:29,669 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 107 transitions. [2022-11-03 04:09:29,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 107 transitions. [2022-11-03 04:09:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:09:29,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:29,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:29,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 04:09:29,670 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash -453582051, now seen corresponding path program 3 times [2022-11-03 04:09:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:29,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063498046] [2022-11-03 04:09:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:29,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:29,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063498046] [2022-11-03 04:09:29,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063498046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:09:29,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:09:29,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:09:29,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402671562] [2022-11-03 04:09:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:09:29,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:09:29,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:09:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:09:29,777 INFO L87 Difference]: Start difference. First operand 44 states and 107 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:29,871 INFO L93 Difference]: Finished difference Result 78 states and 182 transitions. [2022-11-03 04:09:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:09:29,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:29,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:29,873 INFO L225 Difference]: With dead ends: 78 [2022-11-03 04:09:29,874 INFO L226 Difference]: Without dead ends: 71 [2022-11-03 04:09:29,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 04:09:29,875 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:29,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:09:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-03 04:09:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-11-03 04:09:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.5555555555555554) internal successors, (115), 45 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 115 transitions. [2022-11-03 04:09:29,889 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 115 transitions. Word has length 10 [2022-11-03 04:09:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:29,889 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 115 transitions. [2022-11-03 04:09:29,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 115 transitions. [2022-11-03 04:09:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:09:29,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:29,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:29,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 04:09:29,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash -453564381, now seen corresponding path program 4 times [2022-11-03 04:09:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:29,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429965514] [2022-11-03 04:09:29,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:30,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:30,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429965514] [2022-11-03 04:09:30,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429965514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:09:30,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:09:30,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:09:30,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878130555] [2022-11-03 04:09:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:09:30,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:09:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:30,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:09:30,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:09:30,032 INFO L87 Difference]: Start difference. First operand 46 states and 115 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:30,137 INFO L93 Difference]: Finished difference Result 56 states and 131 transitions. [2022-11-03 04:09:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:09:30,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:30,139 INFO L225 Difference]: With dead ends: 56 [2022-11-03 04:09:30,139 INFO L226 Difference]: Without dead ends: 45 [2022-11-03 04:09:30,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-03 04:09:30,141 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:30,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:09:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-03 04:09:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-11-03 04:09:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-11-03 04:09:30,146 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 10 [2022-11-03 04:09:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:30,146 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2022-11-03 04:09:30,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:09:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2022-11-03 04:09:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:09:30,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:30,147 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:30,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 04:09:30,148 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1028453218, now seen corresponding path program 5 times [2022-11-03 04:09:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:30,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647178776] [2022-11-03 04:09:30,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:30,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:30,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:30,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647178776] [2022-11-03 04:09:30,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647178776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:30,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466169066] [2022-11-03 04:09:30,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:09:30,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:30,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:30,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:30,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 04:09:30,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:09:30,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:30,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 04:09:30,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:30,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:30,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466169066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:30,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1123360417] [2022-11-03 04:09:30,760 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:30,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:30,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-03 04:09:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402652347] [2022-11-03 04:09:30,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:30,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:09:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:30,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:09:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:09:30,764 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-03 04:09:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:30,963 INFO L93 Difference]: Finished difference Result 71 states and 159 transitions. [2022-11-03 04:09:30,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:09:30,964 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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 11 [2022-11-03 04:09:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:30,964 INFO L225 Difference]: With dead ends: 71 [2022-11-03 04:09:30,964 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 04:09:30,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:09:30,965 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:30,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:09:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 04:09:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2022-11-03 04:09:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.3958333333333335) internal successors, (115), 48 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 115 transitions. [2022-11-03 04:09:30,969 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 115 transitions. Word has length 11 [2022-11-03 04:09:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:30,969 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 115 transitions. [2022-11-03 04:09:30,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-03 04:09:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 115 transitions. [2022-11-03 04:09:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:09:30,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:30,970 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:31,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:31,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:31,192 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash -161699580, now seen corresponding path program 6 times [2022-11-03 04:09:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:31,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035484096] [2022-11-03 04:09:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:31,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035484096] [2022-11-03 04:09:31,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035484096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912702292] [2022-11-03 04:09:31,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:09:31,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:31,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:31,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 04:09:31,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:09:31,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:31,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 04:09:31,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:31,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:31,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912702292] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:31,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967441321] [2022-11-03 04:09:31,632 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:31,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:31,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-03 04:09:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471224892] [2022-11-03 04:09:31,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:31,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 04:09:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:31,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 04:09:31,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-03 04:09:31,636 INFO L87 Difference]: Start difference. First operand 49 states and 115 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:32,002 INFO L93 Difference]: Finished difference Result 94 states and 213 transitions. [2022-11-03 04:09:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:09:32,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 04:09:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:32,003 INFO L225 Difference]: With dead ends: 94 [2022-11-03 04:09:32,003 INFO L226 Difference]: Without dead ends: 67 [2022-11-03 04:09:32,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2022-11-03 04:09:32,005 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:32,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:09:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-03 04:09:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2022-11-03 04:09:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 122 transitions. [2022-11-03 04:09:32,008 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 122 transitions. Word has length 11 [2022-11-03 04:09:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:32,008 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 122 transitions. [2022-11-03 04:09:32,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 122 transitions. [2022-11-03 04:09:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:09:32,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:32,009 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:32,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:32,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 04:09:32,220 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1175577272, now seen corresponding path program 7 times [2022-11-03 04:09:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:32,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242899881] [2022-11-03 04:09:32,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:32,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:32,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242899881] [2022-11-03 04:09:32,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242899881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:32,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911073961] [2022-11-03 04:09:32,312 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:09:32,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:32,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:32,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:32,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 04:09:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:32,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 04:09:32,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:32,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:32,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911073961] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:32,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1431168562] [2022-11-03 04:09:32,554 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:32,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:32,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-03 04:09:32,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635194216] [2022-11-03 04:09:32,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:32,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:09:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:09:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:09:32,558 INFO L87 Difference]: Start difference. First operand 51 states and 122 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-03 04:09:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:32,814 INFO L93 Difference]: Finished difference Result 101 states and 241 transitions. [2022-11-03 04:09:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:09:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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 11 [2022-11-03 04:09:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:32,815 INFO L225 Difference]: With dead ends: 101 [2022-11-03 04:09:32,815 INFO L226 Difference]: Without dead ends: 75 [2022-11-03 04:09:32,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2022-11-03 04:09:32,816 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:32,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:09:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-03 04:09:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2022-11-03 04:09:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.491228070175439) internal successors, (142), 57 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 142 transitions. [2022-11-03 04:09:32,820 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 142 transitions. Word has length 11 [2022-11-03 04:09:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:32,820 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 142 transitions. [2022-11-03 04:09:32,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-03 04:09:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 142 transitions. [2022-11-03 04:09:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:09:32,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:32,821 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:32,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:33,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:33,040 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1928422365, now seen corresponding path program 8 times [2022-11-03 04:09:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:33,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954828405] [2022-11-03 04:09:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:09:33,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:33,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954828405] [2022-11-03 04:09:33,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954828405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:33,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504270548] [2022-11-03 04:09:33,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:09:33,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:33,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:33,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:33,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 04:09:33,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:09:33,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:33,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 04:09:33,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:09:33,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:09:33,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504270548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:33,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [844290546] [2022-11-03 04:09:33,468 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:33,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:33,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-03 04:09:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523451592] [2022-11-03 04:09:33,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:33,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 04:09:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 04:09:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-03 04:09:33,473 INFO L87 Difference]: Start difference. First operand 58 states and 142 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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-03 04:09:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:34,052 INFO L93 Difference]: Finished difference Result 161 states and 379 transitions. [2022-11-03 04:09:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 04:09:34,053 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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 14 [2022-11-03 04:09:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:34,054 INFO L225 Difference]: With dead ends: 161 [2022-11-03 04:09:34,054 INFO L226 Difference]: Without dead ends: 118 [2022-11-03 04:09:34,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=965, Unknown=0, NotChecked=0, Total=1406 [2022-11-03 04:09:34,056 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:34,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:09:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-03 04:09:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 67. [2022-11-03 04:09:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.5606060606060606) internal successors, (169), 66 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 169 transitions. [2022-11-03 04:09:34,060 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 169 transitions. Word has length 14 [2022-11-03 04:09:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:34,060 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 169 transitions. [2022-11-03 04:09:34,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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-03 04:09:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 169 transitions. [2022-11-03 04:09:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:09:34,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:34,061 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:34,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:34,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:34,279 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash -777942070, now seen corresponding path program 9 times [2022-11-03 04:09:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:34,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333916680] [2022-11-03 04:09:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:09:34,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:34,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333916680] [2022-11-03 04:09:34,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333916680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:34,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170555420] [2022-11-03 04:09:34,486 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:09:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:34,504 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:34,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 04:09:34,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:09:34,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:34,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 04:09:34,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:09:34,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:09:34,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170555420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:34,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [97526800] [2022-11-03 04:09:34,859 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:34,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:34,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-03 04:09:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80714126] [2022-11-03 04:09:34,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:34,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 04:09:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 04:09:34,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:09:34,862 INFO L87 Difference]: Start difference. First operand 67 states and 169 transitions. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:35,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:35,539 INFO L93 Difference]: Finished difference Result 153 states and 368 transitions. [2022-11-03 04:09:35,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 04:09:35,540 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 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 15 [2022-11-03 04:09:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:35,541 INFO L225 Difference]: With dead ends: 153 [2022-11-03 04:09:35,541 INFO L226 Difference]: Without dead ends: 102 [2022-11-03 04:09:35,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=598, Invalid=1294, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 04:09:35,542 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:35,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:09:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-03 04:09:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2022-11-03 04:09:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.4615384615384617) internal successors, (128), 52 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 128 transitions. [2022-11-03 04:09:35,546 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 128 transitions. Word has length 15 [2022-11-03 04:09:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:35,546 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 128 transitions. [2022-11-03 04:09:35,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 128 transitions. [2022-11-03 04:09:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 04:09:35,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:35,547 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:35,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:35,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:35,748 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:35,749 INFO L85 PathProgramCache]: Analyzing trace with hash -137032451, now seen corresponding path program 10 times [2022-11-03 04:09:35,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:35,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723839843] [2022-11-03 04:09:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:35,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:36,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:36,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723839843] [2022-11-03 04:09:36,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723839843] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:36,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007389115] [2022-11-03 04:09:36,003 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:09:36,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:36,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:36,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:36,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 04:09:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:36,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 04:09:36,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:36,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:36,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007389115] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:36,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [141756498] [2022-11-03 04:09:36,451 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:36,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:36,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2022-11-03 04:09:36,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279487999] [2022-11-03 04:09:36,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:36,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:36,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:36,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:36,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2022-11-03 04:09:36,453 INFO L87 Difference]: Start difference. First operand 53 states and 128 transitions. Second operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:37,923 INFO L93 Difference]: Finished difference Result 188 states and 463 transitions. [2022-11-03 04:09:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-03 04:09:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 04:09:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:37,924 INFO L225 Difference]: With dead ends: 188 [2022-11-03 04:09:37,924 INFO L226 Difference]: Without dead ends: 108 [2022-11-03 04:09:37,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1988, Invalid=4332, Unknown=0, NotChecked=0, Total=6320 [2022-11-03 04:09:37,927 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 348 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:37,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 0 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:09:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-03 04:09:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2022-11-03 04:09:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.4814814814814814) internal successors, (201), 81 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 201 transitions. [2022-11-03 04:09:37,931 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 201 transitions. Word has length 20 [2022-11-03 04:09:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:37,931 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 201 transitions. [2022-11-03 04:09:37,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 201 transitions. [2022-11-03 04:09:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:09:37,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:37,932 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:37,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:38,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:38,148 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1570987787, now seen corresponding path program 11 times [2022-11-03 04:09:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783386845] [2022-11-03 04:09:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:38,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:38,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783386845] [2022-11-03 04:09:38,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783386845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:38,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933650823] [2022-11-03 04:09:38,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:09:38,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:38,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:38,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 04:09:38,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-03 04:09:38,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:38,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 04:09:38,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:39,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:40,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933650823] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:40,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [725695102] [2022-11-03 04:09:40,009 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:40,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:40,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 49 [2022-11-03 04:09:40,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490118324] [2022-11-03 04:09:40,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:40,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-03 04:09:40,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:40,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-03 04:09:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=1941, Unknown=0, NotChecked=0, Total=2550 [2022-11-03 04:09:40,013 INFO L87 Difference]: Start difference. First operand 82 states and 201 transitions. Second operand has 51 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:41,501 INFO L93 Difference]: Finished difference Result 203 states and 444 transitions. [2022-11-03 04:09:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-03 04:09:41,504 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:09:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:41,505 INFO L225 Difference]: With dead ends: 203 [2022-11-03 04:09:41,505 INFO L226 Difference]: Without dead ends: 148 [2022-11-03 04:09:41,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2444, Invalid=5746, Unknown=0, NotChecked=0, Total=8190 [2022-11-03 04:09:41,509 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:41,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:09:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-03 04:09:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 100. [2022-11-03 04:09:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.404040404040404) internal successors, (238), 99 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 238 transitions. [2022-11-03 04:09:41,514 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 238 transitions. Word has length 30 [2022-11-03 04:09:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:41,515 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 238 transitions. [2022-11-03 04:09:41,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 238 transitions. [2022-11-03 04:09:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:09:41,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:41,516 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:41,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:41,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 04:09:41,740 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:41,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2111502647, now seen corresponding path program 12 times [2022-11-03 04:09:41,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:41,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263619943] [2022-11-03 04:09:41,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:41,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:42,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:42,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263619943] [2022-11-03 04:09:42,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263619943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:42,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241584505] [2022-11-03 04:09:42,348 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:09:42,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:42,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:42,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:42,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 04:09:42,447 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:09:42,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:42,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 04:09:42,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:42,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:43,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241584505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:43,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1285260432] [2022-11-03 04:09:43,409 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:43,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:43,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-11-03 04:09:43,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16532190] [2022-11-03 04:09:43,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:43,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 04:09:43,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:43,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 04:09:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=1870, Unknown=0, NotChecked=0, Total=2450 [2022-11-03 04:09:43,413 INFO L87 Difference]: Start difference. First operand 100 states and 238 transitions. Second operand has 50 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:44,909 INFO L93 Difference]: Finished difference Result 311 states and 663 transitions. [2022-11-03 04:09:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-03 04:09:44,910 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:09:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:44,932 INFO L225 Difference]: With dead ends: 311 [2022-11-03 04:09:44,932 INFO L226 Difference]: Without dead ends: 256 [2022-11-03 04:09:44,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2540 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2862, Invalid=6840, Unknown=0, NotChecked=0, Total=9702 [2022-11-03 04:09:44,935 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:44,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:09:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-03 04:09:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 103. [2022-11-03 04:09:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.4215686274509802) internal successors, (247), 102 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 247 transitions. [2022-11-03 04:09:44,948 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 247 transitions. Word has length 30 [2022-11-03 04:09:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:44,949 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 247 transitions. [2022-11-03 04:09:44,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 247 transitions. [2022-11-03 04:09:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:09:44,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:44,951 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:44,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-03 04:09:45,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 04:09:45,175 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash -554241197, now seen corresponding path program 13 times [2022-11-03 04:09:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:45,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831714248] [2022-11-03 04:09:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:45,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:45,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831714248] [2022-11-03 04:09:45,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831714248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:45,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524694812] [2022-11-03 04:09:45,764 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:09:45,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:45,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:45,765 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:45,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 04:09:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:45,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 04:09:45,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:46,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:46,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524694812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:46,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [852436380] [2022-11-03 04:09:46,856 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:46,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:46,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 49 [2022-11-03 04:09:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39241807] [2022-11-03 04:09:46,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:46,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-03 04:09:46,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:46,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-03 04:09:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=2056, Unknown=0, NotChecked=0, Total=2550 [2022-11-03 04:09:46,859 INFO L87 Difference]: Start difference. First operand 103 states and 247 transitions. Second operand has 51 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:48,807 INFO L93 Difference]: Finished difference Result 320 states and 686 transitions. [2022-11-03 04:09:48,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-03 04:09:48,808 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:09:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:48,809 INFO L225 Difference]: With dead ends: 320 [2022-11-03 04:09:48,810 INFO L226 Difference]: Without dead ends: 263 [2022-11-03 04:09:48,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2972 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2991, Invalid=8139, Unknown=0, NotChecked=0, Total=11130 [2022-11-03 04:09:48,813 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:48,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:09:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-03 04:09:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 109. [2022-11-03 04:09:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.4444444444444446) internal successors, (264), 108 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 264 transitions. [2022-11-03 04:09:48,819 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 264 transitions. Word has length 30 [2022-11-03 04:09:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:48,820 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 264 transitions. [2022-11-03 04:09:48,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:48,820 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 264 transitions. [2022-11-03 04:09:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:09:48,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:48,821 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:48,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:49,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 04:09:49,035 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash 965026009, now seen corresponding path program 14 times [2022-11-03 04:09:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:49,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842516375] [2022-11-03 04:09:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:49,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:49,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842516375] [2022-11-03 04:09:49,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842516375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:49,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840740995] [2022-11-03 04:09:49,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:09:49,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:49,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:49,569 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:49,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 04:09:49,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-03 04:09:49,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:49,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 04:09:49,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:49,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:50,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840740995] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:50,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [946852757] [2022-11-03 04:09:50,533 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:50,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:50,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-11-03 04:09:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731917388] [2022-11-03 04:09:50,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:50,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 04:09:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 04:09:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=2018, Unknown=0, NotChecked=0, Total=2450 [2022-11-03 04:09:50,537 INFO L87 Difference]: Start difference. First operand 109 states and 264 transitions. Second operand has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:52,589 INFO L93 Difference]: Finished difference Result 317 states and 691 transitions. [2022-11-03 04:09:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-03 04:09:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:09:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:52,591 INFO L225 Difference]: With dead ends: 317 [2022-11-03 04:09:52,592 INFO L226 Difference]: Without dead ends: 260 [2022-11-03 04:09:52,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3834 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3412, Invalid=9698, Unknown=0, NotChecked=0, Total=13110 [2022-11-03 04:09:52,595 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:52,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:09:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-03 04:09:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 120. [2022-11-03 04:09:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.495798319327731) internal successors, (297), 119 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 297 transitions. [2022-11-03 04:09:52,602 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 297 transitions. Word has length 30 [2022-11-03 04:09:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:52,602 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 297 transitions. [2022-11-03 04:09:52,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 297 transitions. [2022-11-03 04:09:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:09:52,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:52,603 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:52,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:52,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 04:09:52,823 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash -282555533, now seen corresponding path program 15 times [2022-11-03 04:09:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:52,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226380945] [2022-11-03 04:09:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:52,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:53,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:53,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226380945] [2022-11-03 04:09:53,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226380945] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:53,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251956112] [2022-11-03 04:09:53,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:09:53,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:53,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:53,304 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:53,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 04:09:53,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:09:53,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:53,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 04:09:53,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:53,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:54,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251956112] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:54,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [26188672] [2022-11-03 04:09:54,115 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:54,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:54,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 49 [2022-11-03 04:09:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529919758] [2022-11-03 04:09:54,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:54,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-03 04:09:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:54,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-03 04:09:54,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=2012, Unknown=0, NotChecked=0, Total=2550 [2022-11-03 04:09:54,119 INFO L87 Difference]: Start difference. First operand 120 states and 297 transitions. Second operand has 51 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:57,098 INFO L93 Difference]: Finished difference Result 349 states and 821 transitions. [2022-11-03 04:09:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-03 04:09:57,099 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:09:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:57,100 INFO L225 Difference]: With dead ends: 349 [2022-11-03 04:09:57,101 INFO L226 Difference]: Without dead ends: 235 [2022-11-03 04:09:57,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5365 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4860, Invalid=11910, Unknown=0, NotChecked=0, Total=16770 [2022-11-03 04:09:57,103 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 681 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 668 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:57,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 0 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [668 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:09:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-03 04:09:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 113. [2022-11-03 04:09:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.4910714285714284) internal successors, (279), 112 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 279 transitions. [2022-11-03 04:09:57,109 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 279 transitions. Word has length 30 [2022-11-03 04:09:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:57,110 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 279 transitions. [2022-11-03 04:09:57,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 279 transitions. [2022-11-03 04:09:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 04:09:57,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:57,111 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:57,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-03 04:09:57,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:57,327 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:09:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:57,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1050808382, now seen corresponding path program 16 times [2022-11-03 04:09:57,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:57,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257369216] [2022-11-03 04:09:57,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:57,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:58,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:58,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257369216] [2022-11-03 04:09:58,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257369216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:58,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215263789] [2022-11-03 04:09:58,285 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:09:58,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:58,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:58,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:58,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 04:09:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:58,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 04:09:58,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:58,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:59,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215263789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:59,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [277925662] [2022-11-03 04:09:59,467 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:59,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:59,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2022-11-03 04:09:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177506279] [2022-11-03 04:09:59,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:59,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-03 04:09:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:59,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-03 04:09:59,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1499, Invalid=4821, Unknown=0, NotChecked=0, Total=6320 [2022-11-03 04:09:59,471 INFO L87 Difference]: Start difference. First operand 113 states and 279 transitions. Second operand has 80 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:02,443 INFO L93 Difference]: Finished difference Result 299 states and 710 transitions. [2022-11-03 04:10:02,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-03 04:10:02,444 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-03 04:10:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:02,446 INFO L225 Difference]: With dead ends: 299 [2022-11-03 04:10:02,446 INFO L226 Difference]: Without dead ends: 261 [2022-11-03 04:10:02,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8713 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7728, Invalid=19332, Unknown=0, NotChecked=0, Total=27060 [2022-11-03 04:10:02,449 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 433 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:02,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 0 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:10:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-03 04:10:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 120. [2022-11-03 04:10:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.5126050420168067) internal successors, (299), 119 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 299 transitions. [2022-11-03 04:10:02,455 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 299 transitions. Word has length 45 [2022-11-03 04:10:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:02,455 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 299 transitions. [2022-11-03 04:10:02,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 299 transitions. [2022-11-03 04:10:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 04:10:02,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:02,457 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:02,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:02,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:02,671 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:10:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash 458126855, now seen corresponding path program 17 times [2022-11-03 04:10:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:02,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027758561] [2022-11-03 04:10:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:02,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:03,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:03,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027758561] [2022-11-03 04:10:03,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027758561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:03,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687933236] [2022-11-03 04:10:03,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:10:03,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:03,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:03,664 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:03,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 04:10:03,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2022-11-03 04:10:03,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:10:03,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 04:10:03,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:03,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:04,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687933236] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:04,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [582771055] [2022-11-03 04:10:04,933 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:10:04,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:04,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 80 [2022-11-03 04:10:04,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719560983] [2022-11-03 04:10:04,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:04,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-03 04:10:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:04,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-03 04:10:04,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1571, Invalid=5071, Unknown=0, NotChecked=0, Total=6642 [2022-11-03 04:10:04,938 INFO L87 Difference]: Start difference. First operand 120 states and 299 transitions. Second operand has 82 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 81 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:08,026 INFO L93 Difference]: Finished difference Result 226 states and 556 transitions. [2022-11-03 04:10:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-03 04:10:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 81 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-03 04:10:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:08,028 INFO L225 Difference]: With dead ends: 226 [2022-11-03 04:10:08,028 INFO L226 Difference]: Without dead ends: 213 [2022-11-03 04:10:08,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8366 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7233, Invalid=18527, Unknown=0, NotChecked=0, Total=25760 [2022-11-03 04:10:08,031 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 463 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:08,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 0 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:10:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-03 04:10:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 162. [2022-11-03 04:10:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.627329192546584) internal successors, (423), 161 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 423 transitions. [2022-11-03 04:10:08,037 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 423 transitions. Word has length 46 [2022-11-03 04:10:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:08,038 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 423 transitions. [2022-11-03 04:10:08,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 81 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 423 transitions. [2022-11-03 04:10:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 04:10:08,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:08,039 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:08,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:08,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:08,255 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 04:10:08,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:08,256 INFO L85 PathProgramCache]: Analyzing trace with hash -754584573, now seen corresponding path program 18 times [2022-11-03 04:10:08,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:08,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557363394] [2022-11-03 04:10:08,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 04:10:08,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 04:10:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 04:10:08,366 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 04:10:08,367 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 04:10:08,368 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-03 04:10:08,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-03 04:10:08,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-03 04:10:08,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 04:10:08,373 INFO L444 BasicCegarLoop]: Path program histogram: [18, 2, 1, 1] [2022-11-03 04:10:08,380 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 04:10:08,380 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 04:10:08,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:10:08 BasicIcfg [2022-11-03 04:10:08,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 04:10:08,461 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 04:10:08,461 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 04:10:08,461 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 04:10:08,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:09:24" (3/4) ... [2022-11-03 04:10:08,464 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 04:10:08,532 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 04:10:08,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 04:10:08,533 INFO L158 Benchmark]: Toolchain (without parser) took 45055.80ms. Allocated memory was 107.0MB in the beginning and 197.1MB in the end (delta: 90.2MB). Free memory was 70.3MB in the beginning and 62.3MB in the end (delta: 8.0MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2022-11-03 04:10:08,533 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 107.0MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:10:08,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 647.16ms. Allocated memory is still 107.0MB. Free memory was 70.1MB in the beginning and 72.8MB in the end (delta: -2.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 04:10:08,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.01ms. Allocated memory is still 107.0MB. Free memory was 72.8MB in the beginning and 70.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 04:10:08,534 INFO L158 Benchmark]: Boogie Preprocessor took 61.28ms. Allocated memory is still 107.0MB. Free memory was 70.6MB in the beginning and 69.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 04:10:08,535 INFO L158 Benchmark]: RCFGBuilder took 458.83ms. Allocated memory is still 107.0MB. Free memory was 69.3MB in the beginning and 57.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 04:10:08,535 INFO L158 Benchmark]: TraceAbstraction took 43743.83ms. Allocated memory was 107.0MB in the beginning and 197.1MB in the end (delta: 90.2MB). Free memory was 56.4MB in the beginning and 75.9MB in the end (delta: -19.5MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2022-11-03 04:10:08,535 INFO L158 Benchmark]: Witness Printer took 71.36ms. Allocated memory is still 197.1MB. Free memory was 75.9MB in the beginning and 62.3MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 04:10:08,537 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 107.0MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 647.16ms. Allocated memory is still 107.0MB. Free memory was 70.1MB in the beginning and 72.8MB in the end (delta: -2.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.01ms. Allocated memory is still 107.0MB. Free memory was 72.8MB in the beginning and 70.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.28ms. Allocated memory is still 107.0MB. Free memory was 70.6MB in the beginning and 69.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.83ms. Allocated memory is still 107.0MB. Free memory was 69.3MB in the beginning and 57.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 43743.83ms. Allocated memory was 107.0MB in the beginning and 197.1MB in the end (delta: 90.2MB). Free memory was 56.4MB in the beginning and 75.9MB in the end (delta: -19.5MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. * Witness Printer took 71.36ms. Allocated memory is still 197.1MB. Free memory was 75.9MB in the beginning and 62.3MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 72 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 16 TransitionsAfterwards, 1122 CoEnabledTransitionPairs, 5 FixpointIterations, 21 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 64 TotalNumberOfCompositions, 1006 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 917, positive: 894, positive conditional: 0, positive unconditional: 894, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 751, positive: 738, positive conditional: 0, positive unconditional: 738, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 751, positive: 738, positive conditional: 0, positive unconditional: 738, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 917, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 751, unknown conditional: 0, unknown unconditional: 751] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, argc=51, argv={50:49}, argv={50:49}, i=3, id1={5:0}, id2={3:0}, j=6, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-2] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, arg={0:0}, argc=51, argv={50:49}, argv={50:49}, i=3, id1={5:0}, id2={3:0}, j=6, pthread_create(&id2, ((void *)0), t2, ((void *)0))=-1] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(argc)=51, arg={0:0}, arg={0:0}, argc=51, argv={50:49}, argv={50:49}, condI=0, i=3, id1={5:0}, id2={3:0}, j=6] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1, k=0] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=2, k=1] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=3, k=2] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=4, k=3] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=4] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=7, k=6] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=10] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=13, k=12] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=14, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=16, k=15] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=19, k=18] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=20, k=19] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 int condJ = j >= (2*20 +6); [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={50:49}, argv={50:49}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=20, k=20] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 43.5s, OverallIterations: 22, TraceHistogramMax: 20, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3402 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3402 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1470 mSDsCounter, 3686 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4146 IncrementalHoareTripleChecker+Invalid, 7832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3686 mSolverCounterUnsat, 0 mSDtfsCounter, 4146 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1487 GetRequests, 362 SyntacticMatches, 9 SemanticMatches, 1116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36822 ImplicationChecksByTransitivity, 22.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=21, InterpolantAutomatonStates: 688, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 1062 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 764 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 992 ConstructedInterpolants, 0 QuantifiedInterpolants, 4458 SizeOfPredicates, 218 NumberOfNonLiveVariables, 2520 ConjunctsInSsa, 297 ConjunctsInUnsatCore, 47 InterpolantComputations, 8 PerfectInterpolantSequences, 6/3795 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 04:10:08,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9234917f-6b32-401e-9379-62b1f619d1e6/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE