./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack_longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack_longer-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh --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 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 --- 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-2329fc7 [2022-12-14 04:39:21,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:39:21,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:39:21,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:39:21,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:39:21,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:39:21,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:39:21,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:39:21,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:39:21,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:39:21,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:39:21,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:39:21,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:39:21,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:39:21,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:39:21,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:39:21,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:39:21,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:39:21,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:39:21,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:39:21,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:39:21,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:39:21,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:39:21,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:39:21,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:39:21,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:39:21,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:39:21,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:39:21,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:39:21,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:39:21,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:39:21,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:39:21,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:39:21,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:39:21,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:39:21,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:39:21,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:39:21,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:39:21,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:39:21,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:39:21,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:39:21,516 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 04:39:21,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:39:21,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:39:21,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:39:21,532 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:39:21,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:39:21,533 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:39:21,533 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:39:21,533 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:39:21,533 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:39:21,533 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 04:39:21,534 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:39:21,534 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:39:21,534 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 04:39:21,534 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 04:39:21,534 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:39:21,534 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 04:39:21,535 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 04:39:21,535 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 04:39:21,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:39:21,535 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:39:21,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:39:21,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:39:21,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:39:21,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 04:39:21,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:39:21,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 04:39:21,536 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:39:21,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 04:39:21,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:39:21,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 04:39:21,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:39:21,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:39:21,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:39:21,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:39:21,537 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 04:39:21,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:39:21,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 04:39:21,537 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 04:39:21,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 04:39:21,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 04:39:21,538 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:39:21,538 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_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/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_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh 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 -> 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 [2022-12-14 04:39:21,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:39:21,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:39:21,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:39:21,714 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:39:21,715 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:39:21,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/stack_longer-2.i [2022-12-14 04:39:24,283 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:39:24,467 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:39:24,468 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/sv-benchmarks/c/pthread/stack_longer-2.i [2022-12-14 04:39:24,477 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/data/84c3d641c/0407367db8e74131b45e3391db24ee75/FLAG604339c4a [2022-12-14 04:39:24,488 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/data/84c3d641c/0407367db8e74131b45e3391db24ee75 [2022-12-14 04:39:24,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:39:24,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:39:24,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:39:24,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:39:24,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:39:24,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d74228d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24, skipping insertion in model container [2022-12-14 04:39:24,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:39:24,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:39:24,778 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_60f38739-4c45-4f57-b12f-1f373f9c73a0/sv-benchmarks/c/pthread/stack_longer-2.i[41529,41542] [2022-12-14 04:39:24,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:39:24,805 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:39:24,832 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_60f38739-4c45-4f57-b12f-1f373f9c73a0/sv-benchmarks/c/pthread/stack_longer-2.i[41529,41542] [2022-12-14 04:39:24,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:39:24,876 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:39:24,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24 WrapperNode [2022-12-14 04:39:24,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:39:24,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:39:24,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:39:24,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:39:24,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,912 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-14 04:39:24,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:39:24,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:39:24,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:39:24,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:39:24,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:39:24,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:39:24,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:39:24,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:39:24,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (1/1) ... [2022-12-14 04:39:24,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:39:24,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:39:24,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:39:24,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:39:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 04:39:25,001 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 04:39:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 04:39:25,002 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 04:39:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 04:39:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 04:39:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 04:39:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 04:39:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 04:39:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:39:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 04:39:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:39:25,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:39:25,004 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 04:39:25,102 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:39:25,104 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:39:25,335 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:39:25,342 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:39:25,342 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 04:39:25,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:39:25 BoogieIcfgContainer [2022-12-14 04:39:25,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:39:25,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:39:25,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:39:25,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:39:25,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:39:24" (1/3) ... [2022-12-14 04:39:25,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ace3e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:39:25, skipping insertion in model container [2022-12-14 04:39:25,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:39:24" (2/3) ... [2022-12-14 04:39:25,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ace3e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:39:25, skipping insertion in model container [2022-12-14 04:39:25,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:39:25" (3/3) ... [2022-12-14 04:39:25,351 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-12-14 04:39:25,358 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 04:39:25,366 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:39:25,366 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 04:39:25,366 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 04:39:25,435 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 04:39:25,461 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 04:39:25,472 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 170 transitions, 356 flow [2022-12-14 04:39:25,475 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 170 transitions, 356 flow [2022-12-14 04:39:25,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 170 transitions, 356 flow [2022-12-14 04:39:25,530 INFO L130 PetriNetUnfolder]: 10/168 cut-off events. [2022-12-14 04:39:25,530 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 04:39:25,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 10/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 407 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2022-12-14 04:39:25,539 INFO L119 LiptonReduction]: Number of co-enabled transitions 8324 [2022-12-14 04:39:28,591 INFO L134 LiptonReduction]: Checked pairs total: 10795 [2022-12-14 04:39:28,592 INFO L136 LiptonReduction]: Total number of compositions: 157 [2022-12-14 04:39:28,597 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 36 transitions, 88 flow [2022-12-14 04:39:28,623 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:28,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 04:39:28,640 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;@3e1ffa94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 04:39:28,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-14 04:39:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 04:39:28,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:28,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 04:39:28,647 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1062039901, now seen corresponding path program 1 times [2022-12-14 04:39:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:28,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911591965] [2022-12-14 04:39:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:28,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:28,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911591965] [2022-12-14 04:39:28,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911591965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:39:28,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:39:28,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:39:28,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936167779] [2022-12-14 04:39:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:39:28,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:39:28,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:39:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:39:28,927 INFO L87 Difference]: Start difference. First operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:29,013 INFO L93 Difference]: Finished difference Result 414 states and 1064 transitions. [2022-12-14 04:39:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:39:29,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 04:39:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:29,027 INFO L225 Difference]: With dead ends: 414 [2022-12-14 04:39:29,027 INFO L226 Difference]: Without dead ends: 396 [2022-12-14 04:39:29,028 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-12-14 04:39:29,031 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:29,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:39:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-12-14 04:39:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 372. [2022-12-14 04:39:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 369 states have (on average 2.6856368563685638) internal successors, (991), 371 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 991 transitions. [2022-12-14 04:39:29,091 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 991 transitions. Word has length 6 [2022-12-14 04:39:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:29,092 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 991 transitions. [2022-12-14 04:39:29,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 991 transitions. [2022-12-14 04:39:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 04:39:29,093 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:29,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:39:29,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 04:39:29,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1240178457, now seen corresponding path program 1 times [2022-12-14 04:39:29,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:29,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290593311] [2022-12-14 04:39:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:29,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:29,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290593311] [2022-12-14 04:39:29,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290593311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:39:29,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:39:29,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:39:29,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767904080] [2022-12-14 04:39:29,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:39:29,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:39:29,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:29,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:39:29,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:39:29,184 INFO L87 Difference]: Start difference. First operand 372 states and 991 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:29,243 INFO L93 Difference]: Finished difference Result 410 states and 1089 transitions. [2022-12-14 04:39:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:39:29,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 04:39:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:29,247 INFO L225 Difference]: With dead ends: 410 [2022-12-14 04:39:29,247 INFO L226 Difference]: Without dead ends: 410 [2022-12-14 04:39:29,247 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-12-14 04:39:29,248 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:29,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:39:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-12-14 04:39:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-12-14 04:39:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 407 states have (on average 2.675675675675676) internal successors, (1089), 409 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1089 transitions. [2022-12-14 04:39:29,270 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1089 transitions. Word has length 10 [2022-12-14 04:39:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:29,270 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 1089 transitions. [2022-12-14 04:39:29,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1089 transitions. [2022-12-14 04:39:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 04:39:29,271 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:29,271 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:39:29,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 04:39:29,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -845822292, now seen corresponding path program 1 times [2022-12-14 04:39:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:29,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248799525] [2022-12-14 04:39:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:29,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:29,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:29,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248799525] [2022-12-14 04:39:29,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248799525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:39:29,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208132833] [2022-12-14 04:39:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:29,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:39:29,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:39:29,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:39:29,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 04:39:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:29,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 04:39:29,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:39:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:29,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:39:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:29,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208132833] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:39:29,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1375934438] [2022-12-14 04:39:29,535 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:337) 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-12-14 04:39:29,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:39:29,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-14 04:39:29,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719289913] [2022-12-14 04:39:29,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:39:29,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 04:39:29,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:29,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 04:39:29,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 04:39:29,538 INFO L87 Difference]: Start difference. First operand 410 states and 1089 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:29,812 INFO L93 Difference]: Finished difference Result 998 states and 2565 transitions. [2022-12-14 04:39:29,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 04:39:29,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 04:39:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:29,818 INFO L225 Difference]: With dead ends: 998 [2022-12-14 04:39:29,818 INFO L226 Difference]: Without dead ends: 986 [2022-12-14 04:39:29,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-12-14 04:39:29,820 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:29,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:39:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-12-14 04:39:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 678. [2022-12-14 04:39:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 675 states have (on average 2.6977777777777776) internal successors, (1821), 677 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1821 transitions. [2022-12-14 04:39:29,848 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1821 transitions. Word has length 13 [2022-12-14 04:39:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:29,849 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1821 transitions. [2022-12-14 04:39:29,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1821 transitions. [2022-12-14 04:39:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 04:39:29,851 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:29,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:39:29,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 04:39:30,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:39:30,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:30,052 INFO L85 PathProgramCache]: Analyzing trace with hash -941275813, now seen corresponding path program 1 times [2022-12-14 04:39:30,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:30,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522136632] [2022-12-14 04:39:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:30,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:30,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:30,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522136632] [2022-12-14 04:39:30,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522136632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:39:30,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:39:30,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:39:30,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653003430] [2022-12-14 04:39:30,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:39:30,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:39:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:39:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:39:30,162 INFO L87 Difference]: Start difference. First operand 678 states and 1821 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:30,206 INFO L93 Difference]: Finished difference Result 300 states and 681 transitions. [2022-12-14 04:39:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:39:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 04:39:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:30,208 INFO L225 Difference]: With dead ends: 300 [2022-12-14 04:39:30,208 INFO L226 Difference]: Without dead ends: 300 [2022-12-14 04:39:30,209 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-12-14 04:39:30,210 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:30,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:39:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-12-14 04:39:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2022-12-14 04:39:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.25) internal successors, (630), 281 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 630 transitions. [2022-12-14 04:39:30,219 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 630 transitions. Word has length 16 [2022-12-14 04:39:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:30,219 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 630 transitions. [2022-12-14 04:39:30,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 630 transitions. [2022-12-14 04:39:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 04:39:30,221 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:30,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:39:30,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 04:39:30,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:30,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1819329845, now seen corresponding path program 1 times [2022-12-14 04:39:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:30,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749378288] [2022-12-14 04:39:30,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:30,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:30,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749378288] [2022-12-14 04:39:30,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749378288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:39:30,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:39:30,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:39:30,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365707848] [2022-12-14 04:39:30,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:39:30,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:39:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:30,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:39:30,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:39:30,270 INFO L87 Difference]: Start difference. First operand 282 states and 630 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:30,328 INFO L93 Difference]: Finished difference Result 340 states and 756 transitions. [2022-12-14 04:39:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:39:30,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 04:39:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:30,330 INFO L225 Difference]: With dead ends: 340 [2022-12-14 04:39:30,330 INFO L226 Difference]: Without dead ends: 340 [2022-12-14 04:39:30,330 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-12-14 04:39:30,331 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:30,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:39:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-12-14 04:39:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 284. [2022-12-14 04:39:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 282 states have (on average 2.2588652482269502) internal successors, (637), 283 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 637 transitions. [2022-12-14 04:39:30,341 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 637 transitions. Word has length 17 [2022-12-14 04:39:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:30,342 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 637 transitions. [2022-12-14 04:39:30,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 637 transitions. [2022-12-14 04:39:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:39:30,343 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:30,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:39:30,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 04:39:30,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 985314637, now seen corresponding path program 1 times [2022-12-14 04:39:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:30,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645698055] [2022-12-14 04:39:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:30,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:30,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645698055] [2022-12-14 04:39:30,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645698055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:39:30,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:39:30,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 04:39:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960843538] [2022-12-14 04:39:30,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:39:30,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 04:39:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:30,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 04:39:30,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:39:30,848 INFO L87 Difference]: Start difference. First operand 284 states and 637 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:31,357 INFO L93 Difference]: Finished difference Result 489 states and 1074 transitions. [2022-12-14 04:39:31,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 04:39:31,358 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 04:39:31,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:31,360 INFO L225 Difference]: With dead ends: 489 [2022-12-14 04:39:31,360 INFO L226 Difference]: Without dead ends: 440 [2022-12-14 04:39:31,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-14 04:39:31,361 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 93 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:31,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 21 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:39:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-12-14 04:39:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 340. [2022-12-14 04:39:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 338 states have (on average 2.275147928994083) internal successors, (769), 339 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 769 transitions. [2022-12-14 04:39:31,372 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 769 transitions. Word has length 21 [2022-12-14 04:39:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:31,373 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 769 transitions. [2022-12-14 04:39:31,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 769 transitions. [2022-12-14 04:39:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:39:31,374 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:31,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:39:31,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 04:39:31,374 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:31,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1688566991, now seen corresponding path program 2 times [2022-12-14 04:39:31,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:31,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806928777] [2022-12-14 04:39:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:32,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806928777] [2022-12-14 04:39:32,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806928777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:39:32,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:39:32,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 04:39:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962219820] [2022-12-14 04:39:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:39:32,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 04:39:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 04:39:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:39:32,031 INFO L87 Difference]: Start difference. First operand 340 states and 769 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:32,601 INFO L93 Difference]: Finished difference Result 516 states and 1134 transitions. [2022-12-14 04:39:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 04:39:32,601 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 04:39:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:32,605 INFO L225 Difference]: With dead ends: 516 [2022-12-14 04:39:32,605 INFO L226 Difference]: Without dead ends: 466 [2022-12-14 04:39:32,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-12-14 04:39:32,606 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 111 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:32,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 23 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 04:39:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-12-14 04:39:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 328. [2022-12-14 04:39:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 326 states have (on average 2.2607361963190185) internal successors, (737), 327 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 737 transitions. [2022-12-14 04:39:32,613 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 737 transitions. Word has length 21 [2022-12-14 04:39:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:32,613 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 737 transitions. [2022-12-14 04:39:32,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 737 transitions. [2022-12-14 04:39:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 04:39:32,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:32,614 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:39:32,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 04:39:32,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:32,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1703074813, now seen corresponding path program 1 times [2022-12-14 04:39:32,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:32,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49928922] [2022-12-14 04:39:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:32,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:32,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:32,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49928922] [2022-12-14 04:39:32,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49928922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:39:32,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281270215] [2022-12-14 04:39:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:32,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:39:32,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:39:32,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:39:32,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 04:39:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:32,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 04:39:32,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:39:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:39:32,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:39:32,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281270215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:39:32,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:39:32,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-14 04:39:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066313332] [2022-12-14 04:39:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:39:32,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:39:32,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:32,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:39:32,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:39:32,818 INFO L87 Difference]: Start difference. First operand 328 states and 737 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:32,936 INFO L93 Difference]: Finished difference Result 438 states and 953 transitions. [2022-12-14 04:39:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:39:32,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 04:39:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:32,938 INFO L225 Difference]: With dead ends: 438 [2022-12-14 04:39:32,938 INFO L226 Difference]: Without dead ends: 430 [2022-12-14 04:39:32,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-14 04:39:32,939 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:32,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:39:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-12-14 04:39:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 380. [2022-12-14 04:39:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 378 states have (on average 2.240740740740741) internal successors, (847), 379 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 847 transitions. [2022-12-14 04:39:32,950 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 847 transitions. Word has length 24 [2022-12-14 04:39:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:32,950 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 847 transitions. [2022-12-14 04:39:32,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 847 transitions. [2022-12-14 04:39:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 04:39:32,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:32,952 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-12-14 04:39:32,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 04:39:33,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:39:33,154 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1604720332, now seen corresponding path program 2 times [2022-12-14 04:39:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:33,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608873611] [2022-12-14 04:39:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:33,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:33,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608873611] [2022-12-14 04:39:33,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608873611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:39:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041626227] [2022-12-14 04:39:33,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 04:39:33,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:39:33,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:39:33,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:39:33,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 04:39:33,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 04:39:33,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:39:33,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 04:39:33,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:39:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:33,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:39:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:33,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041626227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:39:33,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1208283124] [2022-12-14 04:39:33,652 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:337) 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-12-14 04:39:33,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:39:33,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2022-12-14 04:39:33,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580833795] [2022-12-14 04:39:33,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:39:33,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 04:39:33,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:33,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 04:39:33,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-12-14 04:39:33,654 INFO L87 Difference]: Start difference. First operand 380 states and 847 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:33,971 INFO L93 Difference]: Finished difference Result 868 states and 1863 transitions. [2022-12-14 04:39:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 04:39:33,971 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 04:39:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:33,974 INFO L225 Difference]: With dead ends: 868 [2022-12-14 04:39:33,974 INFO L226 Difference]: Without dead ends: 868 [2022-12-14 04:39:33,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2022-12-14 04:39:33,975 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 252 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:33,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 0 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:39:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-12-14 04:39:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 604. [2022-12-14 04:39:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 602 states have (on average 2.250830564784053) internal successors, (1355), 603 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1355 transitions. [2022-12-14 04:39:33,994 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1355 transitions. Word has length 27 [2022-12-14 04:39:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:33,994 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 1355 transitions. [2022-12-14 04:39:33,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1355 transitions. [2022-12-14 04:39:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 04:39:33,995 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:33,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:39:34,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 04:39:34,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:39:34,196 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:34,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash 671126280, now seen corresponding path program 3 times [2022-12-14 04:39:34,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:34,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147072183] [2022-12-14 04:39:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 04:39:34,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147072183] [2022-12-14 04:39:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147072183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:39:34,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:39:34,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 04:39:34,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074389573] [2022-12-14 04:39:34,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:39:34,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 04:39:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:34,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 04:39:34,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-14 04:39:34,673 INFO L87 Difference]: Start difference. First operand 604 states and 1355 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:39:35,762 INFO L93 Difference]: Finished difference Result 1237 states and 2747 transitions. [2022-12-14 04:39:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 04:39:35,763 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 04:39:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:39:35,772 INFO L225 Difference]: With dead ends: 1237 [2022-12-14 04:39:35,773 INFO L226 Difference]: Without dead ends: 1205 [2022-12-14 04:39:35,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 04:39:35,774 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 193 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 04:39:35,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 7 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 04:39:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2022-12-14 04:39:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 726. [2022-12-14 04:39:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 724 states have (on average 2.341160220994475) internal successors, (1695), 725 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1695 transitions. [2022-12-14 04:39:35,796 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1695 transitions. Word has length 28 [2022-12-14 04:39:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:39:35,796 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1695 transitions. [2022-12-14 04:39:35,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1695 transitions. [2022-12-14 04:39:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 04:39:35,798 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:39:35,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:39:35,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 04:39:35,798 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:39:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:39:35,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1564403704, now seen corresponding path program 4 times [2022-12-14 04:39:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:39:35,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864368466] [2022-12-14 04:39:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:39:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:39:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 04:39:36,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:39:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864368466] [2022-12-14 04:39:36,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864368466] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:39:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524901215] [2022-12-14 04:39:36,433 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 04:39:36,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:39:36,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:39:36,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:39:36,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 04:39:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:39:36,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-14 04:39:36,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:39:36,572 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 04:39:36,573 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-12-14 04:39:36,966 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 22 treesize of output 17 [2022-12-14 04:39:37,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-14 04:39:37,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-14 04:39:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:39:50,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:39:50,654 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_361) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-14 04:39:50,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:39:50,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 04:39:50,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:39:50,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-12-14 04:39:50,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-14 04:39:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 04:39:50,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524901215] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:39:50,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1456596174] [2022-12-14 04:39:50,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:337) 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-12-14 04:39:50,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:39:50,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 44 [2022-12-14 04:39:50,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903889090] [2022-12-14 04:39:50,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:39:50,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-14 04:39:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:39:50,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-14 04:39:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1820, Unknown=2, NotChecked=86, Total=2070 [2022-12-14 04:39:50,948 INFO L87 Difference]: Start difference. First operand 726 states and 1695 transitions. Second operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:39:55,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:40:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:40:08,114 INFO L93 Difference]: Finished difference Result 1372 states and 3022 transitions. [2022-12-14 04:40:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-12-14 04:40:08,114 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 04:40:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:40:08,117 INFO L225 Difference]: With dead ends: 1372 [2022-12-14 04:40:08,117 INFO L226 Difference]: Without dead ends: 1372 [2022-12-14 04:40:08,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 1 IntricatePredicates, 7 DeprecatedPredicates, 3580 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=1644, Invalid=10568, Unknown=2, NotChecked=218, Total=12432 [2022-12-14 04:40:08,119 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1063 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4457 mSolverCounterSat, 55 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4457 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-12-14 04:40:08,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 0 Invalid, 4687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4457 Invalid, 11 Unknown, 164 Unchecked, 8.6s Time] [2022-12-14 04:40:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-12-14 04:40:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 660. [2022-12-14 04:40:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 658 states have (on average 2.2963525835866263) internal successors, (1511), 659 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:40:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1511 transitions. [2022-12-14 04:40:08,132 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1511 transitions. Word has length 28 [2022-12-14 04:40:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:40:08,132 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 1511 transitions. [2022-12-14 04:40:08,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:40:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1511 transitions. [2022-12-14 04:40:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 04:40:08,133 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:40:08,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:40:08,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 04:40:08,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 04:40:08,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:40:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:40:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1961964908, now seen corresponding path program 1 times [2022-12-14 04:40:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:40:08,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682656172] [2022-12-14 04:40:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:40:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:40:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:40:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:40:09,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:40:09,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682656172] [2022-12-14 04:40:09,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682656172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:40:09,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808758374] [2022-12-14 04:40:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:40:09,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:40:09,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:40:09,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:40:09,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 04:40:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:40:09,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-14 04:40:09,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:40:09,714 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 22 treesize of output 17 [2022-12-14 04:40:10,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:40:10,146 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 72 treesize of output 43 [2022-12-14 04:40:10,903 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 111 treesize of output 46 [2022-12-14 04:40:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:40:24,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:40:25,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-12-14 04:40:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:40:25,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808758374] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:40:25,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [982643062] [2022-12-14 04:40:25,683 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:337) 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-12-14 04:40:25,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:40:25,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2022-12-14 04:40:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586788985] [2022-12-14 04:40:25,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:40:25,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-14 04:40:25,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:40:25,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-14 04:40:25,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2796, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 04:40:25,685 INFO L87 Difference]: Start difference. First operand 660 states and 1511 transitions. Second operand has 55 states, 54 states have (on average 2.0) internal successors, (108), 55 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:41:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:41:09,786 INFO L93 Difference]: Finished difference Result 2816 states and 6253 transitions. [2022-12-14 04:41:09,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-14 04:41:09,787 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.0) internal successors, (108), 55 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 04:41:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:41:09,793 INFO L225 Difference]: With dead ends: 2816 [2022-12-14 04:41:09,793 INFO L226 Difference]: Without dead ends: 2816 [2022-12-14 04:41:09,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4882 ImplicationChecksByTransitivity, 53.6s TimeCoverageRelationStatistics Valid=2454, Invalid=17006, Unknown=0, NotChecked=0, Total=19460 [2022-12-14 04:41:09,796 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1090 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5699 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 5699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:41:09,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 0 Invalid, 5776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 5699 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-12-14 04:41:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2022-12-14 04:41:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 1123. [2022-12-14 04:41:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1121 states have (on average 2.4371097234611954) internal successors, (2732), 1122 states have internal predecessors, (2732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:41:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 2732 transitions. [2022-12-14 04:41:09,821 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 2732 transitions. Word has length 36 [2022-12-14 04:41:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:41:09,821 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 2732 transitions. [2022-12-14 04:41:09,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.0) internal successors, (108), 55 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:41:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 2732 transitions. [2022-12-14 04:41:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 04:41:09,822 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:41:09,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:41:09,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 04:41:10,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:41:10,023 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:41:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:41:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1761123576, now seen corresponding path program 2 times [2022-12-14 04:41:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:41:10,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122061202] [2022-12-14 04:41:10,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:41:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:41:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:41:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:41:11,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:41:11,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122061202] [2022-12-14 04:41:11,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122061202] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:41:11,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216432094] [2022-12-14 04:41:11,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 04:41:11,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:41:11,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:41:11,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:41:11,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 04:41:11,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 04:41:11,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:41:11,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-14 04:41:11,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:41:11,402 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 04:41:11,402 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-12-14 04:41:11,703 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 22 treesize of output 17 [2022-12-14 04:41:11,778 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 59 treesize of output 54 [2022-12-14 04:41:12,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:41:12,214 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 52 treesize of output 38 [2022-12-14 04:41:13,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-14 04:41:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:41:24,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:41:25,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:41:25,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 04:41:25,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:41:25,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-12-14 04:41:25,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-14 04:41:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:41:25,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216432094] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:41:25,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1193386161] [2022-12-14 04:41:25,808 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:337) 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-12-14 04:41:25,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:41:25,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 57 [2022-12-14 04:41:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955793143] [2022-12-14 04:41:25,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:41:25,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-14 04:41:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:41:25,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-14 04:41:25,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3199, Unknown=11, NotChecked=0, Total=3422 [2022-12-14 04:41:25,811 INFO L87 Difference]: Start difference. First operand 1123 states and 2732 transitions. Second operand has 59 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 58 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:42:00,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 04:42:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:42:14,822 INFO L93 Difference]: Finished difference Result 3763 states and 8398 transitions. [2022-12-14 04:42:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-12-14 04:42:14,823 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 58 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 04:42:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:42:14,830 INFO L225 Difference]: With dead ends: 3763 [2022-12-14 04:42:14,831 INFO L226 Difference]: Without dead ends: 3572 [2022-12-14 04:42:14,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15370 ImplicationChecksByTransitivity, 46.4s TimeCoverageRelationStatistics Valid=3840, Invalid=39064, Unknown=152, NotChecked=0, Total=43056 [2022-12-14 04:42:14,835 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1690 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8718 mSolverCounterSat, 159 mSolverCounterUnsat, 93 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 8718 IncrementalHoareTripleChecker+Invalid, 93 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:42:14,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 0 Invalid, 8970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 8718 Invalid, 93 Unknown, 0 Unchecked, 16.3s Time] [2022-12-14 04:42:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3572 states. [2022-12-14 04:42:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3572 to 905. [2022-12-14 04:42:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 903 states have (on average 2.344407530454042) internal successors, (2117), 904 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:42:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 2117 transitions. [2022-12-14 04:42:14,858 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 2117 transitions. Word has length 36 [2022-12-14 04:42:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:42:14,859 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 2117 transitions. [2022-12-14 04:42:14,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 58 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:42:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 2117 transitions. [2022-12-14 04:42:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 04:42:14,861 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:42:14,861 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:42:14,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 04:42:15,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 04:42:15,063 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:42:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:42:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1117996436, now seen corresponding path program 3 times [2022-12-14 04:42:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:42:15,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910222076] [2022-12-14 04:42:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:42:15,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:42:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:42:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:42:17,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:42:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910222076] [2022-12-14 04:42:17,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910222076] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:42:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422675036] [2022-12-14 04:42:17,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 04:42:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:42:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:42:17,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:42:17,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 04:42:17,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 04:42:17,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:42:17,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-14 04:42:17,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:42:17,751 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 04:42:17,751 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-12-14 04:42:18,129 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 22 treesize of output 17 [2022-12-14 04:42:18,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:42:18,745 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 72 treesize of output 43 [2022-12-14 04:42:18,766 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 63 treesize of output 58 [2022-12-14 04:42:19,880 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 111 treesize of output 46 [2022-12-14 04:42:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:42:30,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:42:32,961 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-12-14 04:42:32,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 60 [2022-12-14 04:42:32,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:42:32,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 70 [2022-12-14 04:42:32,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-14 04:42:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:42:37,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422675036] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:42:37,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2140951493] [2022-12-14 04:42:37,397 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:337) 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-12-14 04:42:37,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:42:37,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 63 [2022-12-14 04:42:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677946226] [2022-12-14 04:42:37,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:42:37,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 04:42:37,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:42:37,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 04:42:37,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=3699, Unknown=25, NotChecked=0, Total=4160 [2022-12-14 04:42:37,400 INFO L87 Difference]: Start difference. First operand 905 states and 2117 transitions. Second operand has 65 states, 64 states have (on average 1.6875) internal successors, (108), 64 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:43:01,252 WARN L233 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 277 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:44:31,495 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 213 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:44:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:55,610 INFO L93 Difference]: Finished difference Result 2900 states and 6427 transitions. [2022-12-14 04:44:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-12-14 04:44:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.6875) internal successors, (108), 64 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 04:44:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:55,616 INFO L225 Difference]: With dead ends: 2900 [2022-12-14 04:44:55,617 INFO L226 Difference]: Without dead ends: 2811 [2022-12-14 04:44:55,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7832 ImplicationChecksByTransitivity, 144.4s TimeCoverageRelationStatistics Valid=4546, Invalid=22489, Unknown=25, NotChecked=0, Total=27060 [2022-12-14 04:44:55,619 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2706 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3599 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2706 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 3599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:55,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2706 Valid, 0 Invalid, 3796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 3599 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2022-12-14 04:44:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2022-12-14 04:44:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 842. [2022-12-14 04:44:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 840 states have (on average 2.276190476190476) internal successors, (1912), 841 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1912 transitions. [2022-12-14 04:44:55,638 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1912 transitions. Word has length 36 [2022-12-14 04:44:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:55,638 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1912 transitions. [2022-12-14 04:44:55,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.6875) internal successors, (108), 64 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1912 transitions. [2022-12-14 04:44:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 04:44:55,639 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:55,639 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:55,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 04:44:55,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 04:44:55,841 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:44:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash 659361885, now seen corresponding path program 2 times [2022-12-14 04:44:55,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:55,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267509369] [2022-12-14 04:44:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:44:56,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:56,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267509369] [2022-12-14 04:44:56,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267509369] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:44:56,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631268516] [2022-12-14 04:44:56,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 04:44:56,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:56,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:56,058 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:44:56,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 04:44:56,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 04:44:56,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:44:56,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 04:44:56,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:44:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 04:44:56,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:44:56,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631268516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:56,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:44:56,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2022-12-14 04:44:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105911580] [2022-12-14 04:44:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:56,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:44:56,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:56,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:44:56,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-14 04:44:56,226 INFO L87 Difference]: Start difference. First operand 842 states and 1912 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:56,367 INFO L93 Difference]: Finished difference Result 1102 states and 2436 transitions. [2022-12-14 04:44:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:44:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-14 04:44:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:56,370 INFO L225 Difference]: With dead ends: 1102 [2022-12-14 04:44:56,370 INFO L226 Difference]: Without dead ends: 1102 [2022-12-14 04:44:56,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-14 04:44:56,371 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:56,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:44:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2022-12-14 04:44:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 892. [2022-12-14 04:44:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 890 states have (on average 2.2887640449438202) internal successors, (2037), 891 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2037 transitions. [2022-12-14 04:44:56,389 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2037 transitions. Word has length 38 [2022-12-14 04:44:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:56,389 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 2037 transitions. [2022-12-14 04:44:56,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2037 transitions. [2022-12-14 04:44:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 04:44:56,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:56,391 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:56,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 04:44:56,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:56,593 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:44:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:56,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1240780414, now seen corresponding path program 3 times [2022-12-14 04:44:56,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:56,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722334645] [2022-12-14 04:44:56,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:56,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:56,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:56,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722334645] [2022-12-14 04:44:56,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722334645] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:44:56,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545383581] [2022-12-14 04:44:56,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 04:44:56,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:56,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:56,813 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:44:56,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 04:44:56,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 04:44:56,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:44:56,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 04:44:56,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:44:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:44:56,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:44:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:44:57,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545383581] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:44:57,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [923379425] [2022-12-14 04:44:57,056 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:337) 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-12-14 04:44:57,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:44:57,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2022-12-14 04:44:57,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687724562] [2022-12-14 04:44:57,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:44:57,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 04:44:57,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:57,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 04:44:57,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-12-14 04:44:57,058 INFO L87 Difference]: Start difference. First operand 892 states and 2037 transitions. Second operand has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:57,469 INFO L93 Difference]: Finished difference Result 1246 states and 2729 transitions. [2022-12-14 04:44:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 04:44:57,469 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-12-14 04:44:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:57,475 INFO L225 Difference]: With dead ends: 1246 [2022-12-14 04:44:57,475 INFO L226 Difference]: Without dead ends: 1134 [2022-12-14 04:44:57,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2022-12-14 04:44:57,476 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:57,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:44:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-12-14 04:44:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 828. [2022-12-14 04:44:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 826 states have (on average 2.250605326876513) internal successors, (1859), 827 states have internal predecessors, (1859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1859 transitions. [2022-12-14 04:44:57,486 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1859 transitions. Word has length 39 [2022-12-14 04:44:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:57,487 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1859 transitions. [2022-12-14 04:44:57,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1859 transitions. [2022-12-14 04:44:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 04:44:57,488 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:57,488 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:57,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 04:44:57,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 04:44:57,689 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:44:57,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1762476110, now seen corresponding path program 4 times [2022-12-14 04:44:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:57,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782752351] [2022-12-14 04:44:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 04:44:57,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:57,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782752351] [2022-12-14 04:44:57,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782752351] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:44:57,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667674458] [2022-12-14 04:44:57,933 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 04:44:57,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:57,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:57,934 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:44:57,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 04:44:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:58,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 04:44:58,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:44:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 04:44:58,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:44:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 04:44:58,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667674458] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:44:58,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [328760317] [2022-12-14 04:44:58,233 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:337) 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-12-14 04:44:58,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:44:58,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-12-14 04:44:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789595548] [2022-12-14 04:44:58,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:44:58,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 04:44:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 04:44:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2022-12-14 04:44:58,234 INFO L87 Difference]: Start difference. First operand 828 states and 1859 transitions. Second operand has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:58,750 INFO L93 Difference]: Finished difference Result 1978 states and 4204 transitions. [2022-12-14 04:44:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 04:44:58,750 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-12-14 04:44:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:58,756 INFO L225 Difference]: With dead ends: 1978 [2022-12-14 04:44:58,756 INFO L226 Difference]: Without dead ends: 1978 [2022-12-14 04:44:58,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 04:44:58,757 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 278 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:58,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 0 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 04:44:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2022-12-14 04:44:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1096. [2022-12-14 04:44:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1094 states have (on average 2.3190127970749543) internal successors, (2537), 1095 states have internal predecessors, (2537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 2537 transitions. [2022-12-14 04:44:58,774 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 2537 transitions. Word has length 45 [2022-12-14 04:44:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:58,774 INFO L495 AbstractCegarLoop]: Abstraction has 1096 states and 2537 transitions. [2022-12-14 04:44:58,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 2537 transitions. [2022-12-14 04:44:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 04:44:58,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:58,775 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:58,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 04:44:58,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 04:44:58,977 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:44:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1836061621, now seen corresponding path program 4 times [2022-12-14 04:44:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:58,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941865025] [2022-12-14 04:44:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:45:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:45:00,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:45:00,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941865025] [2022-12-14 04:45:00,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941865025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:45:00,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313324777] [2022-12-14 04:45:00,416 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 04:45:00,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:45:00,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:45:00,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:45:00,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 04:45:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:45:00,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 93 conjunts are in the unsatisfiable core [2022-12-14 04:45:00,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:45:00,922 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 22 treesize of output 17 [2022-12-14 04:45:01,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:01,367 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 52 treesize of output 38 [2022-12-14 04:45:01,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:01,784 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 52 treesize of output 38 [2022-12-14 04:45:02,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-14 04:45:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:45:19,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:45:21,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-12-14 04:45:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:45:21,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313324777] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:45:21,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [499965973] [2022-12-14 04:45:21,968 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:337) 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-12-14 04:45:21,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:45:21,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 72 [2022-12-14 04:45:21,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652504219] [2022-12-14 04:45:21,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:45:21,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-12-14 04:45:21,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:45:21,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-12-14 04:45:21,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4995, Unknown=3, NotChecked=0, Total=5256 [2022-12-14 04:45:21,971 INFO L87 Difference]: Start difference. First operand 1096 states and 2537 transitions. Second operand has 73 states, 72 states have (on average 2.125) internal successors, (153), 73 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:46:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:46:16,664 INFO L93 Difference]: Finished difference Result 5362 states and 11969 transitions. [2022-12-14 04:46:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-12-14 04:46:16,665 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.125) internal successors, (153), 73 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-12-14 04:46:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:46:16,673 INFO L225 Difference]: With dead ends: 5362 [2022-12-14 04:46:16,673 INFO L226 Difference]: Without dead ends: 5113 [2022-12-14 04:46:16,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18227 ImplicationChecksByTransitivity, 55.7s TimeCoverageRelationStatistics Valid=4145, Invalid=48522, Unknown=3, NotChecked=0, Total=52670 [2022-12-14 04:46:16,676 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12514 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 12514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2022-12-14 04:46:16,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 0 Invalid, 12632 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [118 Valid, 12514 Invalid, 0 Unknown, 0 Unchecked, 19.6s Time] [2022-12-14 04:46:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2022-12-14 04:46:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 2071. [2022-12-14 04:46:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2069 states have (on average 2.4229096181730303) internal successors, (5013), 2070 states have internal predecessors, (5013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:46:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 5013 transitions. [2022-12-14 04:46:16,716 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 5013 transitions. Word has length 51 [2022-12-14 04:46:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:46:16,716 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 5013 transitions. [2022-12-14 04:46:16,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.125) internal successors, (153), 73 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:46:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 5013 transitions. [2022-12-14 04:46:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 04:46:16,718 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:46:16,718 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:46:16,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 04:46:16,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 04:46:16,919 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:46:16,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:46:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash 897415833, now seen corresponding path program 5 times [2022-12-14 04:46:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:46:16,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811680049] [2022-12-14 04:46:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:46:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:46:18,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:46:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811680049] [2022-12-14 04:46:18,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811680049] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:46:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912951444] [2022-12-14 04:46:18,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 04:46:18,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:46:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:46:18,461 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:46:18,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60f38739-4c45-4f57-b12f-1f373f9c73a0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 04:46:18,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 04:46:18,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:46:18,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-14 04:46:18,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:46:18,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:18,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-12-14 04:46:18,737 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 04:46:18,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 04:46:18,977 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 29 treesize of output 24 [2022-12-14 04:46:19,075 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 27 treesize of output 29 [2022-12-14 04:46:19,468 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 36 treesize of output 31 [2022-12-14 04:46:46,794 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 50 treesize of output 45 [2022-12-14 04:49:14,281 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 100 treesize of output 90 [2022-12-14 04:49:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 32 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:49:30,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:50:02,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (|v_t1Thread1of1ForFork1_push_#t~ret34#1_143| Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_86| Int) (|v_t2Thread1of1ForFork0_pop_#t~ret36#1_105| Int) (v_ArrVal_989 Int) (|v_t2Thread1of1ForFork0_pop_~stack#1.offset_71| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_143| (+ |v_t2Thread1of1ForFork0_pop_#t~ret36#1_105| 1)) (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_988) |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_86| (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_143| 4)) v_ArrVal_989) (+ (* |v_t2Thread1of1ForFork0_pop_#t~ret36#1_105| 4) |v_t2Thread1of1ForFork0_pop_~stack#1.offset_71|)) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_86| |v_t2Thread1of1ForFork0_pop_~stack#1.offset_71|))) is different from false [2022-12-14 04:50:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:50:38,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912951444] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:50:38,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1653097821] [2022-12-14 04:50:38,618 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:337) 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-12-14 04:50:38,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:50:38,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 22] total 75 [2022-12-14 04:50:38,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873910339] [2022-12-14 04:50:38,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:50:38,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-14 04:50:38,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:38,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-14 04:50:38,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=5175, Unknown=164, NotChecked=148, Total=5852 [2022-12-14 04:50:38,623 INFO L87 Difference]: Start difference. First operand 2071 states and 5013 transitions. Second operand has 77 states, 76 states have (on average 2.013157894736842) internal successors, (153), 76 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:40,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:50:42,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:50:44,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:50:53,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:50:55,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:10,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:12,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:14,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:16,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:18,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:20,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:22,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:32,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:34,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:36,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:38,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:40,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:53,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:55,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:57,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:51:59,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:01,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:03,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:06,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:08,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:10,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:12,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:24,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:26,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:28,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:30,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:33,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:35,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:37,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:39,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:41,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:52,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:55,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:57,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:52:59,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:53:01,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:53:03,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:53:05,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:53:08,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 04:53:10,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 04:53:12,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 04:53:14,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 04:53:29,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 04:53:31,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 04:53:45,392 WARN L233 SmtUtils]: Spent 9.13s on a formula simplification. DAG size of input: 167 DAG size of output: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:53:47,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:53:49,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:53:51,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:53:53,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 04:53:55,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 04:53:57,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]