./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 b5237d83 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_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 00:16:16,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:16:16,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:16:16,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:16:16,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:16:16,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:16:16,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:16:16,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:16:16,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:16:16,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:16:16,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:16:16,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:16:16,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:16:16,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:16:16,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:16:16,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:16:16,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:16:16,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:16:16,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:16:16,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:16:16,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:16:16,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:16:16,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:16:16,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:16:16,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:16:16,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:16:16,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:16:16,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:16:16,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:16:16,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:16:16,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:16:16,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:16:16,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:16:16,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:16:16,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:16:16,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:16:16,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:16:16,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:16:16,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:16:16,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:16:16,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:16:16,705 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 00:16:16,747 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:16:16,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:16:16,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:16:16,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:16:16,750 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:16:16,750 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:16:16,750 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:16:16,751 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:16:16,751 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:16:16,751 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:16:16,752 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:16:16,753 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:16:16,753 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:16:16,753 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:16:16,754 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:16:16,754 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:16:16,754 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:16:16,754 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:16:16,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:16:16,756 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:16:16,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:16:16,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:16:16,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:16:16,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:16:16,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:16:16,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:16:16,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:16:16,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:16:16,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:16:16,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:16:16,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:16:16,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:16:16,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:16:16,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:16:16,761 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:16:16,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:16:16,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:16:16,762 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:16:16,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:16:16,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:16:16,763 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:16:16,763 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_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/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_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba 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-22 00:16:17,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:16:17,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:16:17,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:16:17,122 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:16:17,124 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:16:17,125 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-22 00:16:20,241 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:16:20,510 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:16:20,511 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-22 00:16:20,538 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/data/b129b8161/6545188760624034bfabbd49b07c6082/FLAGa77b95035 [2022-11-22 00:16:20,555 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/data/b129b8161/6545188760624034bfabbd49b07c6082 [2022-11-22 00:16:20,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:16:20,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:16:20,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:16:20,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:16:20,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:16:20,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e7447ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20, skipping insertion in model container [2022-11-22 00:16:20,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:16:20,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:16:21,351 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-22 00:16:21,361 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-22 00:16:21,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:16:21,380 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:16:21,455 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-22 00:16:21,458 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-22 00:16:21,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:16:21,564 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:16:21,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21 WrapperNode [2022-11-22 00:16:21,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:16:21,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:16:21,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:16:21,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:16:21,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,647 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-22 00:16:21,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:16:21,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:16:21,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:16:21,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:16:21,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,678 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:16:21,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:16:21,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:16:21,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:16:21,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (1/1) ... [2022-11-22 00:16:21,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:16:21,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:21,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:16:21,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:16:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-22 00:16:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-22 00:16:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-22 00:16:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-22 00:16:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:16:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:16:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:16:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:16:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 00:16:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:16:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:16:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:16:21,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:16:21,771 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:16:21,999 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:16:22,002 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:16:22,374 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:16:22,384 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:16:22,385 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-22 00:16:22,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:16:22 BoogieIcfgContainer [2022-11-22 00:16:22,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:16:22,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:16:22,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:16:22,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:16:22,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:16:20" (1/3) ... [2022-11-22 00:16:22,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573dfa49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:16:22, skipping insertion in model container [2022-11-22 00:16:22,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:21" (2/3) ... [2022-11-22 00:16:22,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573dfa49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:16:22, skipping insertion in model container [2022-11-22 00:16:22,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:16:22" (3/3) ... [2022-11-22 00:16:22,406 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-22 00:16:22,416 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 00:16:22,428 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:16:22,429 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-22 00:16:22,429 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:16:22,556 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-22 00:16:22,596 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:16:22,611 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-22 00:16:22,614 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-22 00:16:22,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-11-22 00:16:22,765 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-11-22 00:16:22,766 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-22 00:16:22,776 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-22 00:16:22,784 INFO L119 LiptonReduction]: Number of co-enabled transitions 10630 [2022-11-22 00:16:32,934 INFO L134 LiptonReduction]: Checked pairs total: 21650 [2022-11-22 00:16:32,935 INFO L136 LiptonReduction]: Total number of compositions: 215 [2022-11-22 00:16:32,943 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 51 transitions, 118 flow [2022-11-22 00:16:33,017 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:33,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:16:33,043 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;@13b5b528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:16:33,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-22 00:16:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 00:16:33,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:33,054 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 00:16:33,054 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-22 00:16:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash 900, now seen corresponding path program 1 times [2022-11-22 00:16:33,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:33,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965174479] [2022-11-22 00:16:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:33,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:33,183 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-22 00:16:33,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:33,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965174479] [2022-11-22 00:16:33,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965174479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:33,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:33,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 00:16:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565946563] [2022-11-22 00:16:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:33,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:16:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:33,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:16:33,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:16:33,218 INFO L87 Difference]: Start difference. First operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 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-22 00:16:33,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:33,339 INFO L93 Difference]: Finished difference Result 510 states and 1370 transitions. [2022-11-22 00:16:33,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:16:33,344 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-22 00:16:33,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:33,368 INFO L225 Difference]: With dead ends: 510 [2022-11-22 00:16:33,369 INFO L226 Difference]: Without dead ends: 510 [2022-11-22 00:16:33,370 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-22 00:16:33,375 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:33,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:16:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-22 00:16:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-22 00:16:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.6915520628683693) internal successors, (1370), 509 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1370 transitions. [2022-11-22 00:16:33,479 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1370 transitions. Word has length 1 [2022-11-22 00:16:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:33,480 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 1370 transitions. [2022-11-22 00:16:33,480 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-22 00:16:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1370 transitions. [2022-11-22 00:16:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:16:33,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:33,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:33,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:16:33,487 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-22 00:16:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:33,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1171630367, now seen corresponding path program 1 times [2022-11-22 00:16:33,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:33,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265219555] [2022-11-22 00:16:33,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:33,855 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-22 00:16:33,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265219555] [2022-11-22 00:16:33,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265219555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:33,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:33,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:16:33,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691160610] [2022-11-22 00:16:33,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:33,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:16:33,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:16:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:16:33,858 INFO L87 Difference]: Start difference. First operand 510 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:33,933 INFO L93 Difference]: Finished difference Result 220 states and 476 transitions. [2022-11-22 00:16:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:16:33,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 00:16:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:33,935 INFO L225 Difference]: With dead ends: 220 [2022-11-22 00:16:33,935 INFO L226 Difference]: Without dead ends: 198 [2022-11-22 00:16:33,936 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-22 00:16:33,937 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:33,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:16:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-22 00:16:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-22 00:16:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.203045685279188) internal successors, (434), 197 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 434 transitions. [2022-11-22 00:16:33,946 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 434 transitions. Word has length 15 [2022-11-22 00:16:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:33,946 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 434 transitions. [2022-11-22 00:16:33,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 434 transitions. [2022-11-22 00:16:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:16:33,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:33,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:33,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:16:33,949 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-22 00:16:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:33,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2092899768, now seen corresponding path program 1 times [2022-11-22 00:16:33,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:33,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415715163] [2022-11-22 00:16:33,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:33,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:34,034 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-22 00:16:34,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:34,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415715163] [2022-11-22 00:16:34,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415715163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:34,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:34,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:34,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579045470] [2022-11-22 00:16:34,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:34,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:16:34,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:34,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:16:34,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:16:34,037 INFO L87 Difference]: Start difference. First operand 198 states and 434 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:34,124 INFO L93 Difference]: Finished difference Result 258 states and 560 transitions. [2022-11-22 00:16:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:16:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-22 00:16:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:34,126 INFO L225 Difference]: With dead ends: 258 [2022-11-22 00:16:34,126 INFO L226 Difference]: Without dead ends: 258 [2022-11-22 00:16:34,126 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-22 00:16:34,127 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:34,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:16:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-22 00:16:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2022-11-22 00:16:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.1970443349753697) internal successors, (446), 203 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 446 transitions. [2022-11-22 00:16:34,135 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 446 transitions. Word has length 19 [2022-11-22 00:16:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:34,136 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 446 transitions. [2022-11-22 00:16:34,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 446 transitions. [2022-11-22 00:16:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 00:16:34,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:34,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:34,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:16:34,138 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-22 00:16:34,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash -985514399, now seen corresponding path program 1 times [2022-11-22 00:16:34,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:34,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313838051] [2022-11-22 00:16:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:34,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:34,321 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-22 00:16:34,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:34,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313838051] [2022-11-22 00:16:34,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313838051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:34,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348484414] [2022-11-22 00:16:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:34,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:34,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:34,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:34,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:16:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:34,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:16:34,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:34,610 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-22 00:16:34,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:34,638 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-22 00:16:34,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348484414] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:34,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1094292411] [2022-11-22 00:16:34,646 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-22 00:16:34,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:34,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-22 00:16:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897691859] [2022-11-22 00:16:34,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:16:34,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:34,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:34,651 INFO L87 Difference]: Start difference. First operand 204 states and 446 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:34,806 INFO L93 Difference]: Finished difference Result 384 states and 824 transitions. [2022-11-22 00:16:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:16:34,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-22 00:16:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:34,809 INFO L225 Difference]: With dead ends: 384 [2022-11-22 00:16:34,809 INFO L226 Difference]: Without dead ends: 384 [2022-11-22 00:16:34,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 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-22 00:16:34,810 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:34,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 9 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:16:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-22 00:16:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-11-22 00:16:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 2.151436031331593) internal successors, (824), 383 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 824 transitions. [2022-11-22 00:16:34,823 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 824 transitions. Word has length 26 [2022-11-22 00:16:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:34,824 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 824 transitions. [2022-11-22 00:16:34,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 824 transitions. [2022-11-22 00:16:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-22 00:16:34,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:34,826 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] [2022-11-22 00:16:34,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:35,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:35,032 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-22 00:16:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash 953933320, now seen corresponding path program 2 times [2022-11-22 00:16:35,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:35,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546939185] [2022-11-22 00:16:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:35,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-22 00:16:35,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:35,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546939185] [2022-11-22 00:16:35,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546939185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:35,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:35,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056992930] [2022-11-22 00:16:35,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:35,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:16:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:16:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:16:35,365 INFO L87 Difference]: Start difference. First operand 384 states and 824 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:35,450 INFO L93 Difference]: Finished difference Result 272 states and 526 transitions. [2022-11-22 00:16:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:16:35,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-22 00:16:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:35,452 INFO L225 Difference]: With dead ends: 272 [2022-11-22 00:16:35,453 INFO L226 Difference]: Without dead ends: 270 [2022-11-22 00:16:35,453 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-22 00:16:35,454 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:35,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:16:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-22 00:16:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-11-22 00:16:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.9442379182156133) internal successors, (523), 269 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 523 transitions. [2022-11-22 00:16:35,469 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 523 transitions. Word has length 47 [2022-11-22 00:16:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:35,469 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 523 transitions. [2022-11-22 00:16:35,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 523 transitions. [2022-11-22 00:16:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 00:16:35,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:35,474 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] [2022-11-22 00:16:35,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:16:35,475 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-22 00:16:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2121986374, now seen corresponding path program 1 times [2022-11-22 00:16:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:35,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369591294] [2022-11-22 00:16:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:35,711 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-22 00:16:35,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:35,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369591294] [2022-11-22 00:16:35,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369591294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:35,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335579289] [2022-11-22 00:16:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:35,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:35,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:35,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:35,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:16:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:35,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:16:35,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:36,014 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-22 00:16:36,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:36,140 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-22 00:16:36,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335579289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:36,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [209734929] [2022-11-22 00:16:36,141 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-22 00:16:36,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:36,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-22 00:16:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330951079] [2022-11-22 00:16:36,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:16:36,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 00:16:36,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:36,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 00:16:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:16:36,150 INFO L87 Difference]: Start difference. First operand 270 states and 523 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:36,514 INFO L93 Difference]: Finished difference Result 510 states and 967 transitions. [2022-11-22 00:16:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 00:16:36,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-22 00:16:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:36,517 INFO L225 Difference]: With dead ends: 510 [2022-11-22 00:16:36,518 INFO L226 Difference]: Without dead ends: 510 [2022-11-22 00:16:36,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 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-22 00:16:36,518 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 222 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:36,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 19 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:16:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-22 00:16:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-22 00:16:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.899803536345776) internal successors, (967), 509 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 967 transitions. [2022-11-22 00:16:36,550 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 967 transitions. Word has length 48 [2022-11-22 00:16:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:36,550 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 967 transitions. [2022-11-22 00:16:36,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 967 transitions. [2022-11-22 00:16:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-22 00:16:36,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:36,552 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:36,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:36,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:36,759 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-22 00:16:36,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash 626664730, now seen corresponding path program 2 times [2022-11-22 00:16:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:36,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897206072] [2022-11-22 00:16:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:37,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:37,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897206072] [2022-11-22 00:16:37,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897206072] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:37,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931236840] [2022-11-22 00:16:37,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:16:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:37,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:37,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:37,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:16:38,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-22 00:16:38,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:16:38,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-22 00:16:38,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:38,556 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-22 00:16:38,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:38,594 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-22 00:16:38,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:38,685 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-22 00:16:38,686 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-22 00:16:38,737 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-22 00:16:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-22 00:16:38,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:38,891 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_597 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_596 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_597) .cse1) 800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse0 .cse1)))))) is different from false [2022-11-22 00:16:38,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:38,907 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 53 treesize of output 43 [2022-11-22 00:16:38,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:38,920 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 78 treesize of output 80 [2022-11-22 00:16:38,929 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 55 treesize of output 47 [2022-11-22 00:16:38,944 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-22 00:16:39,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:39,001 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 50 treesize of output 46 [2022-11-22 00:16:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 68 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 8 not checked. [2022-11-22 00:16:39,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931236840] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:39,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [986763447] [2022-11-22 00:16:39,196 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-22 00:16:39,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:39,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2022-11-22 00:16:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020240022] [2022-11-22 00:16:39,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:16:39,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 00:16:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:39,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 00:16:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=438, Unknown=1, NotChecked=44, Total=600 [2022-11-22 00:16:39,199 INFO L87 Difference]: Start difference. First operand 510 states and 967 transitions. Second operand has 25 states, 25 states have (on average 5.56) internal successors, (139), 25 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:42,029 INFO L93 Difference]: Finished difference Result 978 states and 1809 transitions. [2022-11-22 00:16:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-22 00:16:42,030 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 25 states have internal predecessors, (139), 0 states have call successors, (0), 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 90 [2022-11-22 00:16:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:42,034 INFO L225 Difference]: With dead ends: 978 [2022-11-22 00:16:42,035 INFO L226 Difference]: Without dead ends: 978 [2022-11-22 00:16:42,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 168 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1142, Invalid=2767, Unknown=1, NotChecked=122, Total=4032 [2022-11-22 00:16:42,037 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1371 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:42,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 16 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 557 Invalid, 0 Unknown, 145 Unchecked, 0.8s Time] [2022-11-22 00:16:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-11-22 00:16:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 777. [2022-11-22 00:16:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 776 states have (on average 1.8518041237113403) internal successors, (1437), 776 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1437 transitions. [2022-11-22 00:16:42,060 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1437 transitions. Word has length 90 [2022-11-22 00:16:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:42,061 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1437 transitions. [2022-11-22 00:16:42,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 25 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1437 transitions. [2022-11-22 00:16:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-22 00:16:42,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:42,064 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:42,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:42,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:42,271 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-22 00:16:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1789955963, now seen corresponding path program 1 times [2022-11-22 00:16:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:42,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963761803] [2022-11-22 00:16:42,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:42,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:42,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:42,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963761803] [2022-11-22 00:16:42,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963761803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:42,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565791123] [2022-11-22 00:16:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:42,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:42,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:42,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:42,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:16:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:43,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-22 00:16:43,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:43,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:43,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565791123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:43,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2028114672] [2022-11-22 00:16:43,684 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-22 00:16:43,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:43,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2022-11-22 00:16:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874163853] [2022-11-22 00:16:43,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:16:43,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-22 00:16:43,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-22 00:16:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-22 00:16:43,687 INFO L87 Difference]: Start difference. First operand 777 states and 1437 transitions. Second operand has 27 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 27 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:44,364 INFO L93 Difference]: Finished difference Result 1596 states and 2919 transitions. [2022-11-22 00:16:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-22 00:16:44,364 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 27 states have internal predecessors, (196), 0 states have call successors, (0), 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 102 [2022-11-22 00:16:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:44,372 INFO L225 Difference]: With dead ends: 1596 [2022-11-22 00:16:44,372 INFO L226 Difference]: Without dead ends: 1596 [2022-11-22 00:16:44,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-22 00:16:44,373 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 578 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:44,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 35 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:16:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-11-22 00:16:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2022-11-22 00:16:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 1.8300940438871474) internal successors, (2919), 1595 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2919 transitions. [2022-11-22 00:16:44,430 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2919 transitions. Word has length 102 [2022-11-22 00:16:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:44,433 INFO L495 AbstractCegarLoop]: Abstraction has 1596 states and 2919 transitions. [2022-11-22 00:16:44,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 27 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2919 transitions. [2022-11-22 00:16:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-11-22 00:16:44,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:44,442 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:44,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:44,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-22 00:16:44,648 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-22 00:16:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1648220756, now seen corresponding path program 2 times [2022-11-22 00:16:44,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:44,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210701344] [2022-11-22 00:16:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:46,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210701344] [2022-11-22 00:16:46,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210701344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:46,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256213750] [2022-11-22 00:16:46,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:16:46,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:46,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:46,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:16:47,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-22 00:16:47,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:16:47,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-22 00:16:47,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:47,486 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 00:16:47,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-22 00:16:49,109 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-22 00:16:49,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:49,164 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-22 00:16:49,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:49,282 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-22 00:16:49,282 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-22 00:16:49,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:49,364 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-22 00:16:49,384 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-22 00:16:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 246 proven. 23 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2022-11-22 00:16:49,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:49,634 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1321 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 (+ 3200 |c_~#queue~0.offset|)))) (or (= (select .cse0 (+ |c_~#queue~0.offset| 3204)) .cse1) (not (= 800 .cse1)))))) is different from false [2022-11-22 00:16:49,646 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1321 (Array Int Int))) (let ((.cse1 (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|) 1)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (let ((.cse0 (select .cse1 (+ 3200 |c_~#queue~0.offset|)))) (or (not (= .cse0 800)) (= .cse0 (select .cse1 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-22 00:16:49,733 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int)) (v_ArrVal_1321 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1318))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (let ((.cse0 (select .cse1 (+ 3200 |c_~#queue~0.offset|)))) (or (= .cse0 (select .cse1 (+ |c_~#queue~0.offset| 3204))) (not (= .cse0 800)) (not (= (select .cse2 .cse3) 800)))))))) is different from false [2022-11-22 00:16:49,764 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1316 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1316)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1318))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (let ((.cse2 (select .cse3 (+ 3200 |c_~#queue~0.offset|)))) (or (not (= 800 (select .cse0 .cse1))) (not (= .cse2 800)) (= (select .cse3 (+ |c_~#queue~0.offset| 3204)) .cse2))))))) is different from false [2022-11-22 00:16:49,816 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1314 Int) (v_ArrVal_1316 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (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_1314) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1316)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1318))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (let ((.cse0 (select .cse1 (+ 3200 |c_~#queue~0.offset|)))) (or (not (= 800 .cse0)) (= (select .cse1 (+ |c_~#queue~0.offset| 3204)) .cse0) (not (= 800 (select .cse2 .cse3))))))))) is different from false [2022-11-22 00:16:50,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:50,123 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 420 treesize of output 280 [2022-11-22 00:16:50,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:50,148 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 424 treesize of output 422 [2022-11-22 00:16:50,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 256 [2022-11-22 00:16:50,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 308 [2022-11-22 00:16:50,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 292 [2022-11-22 00:16:50,299 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-22 00:16:50,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:50,521 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 82 treesize of output 84 [2022-11-22 00:16:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 98 proven. 70 refuted. 10 times theorem prover too weak. 1465 trivial. 91 not checked. [2022-11-22 00:16:51,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256213750] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:51,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [396175506] [2022-11-22 00:16:51,308 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-22 00:16:51,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:51,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7, 15] total 47 [2022-11-22 00:16:51,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059705987] [2022-11-22 00:16:51,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:16:51,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-22 00:16:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:51,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-22 00:16:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1261, Unknown=61, NotChecked=420, Total=2162 [2022-11-22 00:16:51,313 INFO L87 Difference]: Start difference. First operand 1596 states and 2919 transitions. Second operand has 47 states, 47 states have (on average 5.829787234042553) internal successors, (274), 47 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:23:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:23:35,640 INFO L93 Difference]: Finished difference Result 2502 states and 4494 transitions. [2022-11-22 00:23:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-11-22 00:23:35,641 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.829787234042553) internal successors, (274), 47 states have internal predecessors, (274), 0 states have call successors, (0), 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 200 [2022-11-22 00:23:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:23:35,653 INFO L225 Difference]: With dead ends: 2502 [2022-11-22 00:23:35,653 INFO L226 Difference]: Without dead ends: 2502 [2022-11-22 00:23:35,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 405 SyntacticMatches, 71 SemanticMatches, 203 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 23531 ImplicationChecksByTransitivity, 398.1s TimeCoverageRelationStatistics Valid=9610, Invalid=29621, Unknown=589, NotChecked=2000, Total=41820 [2022-11-22 00:23:35,669 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3158 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 762 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3158 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 707 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:23:35,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3158 Valid, 22 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 1177 Invalid, 31 Unknown, 707 Unchecked, 6.7s Time] [2022-11-22 00:23:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2022-11-22 00:23:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1587. [2022-11-22 00:23:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1586 states have (on average 1.8366960907944514) internal successors, (2913), 1586 states have internal predecessors, (2913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:23:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2913 transitions. [2022-11-22 00:23:35,735 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2913 transitions. Word has length 200 [2022-11-22 00:23:35,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:23:35,736 INFO L495 AbstractCegarLoop]: Abstraction has 1587 states and 2913 transitions. [2022-11-22 00:23:35,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.829787234042553) internal successors, (274), 47 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:23:35,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2913 transitions. [2022-11-22 00:23:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-11-22 00:23:35,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:23:35,742 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:23:35,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 00:23:35,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:23:35,949 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-22 00:23:35,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:23:35,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2026717139, now seen corresponding path program 3 times [2022-11-22 00:23:35,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:23:35,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041851876] [2022-11-22 00:23:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:23:35,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:23:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:23:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 0 proven. 1879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:23:41,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:23:41,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041851876] [2022-11-22 00:23:41,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041851876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:23:41,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939785496] [2022-11-22 00:23:41,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:23:41,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:23:41,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:23:41,016 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:23:41,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:24:21,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:24:21,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:24:21,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-22 00:24:21,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:24:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 0 proven. 1879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:24:24,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:24:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 0 proven. 1879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:24:36,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939785496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:24:36,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [285352189] [2022-11-22 00:24:36,983 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-22 00:24:36,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:24:36,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2022-11-22 00:24:36,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750123590] [2022-11-22 00:24:36,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:24:36,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-22 00:24:36,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:36,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-22 00:24:36,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2022-11-22 00:24:36,989 INFO L87 Difference]: Start difference. First operand 1587 states and 2913 transitions. Second operand has 55 states, 55 states have (on average 7.4) internal successors, (407), 55 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:24:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:45,492 INFO L93 Difference]: Finished difference Result 3207 states and 5856 transitions. [2022-11-22 00:24:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-22 00:24:45,493 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.4) internal successors, (407), 55 states have internal predecessors, (407), 0 states have call successors, (0), 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 207 [2022-11-22 00:24:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:45,506 INFO L225 Difference]: With dead ends: 3207 [2022-11-22 00:24:45,507 INFO L226 Difference]: Without dead ends: 3207 [2022-11-22 00:24:45,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2022-11-22 00:24:45,509 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1493 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:45,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 71 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-11-22 00:24:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2022-11-22 00:24:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3207. [2022-11-22 00:24:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.8265751715533376) internal successors, (5856), 3206 states have internal predecessors, (5856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:24:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 5856 transitions. [2022-11-22 00:24:45,584 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 5856 transitions. Word has length 207 [2022-11-22 00:24:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:45,585 INFO L495 AbstractCegarLoop]: Abstraction has 3207 states and 5856 transitions. [2022-11-22 00:24:45,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.4) internal successors, (407), 55 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:24:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 5856 transitions. [2022-11-22 00:24:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2022-11-22 00:24:45,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:45,599 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 52, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:24:45,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:24:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:45,814 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-22 00:24:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1207654342, now seen corresponding path program 4 times [2022-11-22 00:24:45,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:45,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532753478] [2022-11-22 00:24:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 0 proven. 8307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:03,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:03,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532753478] [2022-11-22 00:25:03,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532753478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:25:03,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867996621] [2022-11-22 00:25:03,382 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 00:25:03,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:25:03,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:25:03,383 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:25:03,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:25:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:04,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-22 00:25:04,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:25:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 0 proven. 8307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:10,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:25:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 0 proven. 8307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:25:52,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867996621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:25:52,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1697190222] [2022-11-22 00:25:52,368 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-22 00:25:52,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:25:52,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2022-11-22 00:25:52,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87715600] [2022-11-22 00:25:52,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:25:52,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-11-22 00:25:52,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:52,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-11-22 00:25:52,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2022-11-22 00:25:52,378 INFO L87 Difference]: Start difference. First operand 3207 states and 5856 transitions. Second operand has 109 states, 109 states have (on average 7.458715596330276) internal successors, (813), 109 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:26:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:26:09,436 INFO L93 Difference]: Finished difference Result 6447 states and 11742 transitions. [2022-11-22 00:26:09,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-11-22 00:26:09,437 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 7.458715596330276) internal successors, (813), 109 states have internal predecessors, (813), 0 states have call successors, (0), 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 410 [2022-11-22 00:26:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:26:09,454 INFO L225 Difference]: With dead ends: 6447 [2022-11-22 00:26:09,454 INFO L226 Difference]: Without dead ends: 6447 [2022-11-22 00:26:09,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 48.7s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2022-11-22 00:26:09,457 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4275 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 827 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4275 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 827 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:26:09,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4275 Valid, 119 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [827 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2022-11-22 00:26:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6447 states. [2022-11-22 00:26:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6447 to 6447. [2022-11-22 00:26:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6447 states, 6446 states have (on average 1.8215947874650946) internal successors, (11742), 6446 states have internal predecessors, (11742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:26:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6447 states to 6447 states and 11742 transitions. [2022-11-22 00:26:09,640 INFO L78 Accepts]: Start accepts. Automaton has 6447 states and 11742 transitions. Word has length 410 [2022-11-22 00:26:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:26:09,641 INFO L495 AbstractCegarLoop]: Abstraction has 6447 states and 11742 transitions. [2022-11-22 00:26:09,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 7.458715596330276) internal successors, (813), 109 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:26:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 6447 states and 11742 transitions. [2022-11-22 00:26:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2022-11-22 00:26:09,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:26:09,682 INFO L195 NwaCegarLoop]: trace histogram [106, 106, 106, 106, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:26:09,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 00:26:09,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:26:09,905 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-22 00:26:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:26:09,905 INFO L85 PathProgramCache]: Analyzing trace with hash -31173866, now seen corresponding path program 5 times [2022-11-22 00:26:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:26:09,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968038040] [2022-11-22 00:26:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:26:09,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:26:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 34821 backedges. 0 proven. 34821 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:27:13,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:27:13,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968038040] [2022-11-22 00:27:13,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968038040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:27:13,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805560597] [2022-11-22 00:27:13,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:27:13,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:27:13,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:27:13,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:27:13,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ee418c-a334-4bf2-a762-e4934f3b035b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 00:27:16,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-22 00:27:16,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:27:16,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-22 00:27:16,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:58,571 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-22 00:27:59,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:27:59,665 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-22 00:28:00,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:28:00,974 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-22 00:28:00,974 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-22 00:28:02,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:02,275 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-22 00:28:03,597 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-22 00:28:04,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:04,717 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-22 00:28:06,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:28:07,027 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-22 00:28:07,027 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-22 00:28:08,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:08,284 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-22 00:28:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 34821 backedges. 1400 proven. 525 refuted. 0 times theorem prover too weak. 32896 trivial. 0 not checked. [2022-11-22 00:28:08,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:28:09,377 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 10 treesize of output 4 [2022-11-22 00:28:12,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4483 (Array Int Int)) (v_ArrVal_4484 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_4483) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4484)) .cse1))))) is different from false [2022-11-22 00:28:12,585 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4483 (Array Int Int)) (v_ArrVal_4484 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 (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_4483) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_4484)) .cse1))))) is different from false [2022-11-22 00:28:12,632 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4483 (Array Int Int)) (v_ArrVal_4484 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| (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_4483) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4484)) .cse1))))) is different from false [2022-11-22 00:28:15,166 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_4480 Int) (v_ArrVal_4483 (Array Int Int)) (v_ArrVal_4484 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_4480) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4483) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4484)) .cse1)) 800))) (= 800 .cse4)))) is different from false [2022-11-22 00:28:15,295 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4480 Int) (v_ArrVal_4483 (Array Int Int)) (v_ArrVal_4478 Int) (v_ArrVal_4484 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_4478)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 800) (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_4480) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4483) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_4484)) .cse2)) 800)))))) is different from false [2022-11-22 00:28:23,151 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:28:23,152 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-22 00:28:23,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:28:23,226 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-22 00:28:23,262 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 212 treesize of output 188 [2022-11-22 00:28:23,317 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 256 treesize of output 236 [2022-11-22 00:28:23,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 8 treesize of output 4 [2022-11-22 00:28:23,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:28:23,677 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 119 treesize of output 103 [2022-11-22 00:28:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 34821 backedges. 724 proven. 626 refuted. 104 times theorem prover too weak. 32896 trivial. 471 not checked. [2022-11-22 00:28:38,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805560597] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:28:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [592637636] [2022-11-22 00:28:38,945 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-22 00:28:38,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:28:38,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 11, 15] total 133 [2022-11-22 00:28:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751256101] [2022-11-22 00:28:38,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:28:38,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2022-11-22 00:28:38,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:28:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2022-11-22 00:28:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5996, Invalid=10269, Unknown=11, NotChecked=1280, Total=17556 [2022-11-22 00:28:38,954 INFO L87 Difference]: Start difference. First operand 6447 states and 11742 transitions. Second operand has 133 states, 133 states have (on average 6.7443609022556394) internal successors, (897), 133 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)