./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS --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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- 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-8393723 [2022-11-19 06:52:47,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:52:47,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:52:47,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:52:47,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:52:47,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:52:47,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:52:47,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:52:47,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:52:47,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:52:47,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:52:47,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:52:47,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:52:47,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:52:47,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:52:47,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:52:47,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:52:47,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:52:47,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:52:47,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:52:47,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:52:47,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:52:47,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:52:47,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:52:47,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:52:47,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:52:47,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:52:47,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:52:47,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:52:47,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:52:47,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:52:47,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:52:47,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:52:47,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:52:47,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:52:47,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:52:47,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:52:47,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:52:47,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:52:47,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:52:47,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:52:47,116 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 06:52:47,146 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:52:47,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:52:47,147 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:52:47,148 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:52:47,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:52:47,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:52:47,149 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:52:47,149 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:52:47,150 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:52:47,150 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:52:47,150 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:52:47,150 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:52:47,151 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:52:47,151 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:52:47,151 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:52:47,152 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:52:47,152 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:52:47,152 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:52:47,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:52:47,153 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:52:47,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:52:47,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:52:47,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:52:47,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:52:47,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:52:47,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:52:47,156 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:52:47,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:52:47,156 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:52:47,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:52:47,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:52:47,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:52:47,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:52:47,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:52:47,158 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:52:47,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:52:47,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:52:47,159 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:52:47,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:52:47,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:52:47,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:52:47,160 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_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/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_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-11-19 06:52:47,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:52:47,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:52:47,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:52:47,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:52:47,499 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:52:47,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-19 06:52:47,581 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/data/0abdf6200/e75c042b67334d399e7f1c00b9613f26/FLAG47082c414 [2022-11-19 06:52:48,299 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:52:48,300 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-19 06:52:48,330 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/data/0abdf6200/e75c042b67334d399e7f1c00b9613f26/FLAG47082c414 [2022-11-19 06:52:48,541 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/data/0abdf6200/e75c042b67334d399e7f1c00b9613f26 [2022-11-19 06:52:48,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:52:48,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:52:48,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:52:48,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:52:48,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:52:48,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:52:48" (1/1) ... [2022-11-19 06:52:48,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12df7f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:48, skipping insertion in model container [2022-11-19 06:52:48,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:52:48" (1/1) ... [2022-11-19 06:52:48,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:52:48,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:52:49,286 WARN L234 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_c562c700-6c43-4f7c-a480-f75b271979ac/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-19 06:52:49,295 WARN L234 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_c562c700-6c43-4f7c-a480-f75b271979ac/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-19 06:52:49,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:52:49,313 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:52:49,413 WARN L234 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_c562c700-6c43-4f7c-a480-f75b271979ac/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-19 06:52:49,417 WARN L234 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_c562c700-6c43-4f7c-a480-f75b271979ac/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-19 06:52:49,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:52:49,511 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:52:49,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49 WrapperNode [2022-11-19 06:52:49,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:52:49,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:52:49,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:52:49,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:52:49,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,603 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-19 06:52:49,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:52:49,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:52:49,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:52:49,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:52:49,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,645 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:52:49,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:52:49,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:52:49,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:52:49,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (1/1) ... [2022-11-19 06:52:49,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:52:49,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:52:49,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:52:49,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:52:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-19 06:52:49,771 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-19 06:52:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-19 06:52:49,771 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-19 06:52:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:52:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:52:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 06:52:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:52:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-19 06:52:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:52:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:52:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:52:49,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:52:49,775 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 06:52:49,965 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:52:49,968 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:52:50,536 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:52:50,548 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:52:50,553 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-19 06:52:50,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:52:50 BoogieIcfgContainer [2022-11-19 06:52:50,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:52:50,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:52:50,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:52:50,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:52:50,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:52:48" (1/3) ... [2022-11-19 06:52:50,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cec4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:52:50, skipping insertion in model container [2022-11-19 06:52:50,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:52:49" (2/3) ... [2022-11-19 06:52:50,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cec4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:52:50, skipping insertion in model container [2022-11-19 06:52:50,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:52:50" (3/3) ... [2022-11-19 06:52:50,569 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-19 06:52:50,580 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 06:52:50,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:52:50,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 06:52:50,593 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 06:52:50,717 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-19 06:52:50,764 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 06:52:50,785 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-19 06:52:50,788 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-19 06:52:50,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-11-19 06:52:50,987 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-11-19 06:52:50,988 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-19 06:52:51,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 227 events. 13/227 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-11-19 06:52:51,012 INFO L119 LiptonReduction]: Number of co-enabled transitions 10630 [2022-11-19 06:53:05,333 INFO L134 LiptonReduction]: Checked pairs total: 20641 [2022-11-19 06:53:05,334 INFO L136 LiptonReduction]: Total number of compositions: 211 [2022-11-19 06:53:05,345 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 53 transitions, 122 flow [2022-11-19 06:53:05,421 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 579 states, 577 states have (on average 2.681109185441941) internal successors, (1547), 578 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:05,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:53:05,453 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;@a611cc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:53:05,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-19 06:53:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 579 states, 577 states have (on average 2.681109185441941) internal successors, (1547), 578 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 06:53:05,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:05,463 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 06:53:05,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash 896, now seen corresponding path program 1 times [2022-11-19 06:53:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:05,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475020322] [2022-11-19 06:53:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:05,636 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-19 06:53:05,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:05,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475020322] [2022-11-19 06:53:05,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475020322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:05,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:53:05,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 06:53:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458813282] [2022-11-19 06:53:05,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:05,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 06:53:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 06:53:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 06:53:05,688 INFO L87 Difference]: Start difference. First operand has 579 states, 577 states have (on average 2.681109185441941) internal successors, (1547), 578 states have internal predecessors, (1547), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:05,828 INFO L93 Difference]: Finished difference Result 578 states and 1546 transitions. [2022-11-19 06:53:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 06:53:05,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-19 06:53:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:05,851 INFO L225 Difference]: With dead ends: 578 [2022-11-19 06:53:05,851 INFO L226 Difference]: Without dead ends: 578 [2022-11-19 06:53:05,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 06:53:05,856 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:05,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:53:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-19 06:53:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2022-11-19 06:53:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 2.679376083188908) internal successors, (1546), 577 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1546 transitions. [2022-11-19 06:53:05,987 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1546 transitions. Word has length 1 [2022-11-19 06:53:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:05,988 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 1546 transitions. [2022-11-19 06:53:05,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1546 transitions. [2022-11-19 06:53:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 06:53:06,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:06,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:06,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:53:06,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -126209710, now seen corresponding path program 1 times [2022-11-19 06:53:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:06,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237011228] [2022-11-19 06:53:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:06,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:06,452 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-19 06:53:06,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:06,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237011228] [2022-11-19 06:53:06,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237011228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:06,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:53:06,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:53:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227147701] [2022-11-19 06:53:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:06,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:53:06,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:06,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:53:06,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:53:06,467 INFO L87 Difference]: Start difference. First operand 578 states and 1546 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:06,575 INFO L93 Difference]: Finished difference Result 236 states and 510 transitions. [2022-11-19 06:53:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:53:06,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 06:53:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:06,577 INFO L225 Difference]: With dead ends: 236 [2022-11-19 06:53:06,577 INFO L226 Difference]: Without dead ends: 214 [2022-11-19 06:53:06,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:53:06,579 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:06,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:53:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-19 06:53:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-11-19 06:53:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.1971830985915495) internal successors, (468), 213 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 468 transitions. [2022-11-19 06:53:06,595 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 468 transitions. Word has length 16 [2022-11-19 06:53:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:06,595 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 468 transitions. [2022-11-19 06:53:06,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 468 transitions. [2022-11-19 06:53:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:53:06,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:06,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:06,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:53:06,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:06,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:06,599 INFO L85 PathProgramCache]: Analyzing trace with hash 223041115, now seen corresponding path program 1 times [2022-11-19 06:53:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:06,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287450045] [2022-11-19 06:53:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:06,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:06,698 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-19 06:53:06,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:06,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287450045] [2022-11-19 06:53:06,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287450045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:06,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:53:06,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:53:06,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678218836] [2022-11-19 06:53:06,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:06,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:53:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:53:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:53:06,701 INFO L87 Difference]: Start difference. First operand 214 states and 468 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:06,821 INFO L93 Difference]: Finished difference Result 274 states and 594 transitions. [2022-11-19 06:53:06,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:53:06,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-19 06:53:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:06,823 INFO L225 Difference]: With dead ends: 274 [2022-11-19 06:53:06,824 INFO L226 Difference]: Without dead ends: 274 [2022-11-19 06:53:06,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:53:06,825 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:06,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:53:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-19 06:53:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 220. [2022-11-19 06:53:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.191780821917808) internal successors, (480), 219 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 480 transitions. [2022-11-19 06:53:06,840 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 480 transitions. Word has length 20 [2022-11-19 06:53:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:06,840 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 480 transitions. [2022-11-19 06:53:06,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 480 transitions. [2022-11-19 06:53:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 06:53:06,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:06,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:06,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:53:06,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1481011095, now seen corresponding path program 1 times [2022-11-19 06:53:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:06,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161284430] [2022-11-19 06:53:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:06,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:07,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:07,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161284430] [2022-11-19 06:53:07,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161284430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:07,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:53:07,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:53:07,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629072193] [2022-11-19 06:53:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:07,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:53:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:07,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:53:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:53:07,087 INFO L87 Difference]: Start difference. First operand 220 states and 480 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:07,194 INFO L93 Difference]: Finished difference Result 164 states and 328 transitions. [2022-11-19 06:53:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:53:07,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 06:53:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:07,196 INFO L225 Difference]: With dead ends: 164 [2022-11-19 06:53:07,196 INFO L226 Difference]: Without dead ends: 162 [2022-11-19 06:53:07,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:53:07,200 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:07,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:53:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-19 06:53:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-11-19 06:53:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.018633540372671) internal successors, (325), 161 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 325 transitions. [2022-11-19 06:53:07,213 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 325 transitions. Word has length 27 [2022-11-19 06:53:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:07,214 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 325 transitions. [2022-11-19 06:53:07,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 325 transitions. [2022-11-19 06:53:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:53:07,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:07,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:07,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:53:07,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:07,229 INFO L85 PathProgramCache]: Analyzing trace with hash -666955131, now seen corresponding path program 1 times [2022-11-19 06:53:07,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:07,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872370197] [2022-11-19 06:53:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:07,456 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-19 06:53:07,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:07,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872370197] [2022-11-19 06:53:07,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872370197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:07,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880456519] [2022-11-19 06:53:07,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:07,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:07,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:07,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:53:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:07,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:53:07,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:07,736 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-19 06:53:07,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:53:07,776 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-19 06:53:07,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880456519] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:53:07,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [400820485] [2022-11-19 06:53:07,786 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-19 06:53:07,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:07,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-19 06:53:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888575110] [2022-11-19 06:53:07,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:53:07,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:53:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:53:07,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:53:07,796 INFO L87 Difference]: Start difference. First operand 162 states and 325 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:08,072 INFO L93 Difference]: Finished difference Result 282 states and 547 transitions. [2022-11-19 06:53:08,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:53:08,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-19 06:53:08,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:08,075 INFO L225 Difference]: With dead ends: 282 [2022-11-19 06:53:08,075 INFO L226 Difference]: Without dead ends: 282 [2022-11-19 06:53:08,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:53:08,076 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:08,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 13 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:53:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-19 06:53:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-19 06:53:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.9466192170818506) internal successors, (547), 281 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 547 transitions. [2022-11-19 06:53:08,089 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 547 transitions. Word has length 28 [2022-11-19 06:53:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:08,090 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 547 transitions. [2022-11-19 06:53:08,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 547 transitions. [2022-11-19 06:53:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-19 06:53:08,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:08,092 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:08,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:08,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:08,300 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -952871877, now seen corresponding path program 2 times [2022-11-19 06:53:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:08,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529288531] [2022-11-19 06:53:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:08,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:08,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529288531] [2022-11-19 06:53:08,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529288531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:08,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093723303] [2022-11-19 06:53:08,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:53:08,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:08,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:08,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:08,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:53:09,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-19 06:53:09,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:53:09,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-19 06:53:09,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:09,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:53:09,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:09,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:53:09,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:09,938 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 06:53:09,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-19 06:53:10,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:10,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 06:53:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 06:53:10,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:53:10,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093723303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:10,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:53:10,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-11-19 06:53:10,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192141842] [2022-11-19 06:53:10,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:10,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:53:10,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:10,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:53:10,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-19 06:53:10,069 INFO L87 Difference]: Start difference. First operand 282 states and 547 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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-19 06:53:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:10,352 INFO L93 Difference]: Finished difference Result 442 states and 847 transitions. [2022-11-19 06:53:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:53:10,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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 49 [2022-11-19 06:53:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:10,356 INFO L225 Difference]: With dead ends: 442 [2022-11-19 06:53:10,356 INFO L226 Difference]: Without dead ends: 442 [2022-11-19 06:53:10,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-19 06:53:10,358 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 98 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:10,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 8 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:53:10,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-19 06:53:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 358. [2022-11-19 06:53:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.9131652661064427) internal successors, (683), 357 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 683 transitions. [2022-11-19 06:53:10,376 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 683 transitions. Word has length 49 [2022-11-19 06:53:10,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:10,377 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 683 transitions. [2022-11-19 06:53:10,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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-19 06:53:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 683 transitions. [2022-11-19 06:53:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-19 06:53:10,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:10,379 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:10,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:10,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-19 06:53:10,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash -392639782, now seen corresponding path program 1 times [2022-11-19 06:53:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:10,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908444042] [2022-11-19 06:53:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:10,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:10,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908444042] [2022-11-19 06:53:10,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908444042] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:10,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2318871] [2022-11-19 06:53:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:10,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:10,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:10,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:10,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:53:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:11,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:53:11,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:11,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:53:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:11,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2318871] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:53:11,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [155256292] [2022-11-19 06:53:11,425 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-19 06:53:11,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:11,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-19 06:53:11,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976641677] [2022-11-19 06:53:11,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:53:11,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 06:53:11,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:11,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 06:53:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-19 06:53:11,428 INFO L87 Difference]: Start difference. First operand 358 states and 683 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:11,820 INFO L93 Difference]: Finished difference Result 736 states and 1367 transitions. [2022-11-19 06:53:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 06:53:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-19 06:53:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:11,825 INFO L225 Difference]: With dead ends: 736 [2022-11-19 06:53:11,825 INFO L226 Difference]: Without dead ends: 736 [2022-11-19 06:53:11,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-19 06:53:11,826 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 198 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:11,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 18 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:53:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-11-19 06:53:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2022-11-19 06:53:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 1.8598639455782313) internal successors, (1367), 735 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1367 transitions. [2022-11-19 06:53:11,855 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1367 transitions. Word has length 50 [2022-11-19 06:53:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:11,858 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1367 transitions. [2022-11-19 06:53:11,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1367 transitions. [2022-11-19 06:53:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-19 06:53:11,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:11,864 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:11,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:12,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-19 06:53:12,071 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1781456079, now seen corresponding path program 2 times [2022-11-19 06:53:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:12,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455712052] [2022-11-19 06:53:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:12,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:12,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455712052] [2022-11-19 06:53:12,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455712052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:12,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791178499] [2022-11-19 06:53:12,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:53:12,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:12,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:12,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:53:14,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-19 06:53:14,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:53:14,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-19 06:53:14,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:15,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:53:15,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:15,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:53:15,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:15,210 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 06:53:15,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-19 06:53:15,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:15,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 06:53:15,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 06:53:15,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:15,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:53:15,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:15,528 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-19 06:53:15,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-19 06:53:15,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:15,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 06:53:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 105 proven. 45 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-19 06:53:15,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:53:15,845 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_733) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_734)) .cse1)) 800))) is different from false [2022-11-19 06:53:15,870 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_734)) .cse1)) 800))) is different from false [2022-11-19 06:53:15,994 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_730 Int) (v_ArrVal_734 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_730) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_733) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_734)) .cse1))))) (= 800 .cse4)))) is different from false [2022-11-19 06:53:16,046 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_730 Int) (v_ArrVal_728 Int) (v_ArrVal_734 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_728)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (not (= (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_730) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_733) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_734)) .cse2)) 800)))))) is different from false [2022-11-19 06:53:16,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:53:16,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 164 [2022-11-19 06:53:16,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:53:16,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 262 [2022-11-19 06:53:16,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 230 [2022-11-19 06:53:16,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 189 [2022-11-19 06:53:16,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-19 06:53:16,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:53:16,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 124 [2022-11-19 06:53:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 59 proven. 58 refuted. 0 times theorem prover too weak. 133 trivial. 33 not checked. [2022-11-19 06:53:16,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791178499] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:53:16,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1892396711] [2022-11-19 06:53:16,911 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-19 06:53:16,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:16,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 36 [2022-11-19 06:53:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498970333] [2022-11-19 06:53:16,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:53:16,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 06:53:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 06:53:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=791, Unknown=14, NotChecked=252, Total=1260 [2022-11-19 06:53:16,919 INFO L87 Difference]: Start difference. First operand 736 states and 1367 transitions. Second operand has 36 states, 36 states have (on average 4.777777777777778) internal successors, (172), 36 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:27,992 INFO L93 Difference]: Finished difference Result 2301 states and 4059 transitions. [2022-11-19 06:53:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-11-19 06:53:27,993 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.777777777777778) internal successors, (172), 36 states have internal predecessors, (172), 0 states have call successors, (0), 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 95 [2022-11-19 06:53:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:28,004 INFO L225 Difference]: With dead ends: 2301 [2022-11-19 06:53:28,004 INFO L226 Difference]: Without dead ends: 2301 [2022-11-19 06:53:28,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 200 SyntacticMatches, 83 SemanticMatches, 132 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 12644 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=4242, Invalid=12530, Unknown=14, NotChecked=1036, Total=17822 [2022-11-19 06:53:28,013 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1596 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2113 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:28,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 44 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 682 Invalid, 0 Unknown, 2113 Unchecked, 1.2s Time] [2022-11-19 06:53:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2022-11-19 06:53:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 1272. [2022-11-19 06:53:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1271 states have (on average 1.825334382376082) internal successors, (2320), 1271 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2320 transitions. [2022-11-19 06:53:28,071 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2320 transitions. Word has length 95 [2022-11-19 06:53:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:28,072 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 2320 transitions. [2022-11-19 06:53:28,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.777777777777778) internal successors, (172), 36 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2320 transitions. [2022-11-19 06:53:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-19 06:53:28,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:28,076 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 7, 7, 7, 7, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:28,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:28,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:28,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:28,287 INFO L85 PathProgramCache]: Analyzing trace with hash -638702884, now seen corresponding path program 3 times [2022-11-19 06:53:28,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:28,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224083355] [2022-11-19 06:53:28,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:28,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:28,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224083355] [2022-11-19 06:53:28,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224083355] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:28,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380308843] [2022-11-19 06:53:28,893 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:53:28,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:28,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:28,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:28,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:53:29,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:53:29,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:53:29,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 06:53:29,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:29,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:53:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:29,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380308843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:53:29,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [484017678] [2022-11-19 06:53:29,876 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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-19 06:53:29,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:29,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-19 06:53:29,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682770573] [2022-11-19 06:53:29,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:53:29,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-19 06:53:29,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:29,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-19 06:53:29,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-19 06:53:29,879 INFO L87 Difference]: Start difference. First operand 1272 states and 2320 transitions. Second operand has 25 states, 25 states have (on average 7.48) internal successors, (187), 25 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:30,564 INFO L93 Difference]: Finished difference Result 2995 states and 5323 transitions. [2022-11-19 06:53:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 06:53:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.48) internal successors, (187), 25 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-19 06:53:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:30,579 INFO L225 Difference]: With dead ends: 2995 [2022-11-19 06:53:30,580 INFO L226 Difference]: Without dead ends: 2995 [2022-11-19 06:53:30,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-19 06:53:30,581 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 714 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:30,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 26 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 06:53:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2022-11-19 06:53:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2840. [2022-11-19 06:53:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2839 states have (on average 1.805917576611483) internal successors, (5127), 2839 states have internal predecessors, (5127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 5127 transitions. [2022-11-19 06:53:30,679 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 5127 transitions. Word has length 98 [2022-11-19 06:53:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:30,680 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 5127 transitions. [2022-11-19 06:53:30,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.48) internal successors, (187), 25 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 5127 transitions. [2022-11-19 06:53:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-11-19 06:53:30,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:30,688 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 16, 16, 16, 16, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:30,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:30,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:30,897 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1821236435, now seen corresponding path program 4 times [2022-11-19 06:53:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:30,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319250163] [2022-11-19 06:53:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 0 proven. 1567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:32,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:32,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319250163] [2022-11-19 06:53:32,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319250163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:32,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763346885] [2022-11-19 06:53:32,780 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 06:53:32,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:32,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:32,783 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:32,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:53:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:33,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-19 06:53:33,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 0 proven. 1567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:33,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:53:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 0 proven. 1567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:35,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763346885] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:53:35,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [222467522] [2022-11-19 06:53:35,058 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-19 06:53:35,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:35,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-11-19 06:53:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693069016] [2022-11-19 06:53:35,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:53:35,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-19 06:53:35,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:35,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-19 06:53:35,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 06:53:35,063 INFO L87 Difference]: Start difference. First operand 2840 states and 5127 transitions. Second operand has 49 states, 49 states have (on average 7.612244897959184) internal successors, (373), 49 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:36,652 INFO L93 Difference]: Finished difference Result 5888 states and 10551 transitions. [2022-11-19 06:53:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-19 06:53:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 7.612244897959184) internal successors, (373), 49 states have internal predecessors, (373), 0 states have call successors, (0), 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 191 [2022-11-19 06:53:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:36,681 INFO L225 Difference]: With dead ends: 5888 [2022-11-19 06:53:36,681 INFO L226 Difference]: Without dead ends: 5888 [2022-11-19 06:53:36,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 06:53:36,683 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1143 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:36,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 62 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-19 06:53:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5888 states. [2022-11-19 06:53:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5888 to 5888. [2022-11-19 06:53:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5888 states, 5887 states have (on average 1.792254119245796) internal successors, (10551), 5887 states have internal predecessors, (10551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5888 states to 5888 states and 10551 transitions. [2022-11-19 06:53:36,862 INFO L78 Accepts]: Start accepts. Automaton has 5888 states and 10551 transitions. Word has length 191 [2022-11-19 06:53:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:36,863 INFO L495 AbstractCegarLoop]: Abstraction has 5888 states and 10551 transitions. [2022-11-19 06:53:36,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 7.612244897959184) internal successors, (373), 49 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5888 states and 10551 transitions. [2022-11-19 06:53:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-11-19 06:53:36,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:36,887 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 46, 46, 34, 34, 34, 34, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:36,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:37,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-19 06:53:37,097 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1558393229, now seen corresponding path program 5 times [2022-11-19 06:53:37,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:37,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549474671] [2022-11-19 06:53:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:37,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7036 backedges. 0 proven. 7036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:42,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:42,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549474671] [2022-11-19 06:53:42,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549474671] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:42,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338529106] [2022-11-19 06:53:42,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:53:42,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:42,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:42,567 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:42,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:53:45,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-19 06:53:45,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:53:45,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-19 06:53:45,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:45,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:45,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:45,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:53:45,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:53:45,835 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:53:45,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 06:53:45,860 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 06:53:45,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 06:53:45,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-19 06:53:46,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 06:53:46,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 06:53:46,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-19 06:53:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7036 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 6810 trivial. 0 not checked. [2022-11-19 06:53:46,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:53:46,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338529106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:53:46,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:53:46,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [49] total 54 [2022-11-19 06:53:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25984993] [2022-11-19 06:53:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:53:46,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:53:46,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:46,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:53:46,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1191, Invalid=1671, Unknown=0, NotChecked=0, Total=2862 [2022-11-19 06:53:46,417 INFO L87 Difference]: Start difference. First operand 5888 states and 10551 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:53:46,618 INFO L93 Difference]: Finished difference Result 5897 states and 10566 transitions. [2022-11-19 06:53:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:53:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 377 [2022-11-19 06:53:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:53:46,644 INFO L225 Difference]: With dead ends: 5897 [2022-11-19 06:53:46,645 INFO L226 Difference]: Without dead ends: 5897 [2022-11-19 06:53:46,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1198, Invalid=1772, Unknown=0, NotChecked=0, Total=2970 [2022-11-19 06:53:46,646 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:53:46,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 106 Unchecked, 0.1s Time] [2022-11-19 06:53:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2022-11-19 06:53:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 5897. [2022-11-19 06:53:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5897 states, 5896 states have (on average 1.7920624151967435) internal successors, (10566), 5896 states have internal predecessors, (10566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 10566 transitions. [2022-11-19 06:53:46,820 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 10566 transitions. Word has length 377 [2022-11-19 06:53:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:53:46,820 INFO L495 AbstractCegarLoop]: Abstraction has 5897 states and 10566 transitions. [2022-11-19 06:53:46,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:53:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 10566 transitions. [2022-11-19 06:53:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-11-19 06:53:46,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:53:46,842 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 46, 46, 34, 34, 34, 34, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:53:46,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 06:53:47,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:47,053 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:53:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:53:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1208212493, now seen corresponding path program 6 times [2022-11-19 06:53:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:53:47,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424468894] [2022-11-19 06:53:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:53:47,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:53:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:53:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7036 backedges. 0 proven. 7036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:52,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:53:52,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424468894] [2022-11-19 06:53:52,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424468894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:53:52,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37812489] [2022-11-19 06:53:52,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:53:52,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:53:52,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:53:52,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:53:52,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:53:53,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:53:53,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:53:53,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 2561 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-19 06:53:53,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:53:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7036 backedges. 0 proven. 7036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:54,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:53:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7036 backedges. 0 proven. 7036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:53:58,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37812489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:53:58,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [714450083] [2022-11-19 06:53:58,281 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-19 06:53:58,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:53:58,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-11-19 06:53:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331754481] [2022-11-19 06:53:58,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:53:58,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-11-19 06:53:58,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:53:58,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-19 06:53:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-19 06:53:58,290 INFO L87 Difference]: Start difference. First operand 5897 states and 10566 transitions. Second operand has 97 states, 97 states have (on average 7.690721649484536) internal successors, (746), 97 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:54:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:54:02,630 INFO L93 Difference]: Finished difference Result 11993 states and 21414 transitions. [2022-11-19 06:54:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-19 06:54:02,631 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 7.690721649484536) internal successors, (746), 97 states have internal predecessors, (746), 0 states have call successors, (0), 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 377 [2022-11-19 06:54:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:54:02,678 INFO L225 Difference]: With dead ends: 11993 [2022-11-19 06:54:02,678 INFO L226 Difference]: Without dead ends: 11993 [2022-11-19 06:54:02,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-19 06:54:02,682 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3488 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 705 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 705 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:54:02,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3488 Valid, 109 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [705 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-19 06:54:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11993 states. [2022-11-19 06:54:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11993 to 11993. [2022-11-19 06:54:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11993 states, 11992 states have (on average 1.7856904603068713) internal successors, (21414), 11992 states have internal predecessors, (21414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:54:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11993 states to 11993 states and 21414 transitions. [2022-11-19 06:54:03,003 INFO L78 Accepts]: Start accepts. Automaton has 11993 states and 21414 transitions. Word has length 377 [2022-11-19 06:54:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:54:03,004 INFO L495 AbstractCegarLoop]: Abstraction has 11993 states and 21414 transitions. [2022-11-19 06:54:03,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 7.690721649484536) internal successors, (746), 97 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:54:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 11993 states and 21414 transitions. [2022-11-19 06:54:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2022-11-19 06:54:03,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:54:03,061 INFO L195 NwaCegarLoop]: trace histogram [94, 94, 94, 94, 70, 70, 70, 70, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:54:03,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:54:03,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-19 06:54:03,284 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:54:03,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:54:03,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1925432499, now seen corresponding path program 7 times [2022-11-19 06:54:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:54:03,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498630746] [2022-11-19 06:54:03,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:54:03,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:54:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:54:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 29746 backedges. 0 proven. 29746 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:54:17,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:54:17,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498630746] [2022-11-19 06:54:17,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498630746] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:54:17,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890527847] [2022-11-19 06:54:17,787 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 06:54:17,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:54:17,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:54:17,789 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:54:17,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 06:54:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:54:19,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 4973 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-19 06:54:19,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:54:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 29746 backedges. 0 proven. 29746 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:54:20,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:54:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 29746 backedges. 0 proven. 29746 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:54:35,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890527847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:54:35,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2000547287] [2022-11-19 06:54:35,649 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-19 06:54:35,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:54:35,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2022-11-19 06:54:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138532000] [2022-11-19 06:54:35,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:54:35,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2022-11-19 06:54:35,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:54:35,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2022-11-19 06:54:35,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2022-11-19 06:54:35,672 INFO L87 Difference]: Start difference. First operand 11993 states and 21414 transitions. Second operand has 193 states, 193 states have (on average 7.72020725388601) internal successors, (1490), 193 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:55:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:55:03,295 INFO L93 Difference]: Finished difference Result 24185 states and 43110 transitions. [2022-11-19 06:55:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2022-11-19 06:55:03,299 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 7.72020725388601) internal successors, (1490), 193 states have internal predecessors, (1490), 0 states have call successors, (0), 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 749 [2022-11-19 06:55:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:55:03,371 INFO L225 Difference]: With dead ends: 24185 [2022-11-19 06:55:03,371 INFO L226 Difference]: Without dead ends: 24185 [2022-11-19 06:55:03,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1593 GetRequests, 1402 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2022-11-19 06:55:03,377 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6519 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 1360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6519 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1360 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-19 06:55:03,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6519 Valid, 206 Invalid, 4057 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1360 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-19 06:55:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24185 states. [2022-11-19 06:55:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24185 to 24185. [2022-11-19 06:55:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24185 states, 24184 states have (on average 1.7825835262983791) internal successors, (43110), 24184 states have internal predecessors, (43110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:55:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24185 states to 24185 states and 43110 transitions. [2022-11-19 06:55:03,952 INFO L78 Accepts]: Start accepts. Automaton has 24185 states and 43110 transitions. Word has length 749 [2022-11-19 06:55:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:55:03,954 INFO L495 AbstractCegarLoop]: Abstraction has 24185 states and 43110 transitions. [2022-11-19 06:55:03,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 7.72020725388601) internal successors, (1490), 193 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:55:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 24185 states and 43110 transitions. [2022-11-19 06:55:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1494 [2022-11-19 06:55:04,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:55:04,030 INFO L195 NwaCegarLoop]: trace histogram [190, 190, 190, 190, 142, 142, 142, 142, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:55:04,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 06:55:04,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 06:55:04,248 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 06:55:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:55:04,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1147692595, now seen corresponding path program 8 times [2022-11-19 06:55:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:55:04,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110406532] [2022-11-19 06:55:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:55:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:55:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:56:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 122254 backedges. 0 proven. 122254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:56:02,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:56:02,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110406532] [2022-11-19 06:56:02,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110406532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:56:02,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074660204] [2022-11-19 06:56:02,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:56:02,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:56:02,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:56:02,915 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:56:02,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c562c700-6c43-4f7c-a480-f75b271979ac/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 06:56:11,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-19 06:56:11,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:56:11,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-19 06:56:11,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:56:20,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:56:20,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:20,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:56:20,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:56:20,621 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 06:56:20,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-19 06:56:20,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:20,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 06:56:21,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 06:56:21,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:21,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:56:21,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:56:21,424 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-19 06:56:21,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-19 06:56:21,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:21,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 06:56:21,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 06:56:22,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:22,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:56:22,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:56:22,234 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-19 06:56:22,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-19 06:56:22,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:22,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 06:56:22,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 06:56:22,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:22,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 06:56:23,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:56:23,118 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-19 06:56:23,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-19 06:56:23,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:56:23,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 06:56:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 122254 backedges. 5157 proven. 969 refuted. 0 times theorem prover too weak. 116128 trivial. 0 not checked. [2022-11-19 06:56:23,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:56:23,903 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7755 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_7755)) .cse1))))) is different from false [2022-11-19 06:56:25,346 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7755 Int) (v_ArrVal_7750 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7750) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_7755)) .cse1)) 800))) (= 800 .cse4)))) is different from false [2022-11-19 06:56:25,383 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7755 Int) (v_ArrVal_7750 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7748)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7750) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_7755)) .cse2)))))))) is different from false [2022-11-19 06:56:25,980 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7755 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_7748)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 800) (not (= 800 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_7750) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_7755)) .cse2)))))))) is different from false [2022-11-19 06:56:26,001 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7755 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 800 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_7750) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_7755)) .cse1))) (= 800 .cse4)))))) is different from false [2022-11-19 06:56:26,023 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7755 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 800) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_7750) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_7755)) .cse2) 800))))))) is different from false [2022-11-19 06:56:26,728 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7744 Int) (v_ArrVal_7755 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7744) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_7750) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_7755)) .cse2) 800))))))) (= 800 .cse8)))) is different from false [2022-11-19 06:56:26,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7742 Int) (v_ArrVal_7744 Int) (v_ArrVal_7755 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7742)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7744) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_7750) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_7755)) .cse1) 800)) (= .cse4 800) (= .cse5 800)))))))) is different from false [2022-11-19 06:56:27,559 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7740 (Array Int Int)) (v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7742 Int) (v_ArrVal_7744 Int) (v_ArrVal_7755 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_7740))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse1)) |c_~#queue~0.offset|) v_ArrVal_7742)))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_7744) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse3 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= 800 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_7750) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_7755)) .cse1))) (= 800 .cse5) (= .cse6 800))))))))) is different from false [2022-11-19 06:56:27,589 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7740 (Array Int Int)) (v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7742 Int) (v_ArrVal_7744 Int) (v_ArrVal_7755 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_7740))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) v_ArrVal_7742)))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_7744) .cse3 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 800 .cse0) (= 800 .cse1) (not (= 800 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_7750) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_7755)) .cse3))))))))))) is different from false [2022-11-19 06:56:28,486 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse11 .cse12))) (or (forall ((v_ArrVal_7740 (Array Int Int)) (v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7742 Int) (v_ArrVal_7744 Int) (v_ArrVal_7755 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_7740))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7742)))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_7744) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_7750) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_7755)) .cse2) 800)) (= .cse6 800))))))))) (= 800 .cse13)))) is different from false [2022-11-19 06:56:28,531 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse11 .cse12))) (or (forall ((v_ArrVal_7740 (Array Int Int)) (v_ArrVal_7737 Int) (v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7742 Int) (v_ArrVal_7744 Int) (v_ArrVal_7755 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7737) .cse12 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_7740))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_7742)))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_7744) .cse3 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 800 .cse0) (= 800 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_7750) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_7755)) .cse3) 800)))))))))) (= 800 .cse13)))) is different from false [2022-11-19 06:56:28,613 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7740 (Array Int Int)) (v_ArrVal_7737 Int) (v_ArrVal_7748 Int) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7742 Int) (v_ArrVal_7744 Int) (v_ArrVal_7755 Int) (v_ArrVal_7734 Int) (v_ArrVal_7747 (Array Int Int)) (v_ArrVal_7750 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7734)) (.cse13 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse12 .cse13))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7737) .cse13 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_7740))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse2))) v_ArrVal_7742)))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_7744) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse4 (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse6 (select .cse4 .cse2))) (or (= .cse0 800) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_7750) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7755)) .cse2) 800)) (= 800 .cse7) (= .cse6 800))))))))))) is different from false [2022-11-19 06:56:30,091 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7737 Int) (v_ArrVal_7748 Int) (v_ArrVal_7742 Int) (v_ArrVal_7744 Int) (v_ArrVal_7755 Int) (v_ArrVal_7734 Int) (v_ArrVal_7750 Int) (v_ArrVal_7740 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_483| Int) (v_ArrVal_7733 (Array Int Int)) (v_ArrVal_7754 (Array Int Int)) (v_ArrVal_7747 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_7733))) (let ((.cse1 (select .cse13 |c_~#queue~0.base|))) (let ((.cse14 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_483| 4) |c_~#queue~0.offset|) v_ArrVal_7734)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse14 .cse2))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_7737) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_7740))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse2)) |c_~#queue~0.offset|) v_ArrVal_7742)))) (let ((.cse0 (select .cse11 .cse2))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_7744) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7747))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7748)))) (let ((.cse7 (select .cse5 .cse2))) (or (= .cse0 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_483| (select .cse1 .cse2))) (not (= 800 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_7750) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_7754) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7755)) .cse2))) (= 800 .cse7) (= .cse8 800))))))))))))) is different from false [2022-11-19 06:56:30,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:56:30,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 5746 treesize of output 3876 [2022-11-19 06:56:30,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:56:30,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3112 treesize of output 3036 [2022-11-19 06:56:30,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2688 treesize of output 2524 [2022-11-19 06:56:30,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2105 treesize of output 2009 [2022-11-19 06:56:30,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2699 treesize of output 2571 [2022-11-19 06:56:30,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2736 treesize of output 2584 [2022-11-19 06:56:30,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-19 06:56:30,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:56:30,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 797 treesize of output 701 [2022-11-19 06:56:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 122254 backedges. 1348 proven. 1682 refuted. 327 times theorem prover too weak. 116128 trivial. 2769 not checked. [2022-11-19 06:56:38,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074660204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:56:38,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [705829317] [2022-11-19 06:56:38,959 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-19 06:56:38,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:56:38,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 19, 28] total 238 [2022-11-19 06:56:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566151771] [2022-11-19 06:56:38,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:56:38,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 238 states [2022-11-19 06:56:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:56:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 238 interpolants. [2022-11-19 06:56:38,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18875, Invalid=31081, Unknown=52, NotChecked=6398, Total=56406 [2022-11-19 06:56:38,975 INFO L87 Difference]: Start difference. First operand 24185 states and 43110 transitions. Second operand has 238 states, 238 states have (on average 6.73109243697479) internal successors, (1602), 238 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)