./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:11:13,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:11:13,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:11:13,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:11:13,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:11:13,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:11:13,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:11:13,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:11:13,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:11:13,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:11:13,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:11:13,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:11:13,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:11:13,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:11:13,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:11:13,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:11:13,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:11:13,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:11:13,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:11:13,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:11:13,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:11:13,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:11:13,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:11:13,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:11:13,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:11:13,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:11:13,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:11:13,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:11:13,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:11:13,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:11:13,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:11:13,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:11:13,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:11:13,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:11:13,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:11:13,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:11:13,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:11:13,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:11:13,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:11:13,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:11:13,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:11:13,864 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:11:13,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:11:13,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:11:13,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:11:13,906 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:11:13,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:11:13,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:11:13,908 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:11:13,908 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:11:13,908 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:11:13,908 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:11:13,909 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:11:13,910 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:11:13,910 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:11:13,910 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:11:13,910 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:11:13,911 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:11:13,911 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:11:13,911 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:11:13,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:11:13,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:11:13,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:11:13,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:11:13,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:11:13,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:11:13,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:11:13,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:11:13,915 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:11:13,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:11:13,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:11:13,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:11:13,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:11:13,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:11:13,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:11:13,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:11:13,917 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:11:13,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:11:13,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:11:13,918 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:11:13,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:11:13,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:11:13,919 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:11:13,919 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_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 [2022-11-03 02:11:14,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:11:14,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:11:14,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:11:14,238 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:11:14,239 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:11:14,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2022-11-03 02:11:14,314 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/data/daab41067/a2c2c75fa0614000a0dab30aeb3f0451/FLAG5c3003c6b [2022-11-03 02:11:14,852 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:11:14,852 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2022-11-03 02:11:14,859 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/data/daab41067/a2c2c75fa0614000a0dab30aeb3f0451/FLAG5c3003c6b [2022-11-03 02:11:15,218 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/data/daab41067/a2c2c75fa0614000a0dab30aeb3f0451 [2022-11-03 02:11:15,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:11:15,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:11:15,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:11:15,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:11:15,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:11:15,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd1ff9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15, skipping insertion in model container [2022-11-03 02:11:15,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:11:15,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:11:15,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-11-03 02:11:15,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:11:15,505 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:11:15,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-11-03 02:11:15,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:11:15,543 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:11:15,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15 WrapperNode [2022-11-03 02:11:15,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:11:15,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:11:15,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:11:15,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:11:15,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,585 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-11-03 02:11:15,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:11:15,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:11:15,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:11:15,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:11:15,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,625 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:11:15,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:11:15,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:11:15,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:11:15,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (1/1) ... [2022-11-03 02:11:15,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:11:15,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:11:15,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:11:15,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:11:15,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:11:15,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 02:11:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 02:11:15,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 02:11:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 02:11:15,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:11:15,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:11:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:11:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 02:11:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 02:11:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:11:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:11:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:11:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:11:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:11:15,714 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:11:15,863 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:11:15,865 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:11:16,327 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:11:16,471 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:11:16,472 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 02:11:16,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:11:16 BoogieIcfgContainer [2022-11-03 02:11:16,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:11:16,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:11:16,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:11:16,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:11:16,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:11:15" (1/3) ... [2022-11-03 02:11:16,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a111019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:11:16, skipping insertion in model container [2022-11-03 02:11:16,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:11:15" (2/3) ... [2022-11-03 02:11:16,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a111019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:11:16, skipping insertion in model container [2022-11-03 02:11:16,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:11:16" (3/3) ... [2022-11-03 02:11:16,484 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-11-03 02:11:16,493 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:11:16,503 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:11:16,504 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:11:16,504 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:11:16,629 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-03 02:11:16,693 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:11:16,711 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 178 transitions, 372 flow [2022-11-03 02:11:16,716 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 178 transitions, 372 flow [2022-11-03 02:11:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 178 transitions, 372 flow [2022-11-03 02:11:16,847 INFO L130 PetriNetUnfolder]: 13/176 cut-off events. [2022-11-03 02:11:16,847 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 02:11:16,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 176 events. 13/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-11-03 02:11:16,853 INFO L118 LiptonReduction]: Number of co-enabled transitions 500 [2022-11-03 02:11:25,248 INFO L133 LiptonReduction]: Checked pairs total: 754 [2022-11-03 02:11:25,252 INFO L135 LiptonReduction]: Total number of compositions: 186 [2022-11-03 02:11:25,265 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 22 transitions, 60 flow [2022-11-03 02:11:25,281 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 36 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:25,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:11:25,310 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;@8f2ac55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:11:25,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-03 02:11:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:11:25,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:25,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:25,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:11:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1780293919, now seen corresponding path program 1 times [2022-11-03 02:11:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:25,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979167013] [2022-11-03 02:11:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:26,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:26,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979167013] [2022-11-03 02:11:26,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979167013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:11:26,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:11:26,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:11:26,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641573097] [2022-11-03 02:11:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:11:26,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:11:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:11:26,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:11:26,467 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:26,606 INFO L93 Difference]: Finished difference Result 101 states and 222 transitions. [2022-11-03 02:11:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:11:26,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:11:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:26,621 INFO L225 Difference]: With dead ends: 101 [2022-11-03 02:11:26,621 INFO L226 Difference]: Without dead ends: 91 [2022-11-03 02:11:26,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:11:26,627 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:26,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-03 02:11:26,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 48. [2022-11-03 02:11:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 47 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 104 transitions. [2022-11-03 02:11:26,683 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 104 transitions. Word has length 13 [2022-11-03 02:11:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:26,684 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 104 transitions. [2022-11-03 02:11:26,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 104 transitions. [2022-11-03 02:11:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:11:26,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:26,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:26,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:11:26,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:11:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash -273236112, now seen corresponding path program 1 times [2022-11-03 02:11:26,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:26,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900835756] [2022-11-03 02:11:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:26,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900835756] [2022-11-03 02:11:26,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900835756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:11:26,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:11:26,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:11:26,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004502927] [2022-11-03 02:11:26,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:11:26,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:11:26,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:26,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:11:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:11:26,874 INFO L87 Difference]: Start difference. First operand 48 states and 104 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:26,970 INFO L93 Difference]: Finished difference Result 68 states and 134 transitions. [2022-11-03 02:11:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:11:26,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:11:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:26,976 INFO L225 Difference]: With dead ends: 68 [2022-11-03 02:11:26,977 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 02:11:26,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:11:26,980 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:26,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 02:11:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-03 02:11:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.1875) internal successors, (105), 48 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 105 transitions. [2022-11-03 02:11:27,001 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 105 transitions. Word has length 15 [2022-11-03 02:11:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:27,002 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 105 transitions. [2022-11-03 02:11:27,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 105 transitions. [2022-11-03 02:11:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:11:27,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:27,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:27,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:11:27,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:11:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1683572409, now seen corresponding path program 1 times [2022-11-03 02:11:27,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:27,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299506522] [2022-11-03 02:11:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:27,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:27,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299506522] [2022-11-03 02:11:27,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299506522] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:11:27,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770471885] [2022-11-03 02:11:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:27,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:27,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:11:27,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:11:27,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:11:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:27,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:11:27,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:27,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:27,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770471885] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:27,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854801386] [2022-11-03 02:11:27,346 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:11:27,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:11:27,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-03 02:11:27,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577003927] [2022-11-03 02:11:27,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:11:27,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:11:27,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:27,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:11:27,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:11:27,351 INFO L87 Difference]: Start difference. First operand 49 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:27,536 INFO L93 Difference]: Finished difference Result 93 states and 194 transitions. [2022-11-03 02:11:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:11:27,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:11:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:27,538 INFO L225 Difference]: With dead ends: 93 [2022-11-03 02:11:27,538 INFO L226 Difference]: Without dead ends: 93 [2022-11-03 02:11:27,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:11:27,539 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:27,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-03 02:11:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 51. [2022-11-03 02:11:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 115 transitions. [2022-11-03 02:11:27,546 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 115 transitions. Word has length 16 [2022-11-03 02:11:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:27,547 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 115 transitions. [2022-11-03 02:11:27,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 115 transitions. [2022-11-03 02:11:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:11:27,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:27,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:27,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:27,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:27,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:11:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:27,763 INFO L85 PathProgramCache]: Analyzing trace with hash 909265741, now seen corresponding path program 1 times [2022-11-03 02:11:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:27,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365955127] [2022-11-03 02:11:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:27,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:27,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365955127] [2022-11-03 02:11:27,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365955127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:11:27,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:11:27,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:11:27,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476798619] [2022-11-03 02:11:27,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:11:27,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:11:27,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:11:27,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:11:27,839 INFO L87 Difference]: Start difference. First operand 51 states and 115 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:27,938 INFO L93 Difference]: Finished difference Result 71 states and 151 transitions. [2022-11-03 02:11:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:11:27,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:11:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:27,940 INFO L225 Difference]: With dead ends: 71 [2022-11-03 02:11:27,940 INFO L226 Difference]: Without dead ends: 65 [2022-11-03 02:11:27,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:11:27,942 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:27,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-03 02:11:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2022-11-03 02:11:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 111 transitions. [2022-11-03 02:11:27,957 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 111 transitions. Word has length 16 [2022-11-03 02:11:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:27,958 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 111 transitions. [2022-11-03 02:11:27,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 111 transitions. [2022-11-03 02:11:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:11:27,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:27,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:27,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:11:27,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:11:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash -861459233, now seen corresponding path program 2 times [2022-11-03 02:11:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:27,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413090452] [2022-11-03 02:11:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:27,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:28,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:28,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413090452] [2022-11-03 02:11:28,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413090452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:11:28,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:11:28,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:11:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635388204] [2022-11-03 02:11:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:11:28,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:11:28,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:28,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:11:28,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:11:28,064 INFO L87 Difference]: Start difference. First operand 51 states and 111 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:28,133 INFO L93 Difference]: Finished difference Result 63 states and 137 transitions. [2022-11-03 02:11:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:11:28,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:11:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:28,134 INFO L225 Difference]: With dead ends: 63 [2022-11-03 02:11:28,134 INFO L226 Difference]: Without dead ends: 61 [2022-11-03 02:11:28,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:11:28,135 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:28,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-03 02:11:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2022-11-03 02:11:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.2083333333333335) internal successors, (106), 48 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 106 transitions. [2022-11-03 02:11:28,140 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 106 transitions. Word has length 16 [2022-11-03 02:11:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:28,141 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 106 transitions. [2022-11-03 02:11:28,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 106 transitions. [2022-11-03 02:11:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:11:28,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:28,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:28,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:11:28,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:11:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1728353993, now seen corresponding path program 2 times [2022-11-03 02:11:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:28,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711743102] [2022-11-03 02:11:28,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:28,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:28,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711743102] [2022-11-03 02:11:28,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711743102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:11:28,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:11:28,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:11:28,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440444269] [2022-11-03 02:11:28,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:11:28,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:11:28,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:28,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:11:28,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:11:28,218 INFO L87 Difference]: Start difference. First operand 49 states and 106 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:28,307 INFO L93 Difference]: Finished difference Result 63 states and 140 transitions. [2022-11-03 02:11:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:11:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:11:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:28,308 INFO L225 Difference]: With dead ends: 63 [2022-11-03 02:11:28,308 INFO L226 Difference]: Without dead ends: 63 [2022-11-03 02:11:28,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:11:28,310 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:28,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-03 02:11:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-11-03 02:11:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 121 transitions. [2022-11-03 02:11:28,326 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 121 transitions. Word has length 16 [2022-11-03 02:11:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:28,327 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 121 transitions. [2022-11-03 02:11:28,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 121 transitions. [2022-11-03 02:11:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:11:28,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:28,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:28,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:11:28,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:11:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:28,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2143715230, now seen corresponding path program 1 times [2022-11-03 02:11:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:28,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723313820] [2022-11-03 02:11:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:11:28,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:28,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723313820] [2022-11-03 02:11:28,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723313820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:11:28,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:11:28,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:11:28,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288409261] [2022-11-03 02:11:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:11:28,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:11:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:28,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:11:28,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:11:28,473 INFO L87 Difference]: Start difference. First operand 55 states and 121 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:28,536 INFO L93 Difference]: Finished difference Result 67 states and 137 transitions. [2022-11-03 02:11:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:11:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-03 02:11:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:28,537 INFO L225 Difference]: With dead ends: 67 [2022-11-03 02:11:28,537 INFO L226 Difference]: Without dead ends: 56 [2022-11-03 02:11:28,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:11:28,538 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:28,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-03 02:11:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-03 02:11:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.2181818181818183) internal successors, (122), 55 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 122 transitions. [2022-11-03 02:11:28,543 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 122 transitions. Word has length 18 [2022-11-03 02:11:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:28,543 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 122 transitions. [2022-11-03 02:11:28,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 122 transitions. [2022-11-03 02:11:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:11:28,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:28,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:28,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:11:28,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:11:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1276568966, now seen corresponding path program 1 times [2022-11-03 02:11:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:28,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602017030] [2022-11-03 02:11:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:11:28,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:28,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602017030] [2022-11-03 02:11:28,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602017030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:11:28,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:11:28,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:11:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902757724] [2022-11-03 02:11:28,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:11:28,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:11:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:28,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:11:28,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:11:28,684 INFO L87 Difference]: Start difference. First operand 56 states and 122 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:28,721 INFO L93 Difference]: Finished difference Result 46 states and 96 transitions. [2022-11-03 02:11:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:11:28,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:11:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:28,723 INFO L225 Difference]: With dead ends: 46 [2022-11-03 02:11:28,723 INFO L226 Difference]: Without dead ends: 46 [2022-11-03 02:11:28,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:11:28,724 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:28,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:11:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-03 02:11:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-03 02:11:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 96 transitions. [2022-11-03 02:11:28,727 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 96 transitions. Word has length 19 [2022-11-03 02:11:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:28,728 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 96 transitions. [2022-11-03 02:11:28,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 96 transitions. [2022-11-03 02:11:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:11:28,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:28,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:28,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:11:28,730 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:11:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:28,730 INFO L85 PathProgramCache]: Analyzing trace with hash 867403230, now seen corresponding path program 2 times [2022-11-03 02:11:28,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:28,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602283570] [2022-11-03 02:11:28,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:28,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:31,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:31,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602283570] [2022-11-03 02:11:31,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602283570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:11:31,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593605435] [2022-11-03 02:11:31,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:11:31,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:31,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:11:31,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:11:31,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:11:31,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:11:31,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:11:31,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:11:31,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:31,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 02:11:31,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 02:11:31,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:31,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-11-03 02:11:32,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:32,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:11:32,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 28 [2022-11-03 02:11:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:32,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:33,644 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (+ c_~i~0 1)) (.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_192 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (or (not (= c_~i~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (forall ((v_ArrVal_193 (Array Int Int)) (~q1~0.base Int)) (let ((.cse5 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193))) (let ((.cse2 (select .cse5 ~q1~0.base))) (or (< (select .cse2 .cse3) c_~i~0) (not (= c_~j~0 (select .cse2 .cse4))) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) .cse7)))))))) (forall ((v_ArrVal_192 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (or (forall ((v_ArrVal_193 (Array Int Int)) (~q1~0.base Int)) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193))) (let ((.cse8 (select .cse9 ~q1~0.base))) (or (< (select .cse8 .cse3) .cse7) (not (= c_~j~0 (select .cse8 .cse4))) (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) c_~i~0))))) (not (= c_~i~0 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1)))))))) (not (<= 0 c_~q1_back~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-03 02:11:33,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:11:33,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 82 [2022-11-03 02:11:33,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:11:33,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 493 treesize of output 537 [2022-11-03 02:11:33,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:11:33,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 413 treesize of output 385 [2022-11-03 02:11:33,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:11:33,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 319 treesize of output 365 [2022-11-03 02:11:57,103 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:11:57,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 82 [2022-11-03 02:11:57,191 INFO L356 Elim1Store]: treesize reduction 50, result has 50.5 percent of original size [2022-11-03 02:11:57,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 325 treesize of output 335 [2022-11-03 02:11:57,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:11:57,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 261 treesize of output 257 [2022-11-03 02:11:57,314 INFO L356 Elim1Store]: treesize reduction 40, result has 55.1 percent of original size [2022-11-03 02:11:57,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 184 [2022-11-03 02:12:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:12:01,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593605435] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:01,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1147175859] [2022-11-03 02:12:01,561 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:12:01,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:12:01,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2022-11-03 02:12:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181127585] [2022-11-03 02:12:01,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:01,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:12:01,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:01,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:12:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1075, Unknown=2, NotChecked=66, Total=1260 [2022-11-03 02:12:01,565 INFO L87 Difference]: Start difference. First operand 46 states and 96 transitions. Second operand has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:03,161 WARN L833 $PredicateComparison]: unable to prove that (and (or (let ((.cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (+ c_~i~0 1)) (.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_192 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (or (not (= c_~i~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (forall ((v_ArrVal_193 (Array Int Int)) (~q1~0.base Int)) (let ((.cse5 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193))) (let ((.cse2 (select .cse5 ~q1~0.base))) (or (< (select .cse2 .cse3) c_~i~0) (not (= c_~j~0 (select .cse2 .cse4))) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) .cse7)))))))) (forall ((v_ArrVal_192 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (or (forall ((v_ArrVal_193 (Array Int Int)) (~q1~0.base Int)) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193))) (let ((.cse8 (select .cse9 ~q1~0.base))) (or (< (select .cse8 .cse3) .cse7) (not (= c_~j~0 (select .cse8 .cse4))) (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) c_~i~0))))) (not (= c_~i~0 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1)))))))) (not (<= 0 c_~q1_back~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1))) is different from false [2022-11-03 02:12:03,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~i~0 1)) (.cse7 (* c_~q1_front~0 4)) (.cse6 (* c_~q1_back~0 4)) (.cse4 (* c_~q2_front~0 4)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q2_back~0 c_~n2~0))) (.cse2 (not (< c_~q1_back~0 c_~n1~0))) (.cse9 (not (<= 0 c_~q2_back~0))) (.cse3 (* c_~q2_back~0 4))) (and (or .cse0 .cse1 .cse2 (let ((.cse5 (< c_~j~0 c_~i~0))) (and (or (= .cse3 .cse4) .cse5) (= .cse6 .cse7) (or .cse5 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< c_~j~0 .cse8))) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9) (<= c_~j~0 c_~i~0) (or (let ((.cse14 (+ c_~q2~0.offset .cse4)) (.cse11 (+ .cse6 c_~q1~0.offset)) (.cse12 (+ .cse7 c_~q1~0.offset))) (and (forall ((v_ArrVal_193 (Array Int Int)) (~q1~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193))) (let ((.cse10 (select .cse13 ~q1~0.base))) (or (not (= c_~j~0 (select .cse10 .cse11))) (< (select .cse10 .cse12) .cse8) (< (select (select .cse13 c_~q2~0.base) .cse14) c_~i~0))))) (forall ((v_ArrVal_193 (Array Int Int)) (~q1~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193))) (let ((.cse16 (select .cse15 ~q1~0.base))) (or (< (select (select .cse15 c_~q2~0.base) .cse14) .cse8) (not (= c_~j~0 (select .cse16 .cse11))) (< (select .cse16 .cse12) c_~i~0))))))) .cse0 .cse1 .cse2 .cse9 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ .cse3 c_~q2~0.offset))))) (< c_~i~0 (+ c_~j~0 1)))) is different from false [2022-11-03 02:12:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:11,585 INFO L93 Difference]: Finished difference Result 271 states and 586 transitions. [2022-11-03 02:12:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-03 02:12:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:12:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:11,588 INFO L225 Difference]: With dead ends: 271 [2022-11-03 02:12:11,588 INFO L226 Difference]: Without dead ends: 252 [2022-11-03 02:12:11,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=870, Invalid=5615, Unknown=7, NotChecked=480, Total=6972 [2022-11-03 02:12:11,591 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 283 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:11,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 0 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1224 Invalid, 0 Unknown, 654 Unchecked, 1.5s Time] [2022-11-03 02:12:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-03 02:12:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 97. [2022-11-03 02:12:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.2916666666666665) internal successors, (220), 96 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 220 transitions. [2022-11-03 02:12:11,598 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 220 transitions. Word has length 19 [2022-11-03 02:12:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:11,598 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 220 transitions. [2022-11-03 02:12:11,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 220 transitions. [2022-11-03 02:12:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:12:11,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:11,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:11,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:11,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:11,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:12:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 852537080, now seen corresponding path program 3 times [2022-11-03 02:12:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:11,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840626838] [2022-11-03 02:12:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:14,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:14,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840626838] [2022-11-03 02:12:14,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840626838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:12:14,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766328423] [2022-11-03 02:12:14,008 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:12:14,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:14,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:14,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:14,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:12:14,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:12:14,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:12:14,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-03 02:12:14,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:14,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:14,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:14,175 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:12:14,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2022-11-03 02:12:14,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-03 02:12:14,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:14,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:14,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:14,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:14,370 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:12:14,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:12:14,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 02:12:14,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 02:12:14,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:14,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-03 02:12:15,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:15,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 20 [2022-11-03 02:12:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:15,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:17,624 INFO L356 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2022-11-03 02:12:17,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 100 [2022-11-03 02:12:17,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:17,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:17,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 429 treesize of output 464 [2022-11-03 02:12:17,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:17,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 337 treesize of output 321 [2022-11-03 02:12:17,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:17,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:17,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 236 [2022-11-03 02:12:20,432 INFO L356 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2022-11-03 02:12:20,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 100 [2022-11-03 02:12:20,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:20,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:20,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 339 treesize of output 384 [2022-11-03 02:12:20,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:20,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 257 treesize of output 257 [2022-11-03 02:12:20,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:20,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:20,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 218 treesize of output 234 [2022-11-03 02:12:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:24,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766328423] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:24,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [271431265] [2022-11-03 02:12:24,016 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:12:24,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:12:24,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2022-11-03 02:12:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321802501] [2022-11-03 02:12:24,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:24,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:12:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:24,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:12:24,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1142, Unknown=3, NotChecked=0, Total=1260 [2022-11-03 02:12:24,020 INFO L87 Difference]: Start difference. First operand 97 states and 220 transitions. Second operand has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:28,213 INFO L93 Difference]: Finished difference Result 162 states and 335 transitions. [2022-11-03 02:12:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 02:12:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:12:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:28,215 INFO L225 Difference]: With dead ends: 162 [2022-11-03 02:12:28,215 INFO L226 Difference]: Without dead ends: 150 [2022-11-03 02:12:28,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=357, Invalid=3180, Unknown=3, NotChecked=0, Total=3540 [2022-11-03 02:12:28,218 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:28,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 323 Invalid, 0 Unknown, 367 Unchecked, 0.4s Time] [2022-11-03 02:12:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-03 02:12:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 119. [2022-11-03 02:12:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.2457627118644066) internal successors, (265), 118 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 265 transitions. [2022-11-03 02:12:28,224 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 265 transitions. Word has length 19 [2022-11-03 02:12:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:28,225 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 265 transitions. [2022-11-03 02:12:28,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 265 transitions. [2022-11-03 02:12:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:12:28,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:28,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:28,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:28,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:12:28,442 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:12:28,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:28,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1614453282, now seen corresponding path program 4 times [2022-11-03 02:12:28,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:28,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038832417] [2022-11-03 02:12:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:28,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:30,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:30,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038832417] [2022-11-03 02:12:30,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038832417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:12:30,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317572573] [2022-11-03 02:12:30,350 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:12:30,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:30,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:30,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:30,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:12:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:30,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 02:12:30,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:30,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-03 02:12:30,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 02:12:30,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:30,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-11-03 02:12:31,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:31,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 38 [2022-11-03 02:12:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:31,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:31,849 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (let ((.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (or (< (select (select .cse0 c_~q2~0.base) .cse1) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse2 (select .cse0 ~q1~0.base))) (or (not (= c_~j~0 (select .cse2 .cse3))) (< (+ (select .cse2 .cse4) 1) c_~N~0))))))) (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (or (forall ((~q1~0.base Int)) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (< (select .cse5 .cse4) c_~N~0) (not (= c_~j~0 (select .cse5 .cse3)))))) (< (+ (select (select .cse6 c_~q2~0.base) .cse1) 1) c_~N~0))))))) is different from false [2022-11-03 02:12:32,097 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ c_~i~0 1)) (.cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((~q1~0.base Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) c_~i~0) (< (select .cse4 .cse5) .cse6) (not (= c_~j~0 (select .cse4 .cse7)))))))))) (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((~q1~0.base Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse9 (select .cse10 ~q1~0.base))) (or (< (select .cse9 .cse5) c_~i~0) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) .cse6) (not (= c_~j~0 (select .cse9 .cse7)))))))))))) (not (<= 0 c_~q1_back~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-03 02:12:32,141 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:32,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 82 [2022-11-03 02:12:32,198 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:32,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 493 treesize of output 537 [2022-11-03 02:12:32,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:32,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 301 treesize of output 347 [2022-11-03 02:12:32,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:32,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 377 treesize of output 349 [2022-11-03 02:12:54,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:54,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 82 [2022-11-03 02:12:54,432 INFO L356 Elim1Store]: treesize reduction 50, result has 50.5 percent of original size [2022-11-03 02:12:54,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 493 treesize of output 487 [2022-11-03 02:12:54,511 INFO L356 Elim1Store]: treesize reduction 40, result has 55.1 percent of original size [2022-11-03 02:12:54,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 371 [2022-11-03 02:12:54,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:12:54,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 377 treesize of output 349 [2022-11-03 02:12:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:12:58,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317572573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:58,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1739663954] [2022-11-03 02:12:58,333 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:12:58,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:12:58,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-11-03 02:12:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322648883] [2022-11-03 02:12:58,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:58,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:12:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:12:58,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1075, Unknown=2, NotChecked=134, Total=1332 [2022-11-03 02:12:58,336 INFO L87 Difference]: Start difference. First operand 119 states and 265 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:59,851 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~j~0 c_~i~0) (or (let ((.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ c_~i~0 1)) (.cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((~q1~0.base Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) c_~i~0) (< (select .cse4 .cse5) .cse6) (not (= c_~j~0 (select .cse4 .cse7)))))))))) (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((~q1~0.base Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse9 (select .cse10 ~q1~0.base))) (or (< (select .cse9 .cse5) c_~i~0) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) .cse6) (not (= c_~j~0 (select .cse9 .cse7)))))))))))) (not (<= 0 c_~q1_back~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) (< c_~i~0 (+ c_~j~0 1))) is different from false [2022-11-03 02:12:59,863 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~i~0 1)) (.cse6 (* c_~q1_back~0 4)) (.cse4 (* c_~q2_front~0 4)) (.cse7 (* c_~q1_front~0 4)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q2_back~0 c_~n2~0))) (.cse2 (not (< c_~q1_back~0 c_~n1~0))) (.cse9 (not (<= 0 c_~q2_back~0))) (.cse3 (* c_~q2_back~0 4))) (and (or .cse0 .cse1 .cse2 (let ((.cse5 (< c_~j~0 c_~i~0))) (and (or (= .cse3 .cse4) .cse5) (= .cse6 .cse7) (or .cse5 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< c_~j~0 .cse8))) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9) (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1)) (or (let ((.cse13 (+ .cse7 c_~q1~0.offset)) (.cse11 (+ c_~q2~0.offset .cse4)) (.cse14 (+ .cse6 c_~q1~0.offset))) (and (forall ((~q1~0.base Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse12 (select .cse10 ~q1~0.base))) (or (< (select (select .cse10 c_~q2~0.base) .cse11) c_~i~0) (< (select .cse12 .cse13) .cse8) (not (= c_~j~0 (select .cse12 .cse14))))))) (forall ((~q1~0.base Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse15 (select .cse16 ~q1~0.base))) (or (< (select .cse15 .cse13) c_~i~0) (< (select (select .cse16 c_~q2~0.base) .cse11) .cse8) (not (= c_~j~0 (select .cse15 .cse14))))))))) .cse0 .cse1 .cse2 .cse9 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ .cse3 c_~q2~0.offset))))))) is different from false [2022-11-03 02:13:00,424 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~q2_front~0 4))) (let ((.cse21 (select |c_#memory_int| c_~q2~0.base)) (.cse16 (+ c_~q2~0.offset .cse23)) (.cse18 (+ c_~i~0 1)) (.cse14 (* c_~q1_back~0 4)) (.cse13 (* c_~q1_front~0 4)) (.cse22 (* c_~q2_back~0 4)) (.cse6 (< c_~j~0 c_~i~0))) (let ((.cse11 (* 4 c_~n1~0)) (.cse4 (or (= .cse22 .cse23) .cse6)) (.cse5 (= .cse14 .cse13)) (.cse7 (< c_~j~0 .cse18)) (.cse8 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (select .cse21 .cse16)) (.cse12 (+ .cse13 c_~q1~0.offset)) (.cse10 (+ .cse14 c_~q1~0.offset)) (.cse1 (not (<= 0 c_~q1_back~0))) (.cse2 (not (< c_~q2_back~0 c_~n2~0))) (.cse3 (not (< c_~q1_back~0 c_~n1~0))) (.cse9 (not (<= 0 c_~q2_back~0)))) (and (< .cse0 c_~N~0) (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (or .cse1 .cse2 .cse3 (and .cse4 .cse5 (or .cse6 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse7) .cse8 .cse9) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) (<= c_~q2_front~0 0) (or (<= .cse10 0) (<= (+ c_~q1~0.offset .cse11) 4)) (<= 0 .cse0) (or (not (= .cse10 0)) (and (or (not (= .cse12 0)) (= c_~j~0 0)) (or (<= (+ .cse13 c_~q1~0.offset .cse11) (+ .cse14 4)) (<= .cse12 0)) (or (<= .cse14 .cse12) (< 0 (+ .cse13 c_~q1~0.offset 1))))) (<= 1 c_~N~0) (<= c_~j~0 c_~i~0) (<= c_~n1~0 1) (< c_~i~0 (+ c_~j~0 1)) (<= 0 c_~q2_front~0) (or .cse1 (and (or (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) .cse6) .cse4 .cse5 .cse7) .cse3 (< 0 c_~q2_back~0) .cse8 .cse9) (= .cse0 0) (<= c_~j~0 0) (= c_~q1_back~0 c_~q1_front~0) (or (and (forall ((~q1~0.base Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse17 (select .cse15 ~q1~0.base))) (or (< (select (select .cse15 c_~q2~0.base) .cse16) c_~i~0) (< (select .cse17 .cse12) .cse18) (not (= c_~j~0 (select .cse17 .cse10))))))) (forall ((~q1~0.base Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse19 (select .cse20 ~q1~0.base))) (or (< (select .cse19 .cse12) c_~i~0) (< (select (select .cse20 c_~q2~0.base) .cse16) .cse18) (not (= c_~j~0 (select .cse19 .cse10)))))))) .cse1 .cse2 .cse3 .cse9 (not (= c_~i~0 (select .cse21 (+ .cse22 c_~q2~0.offset))))) (or (<= 0 c_~q1~0.offset) (not (<= (+ .cse14 c_~q1~0.offset 1) 0))))))) is different from false [2022-11-03 02:13:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:03,637 INFO L93 Difference]: Finished difference Result 211 states and 430 transitions. [2022-11-03 02:13:03,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-03 02:13:03,639 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:13:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:03,644 INFO L225 Difference]: With dead ends: 211 [2022-11-03 02:13:03,644 INFO L226 Difference]: Without dead ends: 202 [2022-11-03 02:13:03,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=497, Invalid=3532, Unknown=23, NotChecked=640, Total=4692 [2022-11-03 02:13:03,647 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 577 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:03,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 913 Invalid, 0 Unknown, 577 Unchecked, 0.9s Time] [2022-11-03 02:13:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-03 02:13:03,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 112. [2022-11-03 02:13:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.099099099099099) internal successors, (233), 111 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 233 transitions. [2022-11-03 02:13:03,656 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 233 transitions. Word has length 19 [2022-11-03 02:13:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:03,656 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 233 transitions. [2022-11-03 02:13:03,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 233 transitions. [2022-11-03 02:13:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:13:03,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:03,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:03,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:03,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:13:03,871 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:13:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1418415994, now seen corresponding path program 5 times [2022-11-03 02:13:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:03,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471224892] [2022-11-03 02:13:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:05,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:05,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471224892] [2022-11-03 02:13:05,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471224892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:05,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121278339] [2022-11-03 02:13:05,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:13:05,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:05,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:05,542 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:05,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:13:05,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:13:05,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:05,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:13:05,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:05,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 02:13:05,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 02:13:06,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:06,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-11-03 02:13:06,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:06,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:06,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 28 [2022-11-03 02:13:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:06,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:07,038 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_327 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (or (forall ((~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (< (select .cse0 .cse2) c_~N~0)))) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0)))) (forall ((v_ArrVal_327 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (or (forall ((~q1~0.base Int)) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (not (= c_~j~0 (select .cse5 .cse1))) (< (+ (select .cse5 .cse2) 1) c_~N~0)))) (< (select (select .cse6 c_~q2~0.base) .cse4) c_~N~0)))))) (not (< c_~q1_back~0 c_~n1~0))) is different from false [2022-11-03 02:13:07,320 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (let ((.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ c_~i~0 1)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_326))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((v_ArrVal_327 (Array Int Int)) (~q1~0.base Int)) (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (let ((.cse2 (select .cse4 ~q1~0.base))) (or (not (= (select .cse2 .cse3) c_~j~0)) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) c_~i~0) (< (select .cse2 .cse6) .cse7)))))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_326))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((v_ArrVal_327 (Array Int Int)) (~q1~0.base Int)) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (let ((.cse10 (select .cse9 ~q1~0.base))) (or (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) .cse7) (< (select .cse10 .cse6) c_~i~0) (not (= (select .cse10 .cse3) c_~j~0))))))))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-03 02:13:07,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:07,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 82 [2022-11-03 02:13:07,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:07,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 407 treesize of output 459 [2022-11-03 02:13:07,472 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:07,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 328 treesize of output 380 [2022-11-03 02:13:07,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:07,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 305 treesize of output 289 [2022-11-03 02:13:24,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:24,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 82 [2022-11-03 02:13:24,080 INFO L356 Elim1Store]: treesize reduction 50, result has 50.5 percent of original size [2022-11-03 02:13:24,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 325 treesize of output 335 [2022-11-03 02:13:24,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:24,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 261 treesize of output 257 [2022-11-03 02:13:24,183 INFO L356 Elim1Store]: treesize reduction 40, result has 55.1 percent of original size [2022-11-03 02:13:24,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 184 [2022-11-03 02:13:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:13:27,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121278339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:13:27,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [804498831] [2022-11-03 02:13:27,484 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:13:27,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:13:27,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-11-03 02:13:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479905396] [2022-11-03 02:13:27,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:13:27,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:13:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:27,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:13:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1063, Unknown=2, NotChecked=134, Total=1332 [2022-11-03 02:13:27,488 INFO L87 Difference]: Start difference. First operand 112 states and 233 transitions. Second operand has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:28,899 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~i~0 1))) (and (or (not (<= 0 c_~q1_back~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (let ((.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_326))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((v_ArrVal_327 (Array Int Int)) (~q1~0.base Int)) (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (let ((.cse2 (select .cse4 ~q1~0.base))) (or (not (= (select .cse2 .cse3) c_~j~0)) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) c_~i~0) (< (select .cse2 .cse6) .cse7)))))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_326))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((v_ArrVal_327 (Array Int Int)) (~q1~0.base Int)) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (let ((.cse10 (select .cse9 ~q1~0.base))) (or (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) .cse7) (< (select .cse10 .cse6) c_~i~0) (not (= (select .cse10 .cse3) c_~j~0))))))))))) (not (<= 0 c_~q2_back~0))) (<= c_~i~0 c_~j~0) (< c_~j~0 .cse7))) is different from false [2022-11-03 02:13:28,914 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (+ c_~i~0 1))) (let ((.cse8 (< c_~j~0 .cse14)) (.cse4 (* c_~q2_front~0 4)) (.cse7 (* c_~q1_front~0 4)) (.cse6 (* c_~q1_back~0 4)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q2_back~0 c_~n2~0))) (.cse2 (not (< c_~q1_back~0 c_~n1~0))) (.cse9 (not (<= 0 c_~q2_back~0))) (.cse3 (* c_~q2_back~0 4))) (and (<= c_~i~0 c_~j~0) (or .cse0 .cse1 .cse2 (let ((.cse5 (< c_~j~0 c_~i~0))) (and (or (= .cse3 .cse4) .cse5) (= .cse6 .cse7) (or .cse5 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse8)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9) .cse8 (or (let ((.cse11 (+ .cse6 c_~q1~0.offset)) (.cse15 (+ .cse7 c_~q1~0.offset)) (.cse13 (+ c_~q2~0.offset .cse4))) (and (forall ((v_ArrVal_327 (Array Int Int)) (~q1~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (let ((.cse10 (select .cse12 ~q1~0.base))) (or (not (= c_~j~0 (select .cse10 .cse11))) (< (select (select .cse12 c_~q2~0.base) .cse13) .cse14) (< (select .cse10 .cse15) c_~i~0))))) (forall ((v_ArrVal_327 (Array Int Int)) (~q1~0.base Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (let ((.cse16 (select .cse17 ~q1~0.base))) (or (not (= c_~j~0 (select .cse16 .cse11))) (< (select .cse16 .cse15) .cse14) (< (select (select .cse17 c_~q2~0.base) .cse13) c_~i~0))))))) .cse0 .cse1 .cse2 .cse9 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ .cse3 c_~q2~0.offset)))))))) is different from false [2022-11-03 02:13:31,551 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_~q2_front~0 4))) (let ((.cse1 (not (<= 0 c_~q1_back~0))) (.cse10 (* c_~q1_back~0 4)) (.cse9 (* c_~q1_front~0 4)) (.cse11 (not (< c_~q1_back~0 c_~n1~0))) (.cse0 (< c_~j~0 (+ c_~i~0 1))) (.cse14 (<= c_~i~0 c_~j~0)) (.cse6 (+ c_~q2~0.offset .cse13))) (and (or (<= c_~j~0 c_~N~0) .cse0) (or .cse1 (let ((.cse3 (+ .cse10 c_~q1~0.offset)) (.cse4 (+ .cse9 c_~q1~0.offset))) (and (forall ((v_ArrVal_327 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (or (forall ((~q1~0.base Int)) (let ((.cse2 (select .cse5 ~q1~0.base))) (or (not (= c_~j~0 (select .cse2 .cse3))) (< (select .cse2 .cse4) c_~N~0)))) (< (+ (select (select .cse5 c_~q2~0.base) .cse6) 1) c_~N~0)))) (forall ((v_ArrVal_327 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327))) (or (forall ((~q1~0.base Int)) (let ((.cse7 (select .cse8 ~q1~0.base))) (or (not (= c_~j~0 (select .cse7 .cse3))) (< (+ (select .cse7 .cse4) 1) c_~N~0)))) (< (select (select .cse8 c_~q2~0.base) .cse6) c_~N~0)))))) .cse11) (or .cse1 (let ((.cse12 (< c_~j~0 c_~i~0))) (and (or (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) .cse12) (or (= (* c_~q2_back~0 4) .cse13) .cse12) (= .cse10 .cse9) .cse0)) .cse11 (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 c_~q2_back~0))) (or (< c_~j~0 c_~N~0) (and .cse14 .cse0)) (or .cse14 (<= c_~i~0 c_~N~0)) (or (let ((.cse15 (select (select |c_#memory_int| c_~q2~0.base) .cse6))) (and (< .cse15 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse15 1) c_~N~0)))) (< c_~i~0 c_~N~0))))) is different from false [2022-11-03 02:13:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:32,376 INFO L93 Difference]: Finished difference Result 238 states and 496 transitions. [2022-11-03 02:13:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-03 02:13:32,376 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:13:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:32,378 INFO L225 Difference]: With dead ends: 238 [2022-11-03 02:13:32,378 INFO L226 Difference]: Without dead ends: 228 [2022-11-03 02:13:32,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=595, Invalid=3578, Unknown=7, NotChecked=650, Total=4830 [2022-11-03 02:13:32,379 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 524 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:32,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 894 Invalid, 0 Unknown, 524 Unchecked, 1.0s Time] [2022-11-03 02:13:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-03 02:13:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 114. [2022-11-03 02:13:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.1238938053097347) internal successors, (240), 113 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 240 transitions. [2022-11-03 02:13:32,386 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 240 transitions. Word has length 19 [2022-11-03 02:13:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:32,387 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 240 transitions. [2022-11-03 02:13:32,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 240 transitions. [2022-11-03 02:13:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:13:32,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:32,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:32,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:32,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:32,599 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-03 02:13:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash -559541464, now seen corresponding path program 6 times [2022-11-03 02:13:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:32,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863311734] [2022-11-03 02:13:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:34,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:34,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863311734] [2022-11-03 02:13:34,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863311734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:34,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554808349] [2022-11-03 02:13:34,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:13:34,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:34,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:34,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:34,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e6fe664-ba9e-44fa-92bd-662d8b9d1dcd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:13:34,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:13:34,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:34,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 02:13:34,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:34,808 INFO L356 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-11-03 02:13:34,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 23 [2022-11-03 02:13:34,893 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 02:13:34,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 02:13:34,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:13:35,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-03 02:13:35,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:13:35,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-11-03 02:13:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:13:35,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:35,914 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q1_back~0 4)) (.cse3 (* c_~q1_front~0 4)) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_372 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_372))) (or (< (select (select .cse0 c_~q2~0.base) .cse1) c_~j~0) (forall ((~q1~0.offset Int)) (let ((.cse2 (select .cse0 c_~q1~0.base))) (or (< (select .cse2 (+ .cse3 ~q1~0.offset)) (+ c_~j~0 1)) (not (= (select .cse2 (+ .cse4 ~q1~0.offset)) c_~j~0)))))))) (forall ((v_ArrVal_372 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_372))) (let ((.cse5 (select (select .cse7 c_~q2~0.base) .cse1))) (or (< .cse5 c_~j~0) (forall ((~q1~0.offset Int)) (let ((.cse6 (select .cse7 c_~q1~0.base))) (or (not (= (select .cse6 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< .cse5 (+ (select .cse6 (+ .cse3 ~q1~0.offset)) 1))))))))))) is different from false [2022-11-03 02:13:36,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:36,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 82 [2022-11-03 02:13:36,445 INFO L356 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2022-11-03 02:13:36,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 462 [2022-11-03 02:13:36,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:36,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:36,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 268 treesize of output 308 [2022-11-03 02:13:36,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:36,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:36,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 313 treesize of output 285 [2022-11-03 02:13:44,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:13:44,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 144 treesize of output 96 [2022-11-03 02:13:44,285 INFO L356 Elim1Store]: treesize reduction 50, result has 50.5 percent of original size [2022-11-03 02:13:44,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2113 treesize of output 1867 [2022-11-03 02:13:44,380 INFO L356 Elim1Store]: treesize reduction 40, result has 55.1 percent of original size [2022-11-03 02:13:44,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1817 treesize of output 1643 [2022-11-03 02:13:44,439 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-03 02:13:44,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1577 treesize of output 1165