./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9 --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 c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --- 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-6b4ec56 [2022-11-20 21:04:26,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 21:04:26,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 21:04:26,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 21:04:26,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 21:04:26,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 21:04:26,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 21:04:26,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 21:04:26,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 21:04:26,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 21:04:26,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 21:04:26,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 21:04:26,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 21:04:26,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 21:04:26,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 21:04:26,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 21:04:26,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 21:04:26,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 21:04:26,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 21:04:26,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 21:04:26,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 21:04:26,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 21:04:26,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 21:04:26,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 21:04:26,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 21:04:26,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 21:04:26,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 21:04:26,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 21:04:26,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 21:04:26,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 21:04:26,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 21:04:26,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 21:04:26,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 21:04:26,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 21:04:26,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 21:04:26,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 21:04:26,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 21:04:26,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 21:04:26,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 21:04:26,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 21:04:26,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 21:04:26,894 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 21:04:26,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 21:04:26,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 21:04:26,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 21:04:26,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 21:04:26,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 21:04:26,942 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 21:04:26,942 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 21:04:26,942 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 21:04:26,943 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 21:04:26,943 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 21:04:26,944 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 21:04:26,945 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 21:04:26,945 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 21:04:26,945 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 21:04:26,945 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 21:04:26,946 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 21:04:26,946 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 21:04:26,946 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 21:04:26,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 21:04:26,948 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 21:04:26,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 21:04:26,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 21:04:26,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 21:04:26,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 21:04:26,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 21:04:26,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 21:04:26,950 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 21:04:26,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 21:04:26,950 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 21:04:26,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 21:04:26,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 21:04:26,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 21:04:26,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:04:26,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 21:04:26,952 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 21:04:26,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 21:04:26,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 21:04:26,953 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 21:04:26,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 21:04:26,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 21:04:26,954 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 21:04:26,954 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_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/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_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9 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 -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-11-20 21:04:27,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 21:04:27,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 21:04:27,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 21:04:27,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 21:04:27,367 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 21:04:27,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-20 21:04:30,791 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 21:04:31,085 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 21:04:31,086 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-20 21:04:31,095 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/data/28c23d4ee/f0d186b1b45b41e1a003cd0999432844/FLAG63b52851b [2022-11-20 21:04:31,111 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/data/28c23d4ee/f0d186b1b45b41e1a003cd0999432844 [2022-11-20 21:04:31,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 21:04:31,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 21:04:31,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 21:04:31,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 21:04:31,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 21:04:31,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64499c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31, skipping insertion in model container [2022-11-20 21:04:31,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 21:04:31,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 21:04:31,419 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-20 21:04:31,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:04:31,455 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 21:04:31,477 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-20 21:04:31,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:04:31,495 INFO L208 MainTranslator]: Completed translation [2022-11-20 21:04:31,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31 WrapperNode [2022-11-20 21:04:31,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 21:04:31,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 21:04:31,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 21:04:31,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 21:04:31,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,541 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-11-20 21:04:31,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 21:04:31,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 21:04:31,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 21:04:31,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 21:04:31,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,578 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 21:04:31,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 21:04:31,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 21:04:31,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 21:04:31,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (1/1) ... [2022-11-20 21:04:31,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:04:31,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:04:31,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 21:04:31,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 21:04:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 21:04:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 21:04:31,692 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 21:04:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 21:04:31,692 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 21:04:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 21:04:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 21:04:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 21:04:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 21:04:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 21:04:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 21:04:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 21:04:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 21:04:31,695 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 21:04:31,843 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 21:04:31,845 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 21:04:32,537 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 21:04:32,549 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 21:04:32,550 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 21:04:32,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:04:32 BoogieIcfgContainer [2022-11-20 21:04:32,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 21:04:32,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 21:04:32,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 21:04:32,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 21:04:32,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:04:31" (1/3) ... [2022-11-20 21:04:32,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b95ca35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:04:32, skipping insertion in model container [2022-11-20 21:04:32,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:31" (2/3) ... [2022-11-20 21:04:32,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b95ca35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:04:32, skipping insertion in model container [2022-11-20 21:04:32,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:04:32" (3/3) ... [2022-11-20 21:04:32,563 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-11-20 21:04:32,573 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 21:04:32,585 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 21:04:32,585 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 21:04:32,585 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 21:04:32,744 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 21:04:32,808 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 21:04:32,831 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 396 transitions, 808 flow [2022-11-20 21:04:32,839 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 396 transitions, 808 flow [2022-11-20 21:04:32,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 396 transitions, 808 flow [2022-11-20 21:04:33,077 INFO L130 PetriNetUnfolder]: 28/394 cut-off events. [2022-11-20 21:04:33,077 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 21:04:33,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 394 events. 28/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 923 event pairs, 0 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 271. Up to 2 conditions per place. [2022-11-20 21:04:33,116 INFO L119 LiptonReduction]: Number of co-enabled transitions 37700 [2022-11-20 21:04:48,583 INFO L134 LiptonReduction]: Checked pairs total: 31579 [2022-11-20 21:04:48,584 INFO L136 LiptonReduction]: Total number of compositions: 485 [2022-11-20 21:04:48,593 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 58 flow [2022-11-20 21:04:48,610 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 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-20 21:04:48,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 21:04:48,636 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;@31b7a636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 21:04:48,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-20 21:04:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 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-20 21:04:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 21:04:48,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:04:48,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:04:48,647 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-20 21:04:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:04:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1578748008, now seen corresponding path program 1 times [2022-11-20 21:04:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:04:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075265569] [2022-11-20 21:04:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:04:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:49,555 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-20 21:04:49,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:04:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075265569] [2022-11-20 21:04:49,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075265569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:04:49,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:04:49,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 21:04:49,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988358378] [2022-11-20 21:04:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:04:49,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 21:04:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:04:49,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 21:04:49,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 21:04:49,593 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 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 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 21:04:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:04:49,806 INFO L93 Difference]: Finished difference Result 90 states and 237 transitions. [2022-11-20 21:04:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:04:49,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-20 21:04:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:04:49,822 INFO L225 Difference]: With dead ends: 90 [2022-11-20 21:04:49,823 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 21:04:49,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:04:49,829 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:04:49,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:04:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 21:04:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-11-20 21:04:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.477272727272727) internal successors, (109), 44 states have internal predecessors, (109), 0 states have call successors, (0), 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-20 21:04:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-11-20 21:04:49,879 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 109 transitions. Word has length 12 [2022-11-20 21:04:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:04:49,881 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 109 transitions. [2022-11-20 21:04:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 21:04:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 109 transitions. [2022-11-20 21:04:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 21:04:49,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:04:49,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:04:49,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 21:04:49,883 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-20 21:04:49,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:04:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash -588606708, now seen corresponding path program 1 times [2022-11-20 21:04:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:04:49,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856811994] [2022-11-20 21:04:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:04:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:50,119 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-20 21:04:50,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:04:50,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856811994] [2022-11-20 21:04:50,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856811994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:04:50,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:04:50,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:04:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950758312] [2022-11-20 21:04:50,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:04:50,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:04:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:04:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:04:50,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:04:50,123 INFO L87 Difference]: Start difference. First operand 45 states and 109 transitions. Second operand has 4 states, 4 states have (on average 3.25) 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-20 21:04:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:04:50,259 INFO L93 Difference]: Finished difference Result 89 states and 201 transitions. [2022-11-20 21:04:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:04:50,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) 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-20 21:04:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:04:50,266 INFO L225 Difference]: With dead ends: 89 [2022-11-20 21:04:50,266 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 21:04:50,268 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-20 21:04:50,270 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:04:50,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:04:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 21:04:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2022-11-20 21:04:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.485294117647059) internal successors, (169), 68 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:04:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 169 transitions. [2022-11-20 21:04:50,292 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 169 transitions. Word has length 13 [2022-11-20 21:04:50,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:04:50,293 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-11-20 21:04:50,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) 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-20 21:04:50,293 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 169 transitions. [2022-11-20 21:04:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 21:04:50,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:04:50,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:04:50,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 21:04:50,295 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-20 21:04:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:04:50,296 INFO L85 PathProgramCache]: Analyzing trace with hash -85527686, now seen corresponding path program 1 times [2022-11-20 21:04:50,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:04:50,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867334416] [2022-11-20 21:04:50,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:04:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:50,552 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-20 21:04:50,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:04:50,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867334416] [2022-11-20 21:04:50,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867334416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:04:50,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:04:50,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:04:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784935529] [2022-11-20 21:04:50,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:04:50,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:04:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:04:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:04:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:04:50,556 INFO L87 Difference]: Start difference. First operand 69 states and 169 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 21:04:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:04:50,640 INFO L93 Difference]: Finished difference Result 53 states and 118 transitions. [2022-11-20 21:04:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:04:50,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 21:04:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:04:50,642 INFO L225 Difference]: With dead ends: 53 [2022-11-20 21:04:50,642 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 21:04:50,642 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-20 21:04:50,644 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:04:50,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:04:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 21:04:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-20 21:04:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 45 states have internal predecessors, (110), 0 states have call successors, (0), 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-20 21:04:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 110 transitions. [2022-11-20 21:04:50,650 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 110 transitions. Word has length 14 [2022-11-20 21:04:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:04:50,651 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 110 transitions. [2022-11-20 21:04:50,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 21:04:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 110 transitions. [2022-11-20 21:04:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 21:04:50,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:04:50,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:04:50,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 21:04:50,653 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-20 21:04:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:04:50,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1631965637, now seen corresponding path program 1 times [2022-11-20 21:04:50,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:04:50,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280094768] [2022-11-20 21:04:50,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:50,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:04:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:50,892 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-20 21:04:50,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:04:50,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280094768] [2022-11-20 21:04:50,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280094768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:04:50,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863740990] [2022-11-20 21:04:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:50,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:04:50,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:04:50,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:04:50,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 21:04:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:51,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 21:04:51,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:04:51,137 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-20 21:04:51,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:04:51,193 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-20 21:04:51,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863740990] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 21:04:51,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:04:51,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-11-20 21:04:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332111791] [2022-11-20 21:04:51,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:04:51,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 21:04:51,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:04:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 21:04:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-20 21:04:51,196 INFO L87 Difference]: Start difference. First operand 46 states and 110 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 21:04:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:04:51,271 INFO L93 Difference]: Finished difference Result 44 states and 111 transitions. [2022-11-20 21:04:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:04:51,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 21:04:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:04:51,273 INFO L225 Difference]: With dead ends: 44 [2022-11-20 21:04:51,273 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 21:04:51,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 21:04:51,275 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:04:51,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:04:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 21:04:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-11-20 21:04:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:04:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-11-20 21:04:51,285 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 14 [2022-11-20 21:04:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:04:51,285 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2022-11-20 21:04:51,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 21:04:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2022-11-20 21:04:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 21:04:51,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:04:51,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:04:51,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 21:04:51,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:04:51,493 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-20 21:04:51,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:04:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash 32738273, now seen corresponding path program 1 times [2022-11-20 21:04:51,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:04:51,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997308159] [2022-11-20 21:04:51,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:51,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:04:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:04:51,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:04:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997308159] [2022-11-20 21:04:51,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997308159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:04:51,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935640379] [2022-11-20 21:04:51,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:51,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:04:51,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:04:51,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:04:51,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 21:04:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:51,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 21:04:51,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:04:52,071 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-20 21:04:52,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:04:52,142 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-20 21:04:52,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935640379] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 21:04:52,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:04:52,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2022-11-20 21:04:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873953742] [2022-11-20 21:04:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:04:52,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 21:04:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:04:52,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 21:04:52,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 21:04:52,146 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.0) 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-20 21:04:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:04:52,244 INFO L93 Difference]: Finished difference Result 52 states and 130 transitions. [2022-11-20 21:04:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:04:52,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) 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-20 21:04:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:04:52,247 INFO L225 Difference]: With dead ends: 52 [2022-11-20 21:04:52,247 INFO L226 Difference]: Without dead ends: 52 [2022-11-20 21:04:52,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-20 21:04:52,250 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:04:52,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:04:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-20 21:04:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-20 21:04:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 51 states have internal predecessors, (130), 0 states have call successors, (0), 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-20 21:04:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 130 transitions. [2022-11-20 21:04:52,265 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 130 transitions. Word has length 15 [2022-11-20 21:04:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:04:52,265 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 130 transitions. [2022-11-20 21:04:52,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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-20 21:04:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 130 transitions. [2022-11-20 21:04:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:04:52,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:04:52,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:04:52,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 21:04:52,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:04:52,467 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-20 21:04:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:04:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1270268237, now seen corresponding path program 1 times [2022-11-20 21:04:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:04:52,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100242153] [2022-11-20 21:04:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:04:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:04:54,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:04:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100242153] [2022-11-20 21:04:54,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100242153] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:04:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051756377] [2022-11-20 21:04:54,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:54,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:04:54,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:04:54,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:04:54,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 21:04:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:54,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 21:04:54,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:04:54,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:04:54,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:04:55,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:04:55,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 21:04:55,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 157 [2022-11-20 21:04:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:04:55,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:04:56,022 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse1))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= c_~sum1~0 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse1))) (or (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (<= (+ c_~bag2~0 .cse2 c_~sum2~0) c_~sum1~0)))))) is different from false [2022-11-20 21:04:56,057 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0))))))) is different from false [2022-11-20 21:04:56,092 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1)))))) is different from false [2022-11-20 21:04:56,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-20 21:04:56,208 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 2147483648))) (not (<= .cse0 2147483647)) (<= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse2 2147483648))) (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse2) (not (<= .cse2 2147483647))))))) is different from false [2022-11-20 21:04:56,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:04:56,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 63 [2022-11-20 21:04:56,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 506 treesize of output 458 [2022-11-20 21:04:56,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 291 [2022-11-20 21:04:56,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 267 [2022-11-20 21:04:56,438 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:04:56,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-11-20 21:04:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:04:56,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051756377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:04:56,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1552675616] [2022-11-20 21:04:56,476 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-20 21:04:56,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:04:56,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-11-20 21:04:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125468821] [2022-11-20 21:04:56,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:04:56,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 21:04:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:04:56,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 21:04:56,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=365, Unknown=5, NotChecked=210, Total=650 [2022-11-20 21:04:56,487 INFO L87 Difference]: Start difference. First operand 52 states and 130 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 21:04:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:04:57,824 INFO L93 Difference]: Finished difference Result 107 states and 276 transitions. [2022-11-20 21:04:57,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 21:04:57,824 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 21:04:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:04:57,826 INFO L225 Difference]: With dead ends: 107 [2022-11-20 21:04:57,826 INFO L226 Difference]: Without dead ends: 102 [2022-11-20 21:04:57,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=169, Invalid=716, Unknown=5, NotChecked=300, Total=1190 [2022-11-20 21:04:57,828 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 192 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:04:57,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 0 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 345 Invalid, 0 Unknown, 171 Unchecked, 0.4s Time] [2022-11-20 21:04:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-20 21:04:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2022-11-20 21:04:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.5217391304347827) internal successors, (174), 69 states have internal predecessors, (174), 0 states have call successors, (0), 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-20 21:04:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 174 transitions. [2022-11-20 21:04:57,835 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 174 transitions. Word has length 16 [2022-11-20 21:04:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:04:57,836 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 174 transitions. [2022-11-20 21:04:57,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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-20 21:04:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 174 transitions. [2022-11-20 21:04:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:04:57,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:04:57,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:04:57,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 21:04:58,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:04:58,044 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-20 21:04:58,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:04:58,045 INFO L85 PathProgramCache]: Analyzing trace with hash 696942173, now seen corresponding path program 2 times [2022-11-20 21:04:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:04:58,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729525174] [2022-11-20 21:04:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:58,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:04:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:04:59,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:04:59,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729525174] [2022-11-20 21:04:59,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729525174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:04:59,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977062067] [2022-11-20 21:04:59,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:04:59,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:04:59,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:04:59,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:04:59,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 21:05:00,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 21:05:00,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:00,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 21:05:00,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:00,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:00,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:00,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:00,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 21:05:00,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 157 [2022-11-20 21:05:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:00,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:01,196 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-20 21:05:01,229 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-20 21:05:01,265 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-20 21:05:01,337 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_166 (Array Int Int)) (v_ArrVal_167 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_166))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 2147483648))) (<= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (<= .cse0 2147483647)))))) (forall ((v_ArrVal_166 (Array Int Int)) (v_ArrVal_167 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_166))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse2 2147483648))) (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse2) (not (<= .cse2 2147483647))))))) is different from false [2022-11-20 21:05:01,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:05:01,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 63 [2022-11-20 21:05:01,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 506 treesize of output 458 [2022-11-20 21:05:01,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 306 [2022-11-20 21:05:01,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 280 [2022-11-20 21:05:01,544 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:05:01,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-11-20 21:05:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:05:01,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977062067] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:01,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1839843589] [2022-11-20 21:05:01,568 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-20 21:05:01,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:01,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-20 21:05:01,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729361379] [2022-11-20 21:05:01,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:01,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 21:05:01,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:01,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 21:05:01,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=393, Unknown=4, NotChecked=172, Total=650 [2022-11-20 21:05:01,573 INFO L87 Difference]: Start difference. First operand 70 states and 174 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:03,610 INFO L93 Difference]: Finished difference Result 236 states and 632 transitions. [2022-11-20 21:05:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 21:05:03,611 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:05:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:03,613 INFO L225 Difference]: With dead ends: 236 [2022-11-20 21:05:03,613 INFO L226 Difference]: Without dead ends: 226 [2022-11-20 21:05:03,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=284, Invalid=1134, Unknown=4, NotChecked=300, Total=1722 [2022-11-20 21:05:03,615 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:03,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 342 Invalid, 0 Unknown, 312 Unchecked, 0.6s Time] [2022-11-20 21:05:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-20 21:05:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 72. [2022-11-20 21:05:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.6056338028169015) internal successors, (185), 71 states have internal predecessors, (185), 0 states have call successors, (0), 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-20 21:05:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 185 transitions. [2022-11-20 21:05:03,625 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 185 transitions. Word has length 16 [2022-11-20 21:05:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:03,625 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 185 transitions. [2022-11-20 21:05:03,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 185 transitions. [2022-11-20 21:05:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:03,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:03,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:03,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:03,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 21:05:03,834 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-20 21:05:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash 724647803, now seen corresponding path program 3 times [2022-11-20 21:05:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:03,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995899990] [2022-11-20 21:05:03,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:05,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:05,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995899990] [2022-11-20 21:05:05,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995899990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:05,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419086327] [2022-11-20 21:05:05,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:05:05,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:05,515 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:05,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 21:05:05,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:05:05,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:05,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 21:05:05,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:05,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 21:05:05,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:06,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:06,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 21:05:06,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 151 [2022-11-20 21:05:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:06,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:07,017 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~j~0 c_~N~0)) (<= (+ c_~i~0 1) c_~N~0) (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))))))))) is different from false [2022-11-20 21:05:07,244 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~i~0 c_~N~0)) (not (< c_~j~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0) (let ((.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))))))))) is different from false [2022-11-20 21:05:07,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:05:07,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 63 [2022-11-20 21:05:07,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 214 [2022-11-20 21:05:07,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 190 [2022-11-20 21:05:07,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 178 [2022-11-20 21:05:07,704 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:05:07,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-11-20 21:05:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 21:05:07,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419086327] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:07,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131623808] [2022-11-20 21:05:07,786 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:05:07,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:07,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-20 21:05:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91534192] [2022-11-20 21:05:07,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:07,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 21:05:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 21:05:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=460, Unknown=11, NotChecked=90, Total=650 [2022-11-20 21:05:07,792 INFO L87 Difference]: Start difference. First operand 72 states and 185 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:12,821 INFO L93 Difference]: Finished difference Result 445 states and 1212 transitions. [2022-11-20 21:05:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-20 21:05:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:05:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:12,832 INFO L225 Difference]: With dead ends: 445 [2022-11-20 21:05:12,832 INFO L226 Difference]: Without dead ends: 430 [2022-11-20 21:05:12,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=926, Invalid=3762, Unknown=12, NotChecked=270, Total=4970 [2022-11-20 21:05:12,835 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 473 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:12,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 0 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 619 Invalid, 0 Unknown, 502 Unchecked, 1.0s Time] [2022-11-20 21:05:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-20 21:05:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 102. [2022-11-20 21:05:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.8613861386138613) internal successors, (289), 101 states have internal predecessors, (289), 0 states have call successors, (0), 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-20 21:05:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 289 transitions. [2022-11-20 21:05:12,846 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 289 transitions. Word has length 16 [2022-11-20 21:05:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:12,847 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 289 transitions. [2022-11-20 21:05:12,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 289 transitions. [2022-11-20 21:05:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:12,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:12,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:12,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:13,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:13,061 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-20 21:05:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2096775891, now seen corresponding path program 4 times [2022-11-20 21:05:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:13,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051760606] [2022-11-20 21:05:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:14,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:14,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051760606] [2022-11-20 21:05:14,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051760606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:14,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542821651] [2022-11-20 21:05:14,425 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:05:14,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:14,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:14,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:14,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 21:05:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:14,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 21:05:14,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:14,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:14,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:14,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:15,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 157 [2022-11-20 21:05:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:15,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:15,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542821651] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:15,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1529514930] [2022-11-20 21:05:15,909 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-20 21:05:15,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:15,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-11-20 21:05:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853971778] [2022-11-20 21:05:15,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:15,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 21:05:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:15,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 21:05:15,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=463, Unknown=12, NotChecked=0, Total=552 [2022-11-20 21:05:15,913 INFO L87 Difference]: Start difference. First operand 102 states and 289 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:17,276 INFO L93 Difference]: Finished difference Result 169 states and 494 transitions. [2022-11-20 21:05:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 21:05:17,277 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:05:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:17,278 INFO L225 Difference]: With dead ends: 169 [2022-11-20 21:05:17,279 INFO L226 Difference]: Without dead ends: 164 [2022-11-20 21:05:17,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=242, Invalid=1078, Unknown=12, NotChecked=0, Total=1332 [2022-11-20 21:05:17,280 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:17,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 0 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 542 Invalid, 0 Unknown, 114 Unchecked, 0.5s Time] [2022-11-20 21:05:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-20 21:05:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 94. [2022-11-20 21:05:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.774193548387097) internal successors, (258), 93 states have internal predecessors, (258), 0 states have call successors, (0), 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-20 21:05:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 258 transitions. [2022-11-20 21:05:17,286 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 258 transitions. Word has length 16 [2022-11-20 21:05:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:17,286 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 258 transitions. [2022-11-20 21:05:17,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 258 transitions. [2022-11-20 21:05:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:17,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:17,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:17,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:17,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:17,494 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-20 21:05:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash -169295787, now seen corresponding path program 5 times [2022-11-20 21:05:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:17,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755240253] [2022-11-20 21:05:17,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:18,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:18,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755240253] [2022-11-20 21:05:18,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755240253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:18,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947917796] [2022-11-20 21:05:18,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:05:18,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:18,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:18,704 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:18,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 21:05:18,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 21:05:18,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:18,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 21:05:18,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:18,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:18,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:19,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:19,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 21:05:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:19,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:19,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947917796] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:19,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [755833699] [2022-11-20 21:05:19,946 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-20 21:05:19,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:19,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 21 [2022-11-20 21:05:19,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037848318] [2022-11-20 21:05:19,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:19,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 21:05:19,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:19,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 21:05:19,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=382, Unknown=8, NotChecked=0, Total=462 [2022-11-20 21:05:19,950 INFO L87 Difference]: Start difference. First operand 94 states and 258 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:20,550 INFO L93 Difference]: Finished difference Result 137 states and 390 transitions. [2022-11-20 21:05:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 21:05:20,550 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:05:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:20,551 INFO L225 Difference]: With dead ends: 137 [2022-11-20 21:05:20,551 INFO L226 Difference]: Without dead ends: 132 [2022-11-20 21:05:20,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=647, Unknown=8, NotChecked=0, Total=812 [2022-11-20 21:05:20,552 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:20,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 318 Invalid, 0 Unknown, 77 Unchecked, 0.3s Time] [2022-11-20 21:05:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-20 21:05:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2022-11-20 21:05:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.845360824742268) internal successors, (276), 97 states have internal predecessors, (276), 0 states have call successors, (0), 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-20 21:05:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 276 transitions. [2022-11-20 21:05:20,558 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 276 transitions. Word has length 16 [2022-11-20 21:05:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:20,558 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 276 transitions. [2022-11-20 21:05:20,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 276 transitions. [2022-11-20 21:05:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:20,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:20,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:20,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:20,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 21:05:20,767 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-20 21:05:20,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash -141590157, now seen corresponding path program 6 times [2022-11-20 21:05:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:20,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075676118] [2022-11-20 21:05:20,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:22,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:22,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075676118] [2022-11-20 21:05:22,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075676118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:22,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325168816] [2022-11-20 21:05:22,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:05:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:22,091 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:22,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 21:05:22,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:05:22,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:22,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 21:05:22,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:22,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 21:05:22,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:22,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:22,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 20 [2022-11-20 21:05:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:22,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:23,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325168816] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:23,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [524152715] [2022-11-20 21:05:23,659 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-20 21:05:23,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:23,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 22 [2022-11-20 21:05:23,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251138092] [2022-11-20 21:05:23,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:23,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 21:05:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:23,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 21:05:23,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=430, Unknown=8, NotChecked=0, Total=506 [2022-11-20 21:05:23,663 INFO L87 Difference]: Start difference. First operand 98 states and 276 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:27,766 INFO L93 Difference]: Finished difference Result 354 states and 975 transitions. [2022-11-20 21:05:27,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-20 21:05:27,767 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:05:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:27,770 INFO L225 Difference]: With dead ends: 354 [2022-11-20 21:05:27,770 INFO L226 Difference]: Without dead ends: 339 [2022-11-20 21:05:27,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=502, Invalid=2782, Unknown=22, NotChecked=0, Total=3306 [2022-11-20 21:05:27,773 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:27,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 793 Invalid, 0 Unknown, 287 Unchecked, 1.0s Time] [2022-11-20 21:05:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-20 21:05:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 110. [2022-11-20 21:05:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.853211009174312) internal successors, (311), 109 states have internal predecessors, (311), 0 states have call successors, (0), 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-20 21:05:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 311 transitions. [2022-11-20 21:05:27,782 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 311 transitions. Word has length 16 [2022-11-20 21:05:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:27,782 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 311 transitions. [2022-11-20 21:05:27,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 311 transitions. [2022-11-20 21:05:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:27,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:27,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:27,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:27,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 21:05:27,992 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-20 21:05:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1548453273, now seen corresponding path program 7 times [2022-11-20 21:05:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:27,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091989452] [2022-11-20 21:05:27,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:27,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:29,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:29,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091989452] [2022-11-20 21:05:29,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091989452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:29,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892882594] [2022-11-20 21:05:29,944 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:05:29,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:29,945 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:29,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 21:05:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:30,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 21:05:30,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:30,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:30,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:30,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:30,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 21:05:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:30,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:31,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892882594] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:31,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [831530511] [2022-11-20 21:05:31,409 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:05:31,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:31,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-11-20 21:05:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727005552] [2022-11-20 21:05:31,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:31,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 21:05:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 21:05:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=523, Unknown=7, NotChecked=0, Total=600 [2022-11-20 21:05:31,412 INFO L87 Difference]: Start difference. First operand 110 states and 311 transitions. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:32,922 INFO L93 Difference]: Finished difference Result 243 states and 684 transitions. [2022-11-20 21:05:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 21:05:32,923 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:05:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:32,925 INFO L225 Difference]: With dead ends: 243 [2022-11-20 21:05:32,925 INFO L226 Difference]: Without dead ends: 233 [2022-11-20 21:05:32,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=250, Invalid=1383, Unknown=7, NotChecked=0, Total=1640 [2022-11-20 21:05:32,927 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:32,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 478 Invalid, 0 Unknown, 81 Unchecked, 0.5s Time] [2022-11-20 21:05:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-20 21:05:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 112. [2022-11-20 21:05:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.828828828828829) internal successors, (314), 111 states have internal predecessors, (314), 0 states have call successors, (0), 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-20 21:05:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 314 transitions. [2022-11-20 21:05:32,935 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 314 transitions. Word has length 16 [2022-11-20 21:05:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:32,935 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 314 transitions. [2022-11-20 21:05:32,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 314 transitions. [2022-11-20 21:05:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:32,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:32,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:32,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:33,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:33,144 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-20 21:05:33,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash -917332789, now seen corresponding path program 1 times [2022-11-20 21:05:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:33,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85028439] [2022-11-20 21:05:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:35,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:35,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85028439] [2022-11-20 21:05:35,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85028439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:35,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52899638] [2022-11-20 21:05:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:35,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:35,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:35,101 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:35,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 21:05:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:35,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-20 21:05:35,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:35,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:35,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:35,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:35,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 24 [2022-11-20 21:05:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:35,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:36,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52899638] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:36,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1479484784] [2022-11-20 21:05:36,503 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-20 21:05:36,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:36,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2022-11-20 21:05:36,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621859526] [2022-11-20 21:05:36,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:36,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 21:05:36,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 21:05:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=430, Unknown=3, NotChecked=0, Total=506 [2022-11-20 21:05:36,507 INFO L87 Difference]: Start difference. First operand 112 states and 314 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:05:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:38,209 INFO L93 Difference]: Finished difference Result 193 states and 549 transitions. [2022-11-20 21:05:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 21:05:38,209 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:05:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:38,211 INFO L225 Difference]: With dead ends: 193 [2022-11-20 21:05:38,211 INFO L226 Difference]: Without dead ends: 188 [2022-11-20 21:05:38,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=228, Invalid=1175, Unknown=3, NotChecked=0, Total=1406 [2022-11-20 21:05:38,213 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:38,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 665 Invalid, 0 Unknown, 61 Unchecked, 0.8s Time] [2022-11-20 21:05:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-20 21:05:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 120. [2022-11-20 21:05:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.8403361344537816) internal successors, (338), 119 states have internal predecessors, (338), 0 states have call successors, (0), 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-20 21:05:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 338 transitions. [2022-11-20 21:05:38,221 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 338 transitions. Word has length 16 [2022-11-20 21:05:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:38,222 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 338 transitions. [2022-11-20 21:05:38,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:05:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 338 transitions. [2022-11-20 21:05:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:38,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:38,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:38,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:38,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:38,431 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:05:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -59052905, now seen corresponding path program 2 times [2022-11-20 21:05:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:38,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956366866] [2022-11-20 21:05:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:40,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:40,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956366866] [2022-11-20 21:05:40,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956366866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:40,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435106111] [2022-11-20 21:05:40,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:05:40,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:40,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:40,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:40,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 21:05:40,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 21:05:40,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:40,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-20 21:05:40,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:40,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2022-11-20 21:05:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:40,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:41,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:05:41,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 246 [2022-11-20 21:05:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:41,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435106111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:41,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [398110832] [2022-11-20 21:05:41,253 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-20 21:05:41,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:41,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 20 [2022-11-20 21:05:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345402264] [2022-11-20 21:05:41,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:41,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 21:05:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 21:05:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-11-20 21:05:41,256 INFO L87 Difference]: Start difference. First operand 120 states and 338 transitions. Second operand has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:05:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:42,579 INFO L93 Difference]: Finished difference Result 183 states and 538 transitions. [2022-11-20 21:05:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 21:05:42,580 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:05:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:42,581 INFO L225 Difference]: With dead ends: 183 [2022-11-20 21:05:42,582 INFO L226 Difference]: Without dead ends: 178 [2022-11-20 21:05:42,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 21:05:42,583 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:42,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 21:05:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-20 21:05:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 120. [2022-11-20 21:05:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.8403361344537816) internal successors, (338), 119 states have internal predecessors, (338), 0 states have call successors, (0), 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-20 21:05:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 338 transitions. [2022-11-20 21:05:42,590 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 338 transitions. Word has length 16 [2022-11-20 21:05:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:42,590 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 338 transitions. [2022-11-20 21:05:42,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:05:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 338 transitions. [2022-11-20 21:05:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:42,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:42,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:42,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:42,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 21:05:42,792 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:05:42,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash -31347275, now seen corresponding path program 3 times [2022-11-20 21:05:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:42,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438347498] [2022-11-20 21:05:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:42,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:43,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:43,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438347498] [2022-11-20 21:05:43,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438347498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:43,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783298090] [2022-11-20 21:05:43,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:05:43,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:43,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:43,899 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:43,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 21:05:44,060 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:05:44,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:44,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 21:05:44,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:44,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 21:05:44,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:44,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:44,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2022-11-20 21:05:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:44,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:45,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783298090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:45,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1679998835] [2022-11-20 21:05:45,446 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-20 21:05:45,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:45,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 21 [2022-11-20 21:05:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400318131] [2022-11-20 21:05:45,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:45,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 21:05:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 21:05:45,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=373, Unknown=1, NotChecked=0, Total=462 [2022-11-20 21:05:45,450 INFO L87 Difference]: Start difference. First operand 120 states and 338 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:48,154 INFO L93 Difference]: Finished difference Result 380 states and 1068 transitions. [2022-11-20 21:05:48,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 21:05:48,155 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:05:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:48,157 INFO L225 Difference]: With dead ends: 380 [2022-11-20 21:05:48,157 INFO L226 Difference]: Without dead ends: 370 [2022-11-20 21:05:48,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=506, Invalid=2355, Unknown=1, NotChecked=0, Total=2862 [2022-11-20 21:05:48,159 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:48,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 574 Invalid, 0 Unknown, 118 Unchecked, 0.8s Time] [2022-11-20 21:05:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-20 21:05:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 137. [2022-11-20 21:05:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.963235294117647) internal successors, (403), 136 states have internal predecessors, (403), 0 states have call successors, (0), 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-20 21:05:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 403 transitions. [2022-11-20 21:05:48,170 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 403 transitions. Word has length 16 [2022-11-20 21:05:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:48,171 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 403 transitions. [2022-11-20 21:05:48,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 403 transitions. [2022-11-20 21:05:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:48,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:48,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:48,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:48,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 21:05:48,383 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:05:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:48,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1924748381, now seen corresponding path program 8 times [2022-11-20 21:05:48,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:48,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339251514] [2022-11-20 21:05:48,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:48,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:49,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:49,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339251514] [2022-11-20 21:05:49,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339251514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:49,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715794951] [2022-11-20 21:05:49,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:05:49,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:49,996 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:49,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 21:05:50,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:05:50,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:50,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 21:05:50,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:50,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:50,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:50,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:50,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 21:05:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:50,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:51,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715794951] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:51,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [964700660] [2022-11-20 21:05:51,491 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-20 21:05:51,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:51,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 25 [2022-11-20 21:05:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649202908] [2022-11-20 21:05:51,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:51,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 21:05:51,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:51,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 21:05:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=553, Unknown=5, NotChecked=0, Total=650 [2022-11-20 21:05:51,499 INFO L87 Difference]: Start difference. First operand 137 states and 403 transitions. Second operand has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:05:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:53,685 INFO L93 Difference]: Finished difference Result 242 states and 723 transitions. [2022-11-20 21:05:53,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 21:05:53,686 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:05:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:53,687 INFO L225 Difference]: With dead ends: 242 [2022-11-20 21:05:53,687 INFO L226 Difference]: Without dead ends: 237 [2022-11-20 21:05:53,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=264, Invalid=1291, Unknown=5, NotChecked=0, Total=1560 [2022-11-20 21:05:53,688 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:53,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 657 Invalid, 0 Unknown, 75 Unchecked, 0.8s Time] [2022-11-20 21:05:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-20 21:05:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 139. [2022-11-20 21:05:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.971014492753623) internal successors, (410), 138 states have internal predecessors, (410), 0 states have call successors, (0), 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-20 21:05:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 410 transitions. [2022-11-20 21:05:53,695 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 410 transitions. Word has length 16 [2022-11-20 21:05:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:53,696 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 410 transitions. [2022-11-20 21:05:53,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:05:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 410 transitions. [2022-11-20 21:05:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:05:53,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:53,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:53,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:53,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:53,907 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:05:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1952454011, now seen corresponding path program 9 times [2022-11-20 21:05:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:53,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312649866] [2022-11-20 21:05:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:53,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:55,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:55,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312649866] [2022-11-20 21:05:55,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312649866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:55,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642184402] [2022-11-20 21:05:55,181 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:05:55,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:55,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:55,182 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:55,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 21:05:55,328 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:05:55,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:55,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 21:05:55,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:55,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:55,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:55,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:55,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 20 [2022-11-20 21:05:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:56,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:56,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642184402] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:56,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [697046664] [2022-11-20 21:05:56,862 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-20 21:05:56,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:56,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 25 [2022-11-20 21:05:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103969621] [2022-11-20 21:05:56,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:56,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 21:05:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 21:05:56,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=555, Unknown=1, NotChecked=0, Total=650 [2022-11-20 21:05:56,865 INFO L87 Difference]: Start difference. First operand 139 states and 410 transitions. Second operand has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:06:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:06,504 INFO L93 Difference]: Finished difference Result 510 states and 1393 transitions. [2022-11-20 21:06:06,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-20 21:06:06,505 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:06:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:06,508 INFO L225 Difference]: With dead ends: 510 [2022-11-20 21:06:06,508 INFO L226 Difference]: Without dead ends: 492 [2022-11-20 21:06:06,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2453 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1234, Invalid=6597, Unknown=1, NotChecked=0, Total=7832 [2022-11-20 21:06:06,512 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 509 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:06,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 0 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 934 Invalid, 0 Unknown, 123 Unchecked, 1.3s Time] [2022-11-20 21:06:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-20 21:06:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 157. [2022-11-20 21:06:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 3.0961538461538463) internal successors, (483), 156 states have internal predecessors, (483), 0 states have call successors, (0), 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-20 21:06:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 483 transitions. [2022-11-20 21:06:06,524 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 483 transitions. Word has length 16 [2022-11-20 21:06:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:06,524 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 483 transitions. [2022-11-20 21:06:06,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:06:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 483 transitions. [2022-11-20 21:06:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:06:06,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:06,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:06,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:06,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 21:06:06,733 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:06:06,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -652469855, now seen corresponding path program 10 times [2022-11-20 21:06:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:06,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128261551] [2022-11-20 21:06:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:06:07,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:07,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128261551] [2022-11-20 21:06:07,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128261551] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:07,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647538763] [2022-11-20 21:06:07,820 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:06:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:07,827 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:07,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 21:06:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:08,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-20 21:06:08,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:08,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:06:08,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:06:08,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:06:08,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 21:06:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:06:08,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:09,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647538763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:06:09,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [281366721] [2022-11-20 21:06:09,405 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-20 21:06:09,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:06:09,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 24 [2022-11-20 21:06:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966002686] [2022-11-20 21:06:09,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:09,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 21:06:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:09,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 21:06:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=518, Unknown=3, NotChecked=0, Total=600 [2022-11-20 21:06:09,409 INFO L87 Difference]: Start difference. First operand 157 states and 483 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:06:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:12,353 INFO L93 Difference]: Finished difference Result 345 states and 957 transitions. [2022-11-20 21:06:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 21:06:12,354 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:06:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:12,356 INFO L225 Difference]: With dead ends: 345 [2022-11-20 21:06:12,356 INFO L226 Difference]: Without dead ends: 335 [2022-11-20 21:06:12,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=378, Invalid=2069, Unknown=3, NotChecked=0, Total=2450 [2022-11-20 21:06:12,359 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:12,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 719 Invalid, 0 Unknown, 82 Unchecked, 0.9s Time] [2022-11-20 21:06:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-20 21:06:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 161. [2022-11-20 21:06:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.11875) internal successors, (499), 160 states have internal predecessors, (499), 0 states have call successors, (0), 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-20 21:06:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 499 transitions. [2022-11-20 21:06:12,371 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 499 transitions. Word has length 16 [2022-11-20 21:06:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:12,372 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 499 transitions. [2022-11-20 21:06:12,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 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-20 21:06:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 499 transitions. [2022-11-20 21:06:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:06:12,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:12,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:12,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:12,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 21:06:12,583 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:06:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash 147534721, now seen corresponding path program 11 times [2022-11-20 21:06:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:12,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522497496] [2022-11-20 21:06:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:12,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:06:13,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:13,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522497496] [2022-11-20 21:06:13,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522497496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:13,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082150919] [2022-11-20 21:06:13,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:06:13,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:13,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:13,697 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:13,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 21:06:13,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:06:13,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:06:13,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 21:06:13,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:13,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:06:13,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:06:13,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:06:14,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 21:06:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:06:14,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:14,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082150919] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:06:14,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [428423397] [2022-11-20 21:06:14,943 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-20 21:06:14,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:06:14,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-11-20 21:06:14,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609596776] [2022-11-20 21:06:14,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:14,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 21:06:14,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:14,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 21:06:14,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=478, Unknown=3, NotChecked=0, Total=552 [2022-11-20 21:06:14,944 INFO L87 Difference]: Start difference. First operand 161 states and 499 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:06:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:16,274 INFO L93 Difference]: Finished difference Result 307 states and 888 transitions. [2022-11-20 21:06:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 21:06:16,274 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:06:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:16,277 INFO L225 Difference]: With dead ends: 307 [2022-11-20 21:06:16,278 INFO L226 Difference]: Without dead ends: 297 [2022-11-20 21:06:16,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=1199, Unknown=3, NotChecked=0, Total=1406 [2022-11-20 21:06:16,279 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:16,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 534 Invalid, 0 Unknown, 78 Unchecked, 0.5s Time] [2022-11-20 21:06:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-20 21:06:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 161. [2022-11-20 21:06:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.11875) internal successors, (499), 160 states have internal predecessors, (499), 0 states have call successors, (0), 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-20 21:06:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 499 transitions. [2022-11-20 21:06:16,288 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 499 transitions. Word has length 16 [2022-11-20 21:06:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:16,288 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 499 transitions. [2022-11-20 21:06:16,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:06:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 499 transitions. [2022-11-20 21:06:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 21:06:16,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:16,290 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:16,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:16,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:16,497 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:06:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash -722838731, now seen corresponding path program 12 times [2022-11-20 21:06:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:16,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123177476] [2022-11-20 21:06:16,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:16,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:16,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123177476] [2022-11-20 21:06:16,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123177476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:16,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423536175] [2022-11-20 21:06:16,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:06:16,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:16,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:16,706 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:16,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 21:06:16,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:06:16,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:06:16,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 21:06:16,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:17,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:17,318 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:06:17,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 376 treesize of output 272 [2022-11-20 21:06:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:17,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423536175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:06:17,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [84258708] [2022-11-20 21:06:17,508 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-20 21:06:17,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:06:17,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-20 21:06:17,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163626806] [2022-11-20 21:06:17,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:17,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:06:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:17,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:06:17,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:06:17,510 INFO L87 Difference]: Start difference. First operand 161 states and 499 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 21:06:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:17,791 INFO L93 Difference]: Finished difference Result 217 states and 586 transitions. [2022-11-20 21:06:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 21:06:17,792 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 21:06:17,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:17,793 INFO L225 Difference]: With dead ends: 217 [2022-11-20 21:06:17,794 INFO L226 Difference]: Without dead ends: 207 [2022-11-20 21:06:17,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-11-20 21:06:17,795 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:17,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:06:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-20 21:06:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 165. [2022-11-20 21:06:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.7378048780487805) internal successors, (449), 164 states have internal predecessors, (449), 0 states have call successors, (0), 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-20 21:06:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 449 transitions. [2022-11-20 21:06:17,807 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 449 transitions. Word has length 17 [2022-11-20 21:06:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:17,807 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 449 transitions. [2022-11-20 21:06:17,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 21:06:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 449 transitions. [2022-11-20 21:06:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 21:06:17,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:17,809 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:17,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:18,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:18,017 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:06:18,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1472731468, now seen corresponding path program 13 times [2022-11-20 21:06:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:18,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560590569] [2022-11-20 21:06:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:06:18,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:18,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560590569] [2022-11-20 21:06:18,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560590569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:18,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422264038] [2022-11-20 21:06:18,244 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:06:18,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:18,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:18,246 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:18,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 21:06:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:18,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 21:06:18,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:06:18,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:18,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 215 [2022-11-20 21:06:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:06:18,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422264038] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:06:18,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1698140178] [2022-11-20 21:06:18,895 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-20 21:06:18,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:06:18,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-20 21:06:18,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245400498] [2022-11-20 21:06:18,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:18,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 21:06:18,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:18,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 21:06:18,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-20 21:06:18,898 INFO L87 Difference]: Start difference. First operand 165 states and 449 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:06:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:19,519 INFO L93 Difference]: Finished difference Result 199 states and 509 transitions. [2022-11-20 21:06:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 21:06:19,520 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 21:06:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:19,522 INFO L225 Difference]: With dead ends: 199 [2022-11-20 21:06:19,522 INFO L226 Difference]: Without dead ends: 199 [2022-11-20 21:06:19,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=294, Invalid=698, Unknown=0, NotChecked=0, Total=992 [2022-11-20 21:06:19,523 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:19,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 0 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:06:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-20 21:06:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 162. [2022-11-20 21:06:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.652173913043478) internal successors, (427), 161 states have internal predecessors, (427), 0 states have call successors, (0), 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-20 21:06:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 427 transitions. [2022-11-20 21:06:19,530 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 427 transitions. Word has length 17 [2022-11-20 21:06:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:19,531 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 427 transitions. [2022-11-20 21:06:19,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:06:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 427 transitions. [2022-11-20 21:06:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 21:06:19,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:19,532 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:19,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:19,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:19,739 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:06:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1411721249, now seen corresponding path program 14 times [2022-11-20 21:06:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:19,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402537012] [2022-11-20 21:06:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:19,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:19,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402537012] [2022-11-20 21:06:19,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402537012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:19,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781405649] [2022-11-20 21:06:19,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:06:19,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:19,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:19,966 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:20,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 21:06:20,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 21:06:20,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:06:20,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 21:06:20,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:20,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:20,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781405649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:06:20,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1995655844] [2022-11-20 21:06:20,332 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-20 21:06:20,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:06:20,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-20 21:06:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197651848] [2022-11-20 21:06:20,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:20,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 21:06:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:20,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 21:06:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-20 21:06:20,338 INFO L87 Difference]: Start difference. First operand 162 states and 427 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:06:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:20,499 INFO L93 Difference]: Finished difference Result 133 states and 323 transitions. [2022-11-20 21:06:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 21:06:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 21:06:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:20,501 INFO L225 Difference]: With dead ends: 133 [2022-11-20 21:06:20,501 INFO L226 Difference]: Without dead ends: 95 [2022-11-20 21:06:20,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-20 21:06:20,502 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:20,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:06:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-20 21:06:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-20 21:06:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.617021276595745) internal successors, (246), 94 states have internal predecessors, (246), 0 states have call successors, (0), 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-20 21:06:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 246 transitions. [2022-11-20 21:06:20,508 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 246 transitions. Word has length 18 [2022-11-20 21:06:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:20,508 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 246 transitions. [2022-11-20 21:06:20,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:06:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 246 transitions. [2022-11-20 21:06:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:06:20,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:20,509 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:20,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-20 21:06:20,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 21:06:20,717 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:06:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1050595456, now seen corresponding path program 15 times [2022-11-20 21:06:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:20,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155168123] [2022-11-20 21:06:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:06:24,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:24,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155168123] [2022-11-20 21:06:24,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155168123] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:24,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250123471] [2022-11-20 21:06:24,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:06:24,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:24,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:24,011 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:24,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 21:06:24,191 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:06:24,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:06:24,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-20 21:06:24,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:24,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:24,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-11-20 21:06:25,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:06:25,375 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 251 treesize of output 171 [2022-11-20 21:06:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:06:25,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:27,441 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~j~0 4))) (let ((.cse8 (not (< (+ c_~j~0 1) c_~N~0))) (.cse3 (+ c_~A~0.offset .cse22)) (.cse4 (+ c_~A~0.offset .cse22 4)) (.cse9 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4)) (.cse0 (select .cse2 .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse0 2147483648))) (not (<= (+ .cse1 c_~bag2~0 .cse0) 2147483647)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= c_~sum1~0 (+ .cse1 c_~bag2~0 c_~sum2~0 .cse0)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse4)) (.cse5 (select .cse7 .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse5 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 .cse5 2147483648))) (not (<= (+ .cse6 c_~bag2~0 .cse5) 2147483647)) (not (<= (+ c_~bag2~0 .cse5) 2147483647)) (<= (+ .cse6 c_~bag2~0 c_~sum2~0 .cse5) c_~sum1~0)))))) .cse8 .cse9) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse4)) (.cse10 (select .cse12 .cse3))) (or (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (<= c_~sum1~0 (+ .cse11 c_~bag2~0 c_~sum2~0 .cse10)) (< c_~bag2~0 (+ .cse11 1)) (not (<= 0 (+ .cse11 .cse10 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse4)) (.cse13 (select .cse15 .cse3))) (or (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (< c_~bag2~0 (+ .cse14 1)) (not (<= 0 (+ .cse14 .cse13 2147483648))) (<= (+ .cse14 c_~bag2~0 c_~sum2~0 .cse13) c_~sum1~0)))))) .cse8 .cse9) (or .cse8 (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse4)) (.cse16 (select .cse18 .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse16 2147483648))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse16) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse16 2147483648))) (<= c_~sum1~0 (+ .cse17 c_~bag2~0 c_~sum2~0 .cse16)) (not (<= 0 (+ .cse17 .cse16 2147483648))) (not (<= (+ .cse17 .cse16) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse4)) (.cse19 (select .cse21 .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse19 2147483648))) (not (<= 0 (+ .cse20 .cse19 2147483648))) (<= (+ .cse20 c_~bag2~0 c_~sum2~0 .cse19) c_~sum1~0) (not (<= (+ .cse20 .cse19) 2147483647))))))) .cse9)))))) is different from false [2022-11-20 21:06:27,709 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~j~0 4))) (let ((.cse0 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse23)) (.cse5 (+ c_~A~0.offset .cse23 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (<= .cse0 (+ .cse1 c_~bag2~0 c_~sum2~0 .cse2)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse2 2147483648))) (not (<= (+ .cse1 c_~bag2~0 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (<= (+ .cse6 c_~bag2~0 c_~sum2~0 .cse7) .cse0) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 .cse7 2147483648))) (not (<= (+ .cse6 c_~bag2~0 .cse7) 2147483647)) (not (<= (+ c_~bag2~0 .cse7) 2147483647))))))) .cse9 .cse10) (or (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse5)) (.cse12 (select .cse13 .cse4))) (or (<= (+ .cse11 c_~bag2~0 c_~sum2~0 .cse12) .cse0) (not (<= 0 (+ c_~bag2~0 .cse12 2147483648))) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse12) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse12 2147483648))) (not (<= 0 (+ .cse11 .cse12 2147483648))) (not (<= (+ .cse11 .cse12) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse5)) (.cse15 (select .cse16 .cse4))) (or (<= .cse0 (+ .cse14 c_~bag2~0 c_~sum2~0 .cse15)) (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse15) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse15 2147483648))) (not (<= 0 (+ .cse14 .cse15 2147483648))) (not (<= (+ .cse14 .cse15) 2147483647))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse5)) (.cse18 (select .cse19 .cse4))) (or (<= .cse0 (+ .cse17 c_~bag2~0 c_~sum2~0 .cse18)) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (< c_~bag2~0 (+ .cse17 1)) (not (<= 0 (+ .cse17 .cse18 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse5)) (.cse21 (select .cse22 .cse4))) (or (<= (+ .cse20 c_~bag2~0 c_~sum2~0 .cse21) .cse0) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (< c_~bag2~0 (+ .cse20 1)) (not (<= 0 (+ .cse20 .cse21 2147483648)))))))) .cse9 .cse10)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))))))) is different from false [2022-11-20 21:06:27,960 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~j~0 4))) (let ((.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse2 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse4 (+ c_~A~0.offset .cse23)) (.cse5 (+ c_~A~0.offset .cse23 4)) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse0 2147483648))) (<= (+ .cse1 c_~bag2~0 c_~sum2~0 .cse0) .cse2) (not (<= (+ .cse1 c_~bag2~0 .cse0) 2147483647)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse5)) (.cse6 (select .cse8 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (not (<= 0 (+ .cse7 c_~bag2~0 .cse6 2147483648))) (not (<= (+ .cse7 c_~bag2~0 .cse6) 2147483647)) (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (<= .cse2 (+ .cse7 c_~bag2~0 c_~sum2~0 .cse6))))))) .cse9 .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse5)) (.cse11 (select .cse13 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse11 2147483648))) (<= (+ .cse12 c_~bag2~0 c_~sum2~0 .cse11) .cse2) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse11 2147483648))) (not (<= 0 (+ .cse12 .cse11 2147483648))) (not (<= (+ .cse12 .cse11) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse5)) (.cse14 (select .cse16 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse14 2147483648))) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (<= .cse2 (+ .cse15 c_~bag2~0 c_~sum2~0 .cse14)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse14 2147483648))) (not (<= 0 (+ .cse15 .cse14 2147483648))) (not (<= (+ .cse15 .cse14) 2147483647))))))) .cse9 .cse10) (or .cse9 (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse5)) (.cse18 (select .cse19 .cse4))) (or (<= (+ .cse17 c_~bag2~0 c_~sum2~0 .cse18) .cse2) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (< c_~bag2~0 (+ .cse17 1)) (not (<= 0 (+ .cse17 .cse18 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse4))) (or (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= .cse2 (+ .cse21 c_~bag2~0 c_~sum2~0 .cse20)) (< c_~bag2~0 (+ .cse21 1)) (not (<= 0 (+ .cse21 .cse20 2147483648)))))))) .cse10)))))) is different from false [2022-11-20 21:06:28,254 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~i~0 c_~N~0)) (let ((.cse23 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse4 (+ c_~A~0.offset .cse23)) (.cse5 (+ c_~A~0.offset .cse23 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse0 2147483648))) (not (<= (+ .cse1 c_~bag2~0 .cse0) 2147483647)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= (+ .cse1 c_~bag2~0 c_~sum2~0 .cse0) .cse2))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse5)) (.cse6 (select .cse8 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (not (<= 0 (+ .cse7 c_~bag2~0 .cse6 2147483648))) (not (<= (+ .cse7 c_~bag2~0 .cse6) 2147483647)) (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (<= .cse2 (+ .cse7 c_~bag2~0 c_~sum2~0 .cse6))))))) .cse9 .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse5)) (.cse11 (select .cse13 .cse4))) (or (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (<= .cse2 (+ .cse12 c_~bag2~0 c_~sum2~0 .cse11)) (< c_~bag2~0 (+ .cse12 1)) (not (<= 0 (+ .cse12 .cse11 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse5)) (.cse14 (select .cse16 .cse4))) (or (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (<= (+ .cse15 c_~bag2~0 c_~sum2~0 .cse14) .cse2) (< c_~bag2~0 (+ .cse15 1)) (not (<= 0 (+ .cse15 .cse14 2147483648)))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse5)) (.cse17 (select .cse19 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse17) 2147483647)) (<= (+ .cse18 c_~bag2~0 c_~sum2~0 .cse17) .cse2) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse17 2147483648))) (not (<= 0 (+ .cse18 .cse17 2147483648))) (not (<= (+ .cse18 .cse17) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= .cse2 (+ .cse21 c_~bag2~0 c_~sum2~0 .cse20)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse20 2147483648))) (not (<= 0 (+ .cse21 .cse20 2147483648))) (not (<= (+ .cse21 .cse20) 2147483647))))))) .cse9 .cse10))))))) is different from false [2022-11-20 21:06:28,439 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-20 21:06:28,440 INFO L350 Elim1Store]: Elim1 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 221 treesize of output 174 [2022-11-20 21:06:28,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:06:28,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 71 [2022-11-20 21:06:28,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:28,648 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:06:28,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 98 treesize of output 38 [2022-11-20 21:06:28,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:28,680 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-20 21:06:28,680 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 1 [2022-11-20 21:06:28,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:28,695 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-20 21:06:28,695 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 1 [2022-11-20 21:06:28,759 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-20 21:06:28,759 INFO L350 Elim1Store]: Elim1 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 280 treesize of output 217 [2022-11-20 21:06:28,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:06:28,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 112 [2022-11-20 21:06:29,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:29,199 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:06:29,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 124 treesize of output 48 [2022-11-20 21:06:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 21:06:29,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250123471] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:06:29,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1075220822] [2022-11-20 21:06:29,649 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:06:29,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:06:29,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-11-20 21:06:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668333253] [2022-11-20 21:06:29,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:29,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 21:06:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:29,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 21:06:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1038, Unknown=4, NotChecked=276, Total=1482 [2022-11-20 21:06:29,652 INFO L87 Difference]: Start difference. First operand 95 states and 246 transitions. Second operand has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 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-20 21:06:38,909 WARN L233 SmtUtils]: Spent 7.04s on a formula simplification. DAG size of input: 132 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:06:48,353 WARN L233 SmtUtils]: Spent 7.05s on a formula simplification. DAG size of input: 128 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:06:53,779 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse49 (* c_~j~0 4))) (let ((.cse15 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse12 (<= 3 c_~N~0)) (.cse11 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse13 (not (< 1 c_~N~0))) (.cse14 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (.cse0 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse49)) (.cse5 (+ c_~A~0.offset .cse49 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0)) (.cse23 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse24 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (<= .cse0 (+ .cse1 c_~bag2~0 c_~sum2~0 .cse2)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse2 2147483648))) (not (<= (+ .cse1 c_~bag2~0 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (<= (+ .cse6 c_~bag2~0 c_~sum2~0 .cse7) .cse0) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 .cse7 2147483648))) (not (<= (+ .cse6 c_~bag2~0 .cse7) 2147483647)) (not (<= (+ c_~bag2~0 .cse7) 2147483647))))))) .cse9 .cse10) (or (not .cse11) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12 .cse13 .cse14) (or .cse15 .cse12 .cse13 .cse14) (or (not (< c_~i~0 c_~N~0)) (let ((.cse18 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse5)) (.cse16 (select .cse19 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse16 2147483648))) (not (<= 0 (+ .cse17 c_~bag2~0 .cse16 2147483648))) (not (<= (+ .cse17 c_~bag2~0 .cse16) 2147483647)) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (<= (+ .cse17 c_~bag2~0 c_~sum2~0 .cse16) .cse18))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= 0 (+ .cse21 c_~bag2~0 .cse20 2147483648))) (not (<= (+ .cse21 c_~bag2~0 .cse20) 2147483647)) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= .cse18 (+ .cse21 c_~bag2~0 c_~sum2~0 .cse20))))))) .cse9 .cse10) (or .cse23 .cse24 (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse26 (select .cse27 .cse5)) (.cse25 (select .cse27 .cse4))) (or (not (<= (+ c_~bag2~0 .cse25) 2147483647)) (<= .cse18 (+ .cse26 c_~bag2~0 c_~sum2~0 .cse25)) (< c_~bag2~0 (+ .cse26 1)) (not (<= 0 (+ .cse26 .cse25 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse29 (select .cse30 .cse5)) (.cse28 (select .cse30 .cse4))) (or (not (<= (+ c_~bag2~0 .cse28) 2147483647)) (<= (+ .cse29 c_~bag2~0 c_~sum2~0 .cse28) .cse18) (< c_~bag2~0 (+ .cse29 1)) (not (<= 0 (+ .cse29 .cse28 2147483648)))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse32 (select .cse33 .cse5)) (.cse31 (select .cse33 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse31 2147483648))) (not (<= (+ c_~bag2~0 .cse31) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse31) 2147483647)) (<= (+ .cse32 c_~bag2~0 c_~sum2~0 .cse31) .cse18) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse31 2147483648))) (not (<= 0 (+ .cse32 .cse31 2147483648))) (not (<= (+ .cse32 .cse31) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse5)) (.cse34 (select .cse36 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse34 2147483648))) (not (<= (+ c_~bag2~0 .cse34) 2147483647)) (<= .cse18 (+ .cse35 c_~bag2~0 c_~sum2~0 .cse34)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse34) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse34 2147483648))) (not (<= 0 (+ .cse35 .cse34 2147483648))) (not (<= (+ .cse35 .cse34) 2147483647))))))) .cse9 .cse10)))))) (or (not .cse15) .cse12 .cse11 .cse13 .cse14) (or (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse37 (select .cse39 .cse5)) (.cse38 (select .cse39 .cse4))) (or (<= (+ .cse37 c_~bag2~0 c_~sum2~0 .cse38) .cse0) (not (<= 0 (+ c_~bag2~0 .cse38 2147483648))) (not (<= (+ c_~bag2~0 .cse38) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse38) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse38 2147483648))) (not (<= 0 (+ .cse37 .cse38 2147483648))) (not (<= (+ .cse37 .cse38) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse40 (select .cse42 .cse5)) (.cse41 (select .cse42 .cse4))) (or (<= .cse0 (+ .cse40 c_~bag2~0 c_~sum2~0 .cse41)) (not (<= 0 (+ c_~bag2~0 .cse41 2147483648))) (not (<= (+ c_~bag2~0 .cse41) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse41) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse41 2147483648))) (not (<= 0 (+ .cse40 .cse41 2147483648))) (not (<= (+ .cse40 .cse41) 2147483647))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse43 (select .cse45 .cse5)) (.cse44 (select .cse45 .cse4))) (or (<= .cse0 (+ .cse43 c_~bag2~0 c_~sum2~0 .cse44)) (not (<= (+ c_~bag2~0 .cse44) 2147483647)) (< c_~bag2~0 (+ .cse43 1)) (not (<= 0 (+ .cse43 .cse44 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse48 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse46 (select .cse48 .cse5)) (.cse47 (select .cse48 .cse4))) (or (<= (+ .cse46 c_~bag2~0 c_~sum2~0 .cse47) .cse0) (not (<= (+ c_~bag2~0 .cse47) 2147483647)) (< c_~bag2~0 (+ .cse46 1)) (not (<= 0 (+ .cse46 .cse47 2147483648)))))))) .cse9 .cse10)) .cse23 .cse24)))) is different from false [2022-11-20 21:07:16,516 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 146 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:07:58,915 WARN L233 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 154 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:08:14,487 WARN L233 SmtUtils]: Spent 7.04s on a formula simplification. DAG size of input: 124 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:08:30,631 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse48 (* c_~j~0 4))) (let ((.cse12 (<= 3 c_~N~0)) (.cse11 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse13 (not (< 1 c_~N~0))) (.cse14 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (.cse0 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse48)) (.cse5 (+ c_~A~0.offset .cse48 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0)) (.cse22 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse23 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (<= .cse0 (+ .cse1 c_~bag2~0 c_~sum2~0 .cse2)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse2 2147483648))) (not (<= (+ .cse1 c_~bag2~0 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (<= (+ .cse6 c_~bag2~0 c_~sum2~0 .cse7) .cse0) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 .cse7 2147483648))) (not (<= (+ .cse6 c_~bag2~0 .cse7) 2147483647)) (not (<= (+ c_~bag2~0 .cse7) 2147483647))))))) .cse9 .cse10) (or (not .cse11) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12 .cse13 .cse14) (or (not (< c_~i~0 c_~N~0)) (let ((.cse17 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse5)) (.cse15 (select .cse18 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (not (<= 0 (+ .cse16 c_~bag2~0 .cse15 2147483648))) (not (<= (+ .cse16 c_~bag2~0 .cse15) 2147483647)) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (<= (+ .cse16 c_~bag2~0 c_~sum2~0 .cse15) .cse17))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse5)) (.cse19 (select .cse21 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= 0 (+ .cse20 c_~bag2~0 .cse19 2147483648))) (not (<= (+ .cse20 c_~bag2~0 .cse19) 2147483647)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (<= .cse17 (+ .cse20 c_~bag2~0 c_~sum2~0 .cse19))))))) .cse9 .cse10) (or .cse22 .cse23 (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse25 (select .cse26 .cse5)) (.cse24 (select .cse26 .cse4))) (or (not (<= (+ c_~bag2~0 .cse24) 2147483647)) (<= .cse17 (+ .cse25 c_~bag2~0 c_~sum2~0 .cse24)) (< c_~bag2~0 (+ .cse25 1)) (not (<= 0 (+ .cse25 .cse24 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse5)) (.cse27 (select .cse29 .cse4))) (or (not (<= (+ c_~bag2~0 .cse27) 2147483647)) (<= (+ .cse28 c_~bag2~0 c_~sum2~0 .cse27) .cse17) (< c_~bag2~0 (+ .cse28 1)) (not (<= 0 (+ .cse28 .cse27 2147483648)))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse5)) (.cse30 (select .cse32 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse30 2147483648))) (not (<= (+ c_~bag2~0 .cse30) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse30) 2147483647)) (<= (+ .cse31 c_~bag2~0 c_~sum2~0 .cse30) .cse17) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse30 2147483648))) (not (<= 0 (+ .cse31 .cse30 2147483648))) (not (<= (+ .cse31 .cse30) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse34 (select .cse35 .cse5)) (.cse33 (select .cse35 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse33 2147483648))) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (<= .cse17 (+ .cse34 c_~bag2~0 c_~sum2~0 .cse33)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse33) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse33 2147483648))) (not (<= 0 (+ .cse34 .cse33 2147483648))) (not (<= (+ .cse34 .cse33) 2147483647))))))) .cse9 .cse10)))))) (or (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse12 .cse11 .cse13 .cse14) (or (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse36 (select .cse38 .cse5)) (.cse37 (select .cse38 .cse4))) (or (<= (+ .cse36 c_~bag2~0 c_~sum2~0 .cse37) .cse0) (not (<= 0 (+ c_~bag2~0 .cse37 2147483648))) (not (<= (+ c_~bag2~0 .cse37) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse37) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse37 2147483648))) (not (<= 0 (+ .cse36 .cse37 2147483648))) (not (<= (+ .cse36 .cse37) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse39 (select .cse41 .cse5)) (.cse40 (select .cse41 .cse4))) (or (<= .cse0 (+ .cse39 c_~bag2~0 c_~sum2~0 .cse40)) (not (<= 0 (+ c_~bag2~0 .cse40 2147483648))) (not (<= (+ c_~bag2~0 .cse40) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse40) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse40 2147483648))) (not (<= 0 (+ .cse39 .cse40 2147483648))) (not (<= (+ .cse39 .cse40) 2147483647))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse42 (select .cse44 .cse5)) (.cse43 (select .cse44 .cse4))) (or (<= .cse0 (+ .cse42 c_~bag2~0 c_~sum2~0 .cse43)) (not (<= (+ c_~bag2~0 .cse43) 2147483647)) (< c_~bag2~0 (+ .cse42 1)) (not (<= 0 (+ .cse42 .cse43 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse45 (select .cse47 .cse5)) (.cse46 (select .cse47 .cse4))) (or (<= (+ .cse45 c_~bag2~0 c_~sum2~0 .cse46) .cse0) (not (<= (+ c_~bag2~0 .cse46) 2147483647)) (< c_~bag2~0 (+ .cse45 1)) (not (<= 0 (+ .cse45 .cse46 2147483648)))))))) .cse9 .cse10)) .cse22 .cse23)))) is different from false [2022-11-20 21:08:31,504 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse44 (* c_~j~0 4))) (let ((.cse0 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse44)) (.cse5 (+ c_~A~0.offset .cse44 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0)) (.cse18 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse19 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (<= .cse0 (+ .cse1 c_~bag2~0 c_~sum2~0 .cse2)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse2 2147483648))) (not (<= (+ .cse1 c_~bag2~0 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (<= (+ .cse6 c_~bag2~0 c_~sum2~0 .cse7) .cse0) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 .cse7 2147483648))) (not (<= (+ .cse6 c_~bag2~0 .cse7) 2147483647)) (not (<= (+ c_~bag2~0 .cse7) 2147483647))))))) .cse9 .cse10) (or (not (< c_~i~0 c_~N~0)) (let ((.cse13 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse5)) (.cse11 (select .cse14 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse11 2147483648))) (not (<= 0 (+ .cse12 c_~bag2~0 .cse11 2147483648))) (not (<= (+ .cse12 c_~bag2~0 .cse11) 2147483647)) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (<= (+ .cse12 c_~bag2~0 c_~sum2~0 .cse11) .cse13))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse5)) (.cse15 (select .cse17 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (not (<= 0 (+ .cse16 c_~bag2~0 .cse15 2147483648))) (not (<= (+ .cse16 c_~bag2~0 .cse15) 2147483647)) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (<= .cse13 (+ .cse16 c_~bag2~0 c_~sum2~0 .cse15))))))) .cse9 .cse10) (or .cse18 .cse19 (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse4))) (or (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= .cse13 (+ .cse21 c_~bag2~0 c_~sum2~0 .cse20)) (< c_~bag2~0 (+ .cse21 1)) (not (<= 0 (+ .cse21 .cse20 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse5)) (.cse23 (select .cse25 .cse4))) (or (not (<= (+ c_~bag2~0 .cse23) 2147483647)) (<= (+ .cse24 c_~bag2~0 c_~sum2~0 .cse23) .cse13) (< c_~bag2~0 (+ .cse24 1)) (not (<= 0 (+ .cse24 .cse23 2147483648)))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse27 (select .cse28 .cse5)) (.cse26 (select .cse28 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse26 2147483648))) (not (<= (+ c_~bag2~0 .cse26) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse26) 2147483647)) (<= (+ .cse27 c_~bag2~0 c_~sum2~0 .cse26) .cse13) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse26 2147483648))) (not (<= 0 (+ .cse27 .cse26 2147483648))) (not (<= (+ .cse27 .cse26) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse5)) (.cse29 (select .cse31 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse29 2147483648))) (not (<= (+ c_~bag2~0 .cse29) 2147483647)) (<= .cse13 (+ .cse30 c_~bag2~0 c_~sum2~0 .cse29)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse29) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse29 2147483648))) (not (<= 0 (+ .cse30 .cse29 2147483648))) (not (<= (+ .cse30 .cse29) 2147483647))))))) .cse9 .cse10)))))) (or (and (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse32 (select .cse34 .cse5)) (.cse33 (select .cse34 .cse4))) (or (<= (+ .cse32 c_~bag2~0 c_~sum2~0 .cse33) .cse0) (not (<= 0 (+ c_~bag2~0 .cse33 2147483648))) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse33) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse33 2147483648))) (not (<= 0 (+ .cse32 .cse33 2147483648))) (not (<= (+ .cse32 .cse33) 2147483647)))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse35 (select .cse37 .cse5)) (.cse36 (select .cse37 .cse4))) (or (<= .cse0 (+ .cse35 c_~bag2~0 c_~sum2~0 .cse36)) (not (<= 0 (+ c_~bag2~0 .cse36 2147483648))) (not (<= (+ c_~bag2~0 .cse36) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse36) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse36 2147483648))) (not (<= 0 (+ .cse35 .cse36 2147483648))) (not (<= (+ .cse35 .cse36) 2147483647))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse38 (select .cse40 .cse5)) (.cse39 (select .cse40 .cse4))) (or (<= .cse0 (+ .cse38 c_~bag2~0 c_~sum2~0 .cse39)) (not (<= (+ c_~bag2~0 .cse39) 2147483647)) (< c_~bag2~0 (+ .cse38 1)) (not (<= 0 (+ .cse38 .cse39 2147483648))))))) (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_700) c_~A~0.base))) (let ((.cse41 (select .cse43 .cse5)) (.cse42 (select .cse43 .cse4))) (or (<= (+ .cse41 c_~bag2~0 c_~sum2~0 .cse42) .cse0) (not (<= (+ c_~bag2~0 .cse42) 2147483647)) (< c_~bag2~0 (+ .cse41 1)) (not (<= 0 (+ .cse41 .cse42 2147483648)))))))) .cse9 .cse10)) .cse18 .cse19)))) is different from false [2022-11-20 21:08:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:08:31,665 INFO L93 Difference]: Finished difference Result 958 states and 2424 transitions. [2022-11-20 21:08:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-11-20 21:08:31,666 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:08:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:08:31,670 INFO L225 Difference]: With dead ends: 958 [2022-11-20 21:08:31,670 INFO L226 Difference]: Without dead ends: 905 [2022-11-20 21:08:31,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 153 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 8944 ImplicationChecksByTransitivity, 120.4s TimeCoverageRelationStatistics Valid=3085, Invalid=18675, Unknown=24, NotChecked=2086, Total=23870 [2022-11-20 21:08:31,675 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 942 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2282 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:08:31,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 0 Invalid, 4512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2038 Invalid, 0 Unknown, 2282 Unchecked, 3.2s Time] [2022-11-20 21:08:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-11-20 21:08:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 201. [2022-11-20 21:08:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 2.74) internal successors, (548), 200 states have internal predecessors, (548), 0 states have call successors, (0), 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-20 21:08:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 548 transitions. [2022-11-20 21:08:31,689 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 548 transitions. Word has length 20 [2022-11-20 21:08:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:08:31,689 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 548 transitions. [2022-11-20 21:08:31,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 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-20 21:08:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 548 transitions. [2022-11-20 21:08:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:08:31,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:08:31,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:08:31,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 21:08:31,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:08:31,897 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:08:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:08:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash 929294412, now seen corresponding path program 16 times [2022-11-20 21:08:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:08:31,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496073233] [2022-11-20 21:08:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:08:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:35,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:08:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496073233] [2022-11-20 21:08:35,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496073233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:08:35,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636298024] [2022-11-20 21:08:35,580 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:08:35,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:08:35,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:08:35,583 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:08:35,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 21:08:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:35,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-20 21:08:35,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:08:36,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:08:36,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-11-20 21:08:36,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:08:36,923 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 251 treesize of output 171 [2022-11-20 21:08:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:37,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:08:40,155 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~j~0 4))) (let ((.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse3 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse5 (+ c_~A~0.offset .cse23)) (.cse6 (+ c_~A~0.offset .cse23 4)) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or .cse0 (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse1 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (<= (+ c_~bag2~0 .cse1 .cse2 c_~sum2~0) .cse3) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse1 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse1 .cse2 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse6)) (.cse7 (select .cse9 .cse5))) (or (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (not (<= (+ c_~bag2~0 .cse8 .cse7) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (<= .cse3 (+ c_~bag2~0 .cse8 .cse7 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse8 .cse7 2147483648)))))))) .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse6)) (.cse12 (select .cse13 .cse5))) (or (not (<= 0 (+ .cse11 .cse12 2147483648))) (< c_~bag2~0 (+ .cse11 1)) (<= (+ c_~bag2~0 .cse11 .cse12 c_~sum2~0) .cse3) (not (<= (+ c_~bag2~0 .cse12) 2147483647)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse6)) (.cse15 (select .cse16 .cse5))) (or (not (<= 0 (+ .cse14 .cse15 2147483648))) (< c_~bag2~0 (+ .cse14 1)) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (<= .cse3 (+ c_~bag2~0 .cse14 .cse15 c_~sum2~0))))))) .cse0 .cse10) (or .cse0 (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse6)) (.cse18 (select .cse19 .cse5))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (<= (+ c_~bag2~0 .cse17 .cse18 c_~sum2~0) .cse3) (not (<= (+ c_~bag2~0 .cse18 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (not (<= (+ .cse17 .cse18) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse18 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse6)) (.cse21 (select .cse22 .cse5))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (not (<= (+ c_~bag2~0 .cse21 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= (+ .cse20 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse21 2147483648))) (<= .cse3 (+ c_~bag2~0 .cse20 .cse21 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse21 c_~sum2~0 2147483648)))))))) .cse10)))))) is different from false [2022-11-20 21:08:41,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:08:41,047 INFO L350 Elim1Store]: Elim1 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 354 treesize of output 289 [2022-11-20 21:08:41,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:08:41,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 158 [2022-11-20 21:08:41,489 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:08:41,489 INFO L350 Elim1Store]: Elim1 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 354 treesize of output 245 [2022-11-20 21:08:41,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:08:41,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 158 [2022-11-20 21:08:41,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:08:41,660 INFO L350 Elim1Store]: Elim1 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 221 treesize of output 188 [2022-11-20 21:08:41,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:08:41,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 71 [2022-11-20 21:08:41,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:08:41,990 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:08:41,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 98 treesize of output 38 [2022-11-20 21:08:42,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:08:42,050 INFO L350 Elim1Store]: Elim1 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 280 treesize of output 231 [2022-11-20 21:08:42,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:08:42,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 112 [2022-11-20 21:08:42,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:08:42,470 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:08:42,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 124 treesize of output 48 [2022-11-20 21:08:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 21:08:43,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636298024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:08:43,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1492355435] [2022-11-20 21:08:43,031 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-20 21:08:43,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:08:43,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-11-20 21:08:43,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90281435] [2022-11-20 21:08:43,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:08:43,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 21:08:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:08:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 21:08:43,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1243, Unknown=10, NotChecked=72, Total=1482 [2022-11-20 21:08:43,034 INFO L87 Difference]: Start difference. First operand 201 states and 548 transitions. Second operand has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 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-20 21:08:59,272 WARN L233 SmtUtils]: Spent 9.77s on a formula simplification. DAG size of input: 210 DAG size of output: 200 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:09:21,802 WARN L233 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 190 DAG size of output: 184 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:09:36,534 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse25 (* c_~j~0 4))) (let ((.cse5 (+ c_~bag1~0 c_~sum1~0)) (.cse7 (+ c_~A~0.offset .cse25)) (.cse8 (+ c_~A~0.offset .cse25 4)) (.cse2 (not (< (+ c_~j~0 1) c_~N~0))) (.cse12 (<= (+ c_~j~0 3) c_~N~0)) (.cse0 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse1 (* |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4))) (and (or (< .cse0 .cse1) (and (or (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (not (= c_~sum2~0 0)) (not (= c_~bag2~0 0))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse2 (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse3 (select .cse6 .cse8)) (.cse4 (select .cse6 .cse7))) (or (not (<= 0 (+ .cse3 .cse4 2147483648))) (not (<= (+ c_~bag2~0 .cse4 c_~sum2~0) 2147483647)) (<= .cse5 (+ c_~bag2~0 .cse3 .cse4 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse4) 2147483647)) (not (<= (+ .cse3 .cse4) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse4 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse4 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse9 (select .cse11 .cse8)) (.cse10 (select .cse11 .cse7))) (or (not (<= 0 (+ .cse9 .cse10 2147483648))) (not (<= (+ c_~bag2~0 .cse10 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (not (<= (+ .cse9 .cse10) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse10 2147483648))) (<= (+ c_~bag2~0 .cse9 .cse10 c_~sum2~0) .cse5) (not (<= 0 (+ c_~bag2~0 .cse10 c_~sum2~0 2147483648)))))))) .cse12) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse8)) (.cse14 (select .cse15 .cse7))) (or (not (<= 0 (+ .cse13 .cse14 2147483648))) (< c_~bag2~0 (+ .cse13 1)) (<= .cse5 (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse8)) (.cse17 (select .cse18 .cse7))) (or (not (<= 0 (+ .cse16 .cse17 2147483648))) (< c_~bag2~0 (+ .cse16 1)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (<= (+ c_~bag2~0 .cse16 .cse17 c_~sum2~0) .cse5)))))) .cse2 .cse12))) (<= 2 c_~N~0) (or (and (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse8)) (.cse19 (select .cse21 .cse7))) (or (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= (+ c_~bag2~0 .cse20 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (<= (+ c_~bag2~0 .cse20 .cse19 c_~sum2~0) .cse5) (not (<= 0 (+ c_~bag2~0 .cse20 .cse19 2147483648))))))) (forall ((v_ArrVal_735 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_735) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse8)) (.cse23 (select .cse24 .cse7))) (or (<= .cse5 (+ c_~bag2~0 .cse22 .cse23 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse23) 2147483647)) (not (<= (+ c_~bag2~0 .cse22 .cse23) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse23 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse22 .cse23 2147483648)))))))) .cse2 .cse12) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 .cse1) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2022-11-20 21:09:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:09:41,596 INFO L93 Difference]: Finished difference Result 943 states and 2449 transitions. [2022-11-20 21:09:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-20 21:09:41,597 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:09:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:09:41,602 INFO L225 Difference]: With dead ends: 943 [2022-11-20 21:09:41,602 INFO L226 Difference]: Without dead ends: 933 [2022-11-20 21:09:41,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 18 SyntacticMatches, 13 SemanticMatches, 122 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5086 ImplicationChecksByTransitivity, 58.4s TimeCoverageRelationStatistics Valid=1819, Invalid=12876, Unknown=75, NotChecked=482, Total=15252 [2022-11-20 21:09:41,605 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1247 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 821 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:09:41,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 0 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1930 Invalid, 0 Unknown, 821 Unchecked, 3.5s Time] [2022-11-20 21:09:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2022-11-20 21:09:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 227. [2022-11-20 21:09:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 2.765486725663717) internal successors, (625), 226 states have internal predecessors, (625), 0 states have call successors, (0), 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-20 21:09:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 625 transitions. [2022-11-20 21:09:41,621 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 625 transitions. Word has length 20 [2022-11-20 21:09:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:09:41,622 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 625 transitions. [2022-11-20 21:09:41,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 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-20 21:09:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 625 transitions. [2022-11-20 21:09:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:09:41,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:09:41,624 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:09:41,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 21:09:41,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:09:41,830 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:09:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:09:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash 64350748, now seen corresponding path program 17 times [2022-11-20 21:09:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:09:41,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599549473] [2022-11-20 21:09:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:09:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:09:45,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:09:45,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599549473] [2022-11-20 21:09:45,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599549473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:09:45,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067538680] [2022-11-20 21:09:45,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:09:45,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:09:45,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:09:45,464 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:09:45,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 21:09:45,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 21:09:45,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:09:45,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 21:09:45,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:09:45,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 21:09:45,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:09:46,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:09:46,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 21:09:47,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:09:47,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:09:47,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:09:47,250 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 174 [2022-11-20 21:09:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:09:47,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:09:49,817 WARN L837 $PredicateComparison]: unable to prove that (or (< c_~i~0 c_~N~0) (let ((.cse24 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse8 (+ c_~bag1~0 c_~sum1~0 1)) (.cse4 (+ c_~A~0.offset .cse24)) (.cse5 (+ c_~A~0.offset .cse24 4)) (.cse10 (not (< (+ c_~j~0 1) c_~N~0))) (.cse11 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= (+ .cse1 .cse0) 2147483647)) (not (<= 0 (+ .cse1 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse0 c_~sum2~0) 2147483647)) (<= .cse2 (+ .cse1 c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)))))) (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse5)) (.cse6 (select .cse9 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse6 c_~sum2~0 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (< (+ .cse7 c_~bag2~0 .cse6 c_~sum2~0) .cse8) (not (<= (+ .cse7 .cse6) 2147483647)) (not (<= 0 (+ .cse7 .cse6 2147483648))) (not (<= (+ c_~bag2~0 .cse6 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse6) 2147483647))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse4))) (or (< (+ .cse12 c_~bag2~0 .cse13 c_~sum2~0) .cse8) (not (<= 0 (+ .cse12 .cse13 2147483648))) (< c_~bag2~0 (+ .cse12 1)) (not (<= (+ c_~bag2~0 .cse13) 2147483647)))))) (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse5)) (.cse16 (select .cse17 .cse4))) (or (not (<= 0 (+ .cse15 .cse16 2147483648))) (< c_~bag2~0 (+ .cse15 1)) (<= .cse2 (+ .cse15 c_~bag2~0 .cse16 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse16) 2147483647))))))) .cse10 .cse11))) (or (and (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse5)) (.cse18 (select .cse20 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))) (not (<= 0 (+ .cse19 c_~bag2~0 .cse18 2147483648))) (not (<= (+ .cse19 c_~bag2~0 .cse18) 2147483647)) (<= .cse2 (+ .cse19 c_~bag2~0 .cse18 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse18) 2147483647)))))) (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse5)) (.cse21 (select .cse23 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse21 2147483648))) (< (+ .cse22 c_~bag2~0 .cse21 c_~sum2~0) .cse8) (not (<= 0 (+ .cse22 c_~bag2~0 .cse21 2147483648))) (not (<= (+ .cse22 c_~bag2~0 .cse21) 2147483647)) (not (<= (+ c_~bag2~0 .cse21) 2147483647))))))) .cse10 .cse11))))) is different from false [2022-11-20 21:09:50,066 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ c_~i~0 1) c_~N~0) (let ((.cse24 (* c_~j~0 4)) (.cse25 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse2 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse25 |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (.cse6 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse25 |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse4 (+ c_~A~0.offset .cse24)) (.cse5 (+ c_~A~0.offset .cse24 4)) (.cse10 (not (< (+ c_~j~0 1) c_~N~0))) (.cse11 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= (+ .cse1 .cse0) 2147483647)) (not (<= 0 (+ .cse1 .cse0 2147483648))) (< (+ .cse1 c_~bag2~0 .cse0 c_~sum2~0) .cse2) (not (<= (+ c_~bag2~0 .cse0 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)))))) (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse5)) (.cse8 (select .cse9 .cse4))) (or (<= .cse6 (+ .cse7 c_~bag2~0 .cse8 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse8 c_~sum2~0 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse8 2147483648))) (not (<= (+ .cse7 .cse8) 2147483647)) (not (<= 0 (+ .cse7 .cse8 2147483648))) (not (<= (+ c_~bag2~0 .cse8 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse8) 2147483647))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse4))) (or (<= .cse6 (+ .cse12 c_~bag2~0 .cse13 c_~sum2~0)) (not (<= 0 (+ .cse12 .cse13 2147483648))) (< c_~bag2~0 (+ .cse12 1)) (not (<= (+ c_~bag2~0 .cse13) 2147483647)))))) (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse5)) (.cse16 (select .cse17 .cse4))) (or (not (<= 0 (+ .cse15 .cse16 2147483648))) (< c_~bag2~0 (+ .cse15 1)) (< (+ .cse15 c_~bag2~0 .cse16 c_~sum2~0) .cse2) (not (<= (+ c_~bag2~0 .cse16) 2147483647))))))) .cse10 .cse11))) (or (and (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse5)) (.cse18 (select .cse20 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))) (not (<= 0 (+ .cse19 c_~bag2~0 .cse18 2147483648))) (not (<= (+ .cse19 c_~bag2~0 .cse18) 2147483647)) (< (+ .cse19 c_~bag2~0 .cse18 c_~sum2~0) .cse2) (not (<= (+ c_~bag2~0 .cse18) 2147483647)))))) (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse5)) (.cse22 (select .cse23 .cse4))) (or (<= .cse6 (+ .cse21 c_~bag2~0 .cse22 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse22 2147483648))) (not (<= 0 (+ .cse21 c_~bag2~0 .cse22 2147483648))) (not (<= (+ .cse21 c_~bag2~0 .cse22) 2147483647)) (not (<= (+ c_~bag2~0 .cse22) 2147483647))))))) .cse10 .cse11))))) is different from false [2022-11-20 21:09:50,330 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse24 (* c_~j~0 4)) (.cse25 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0 .cse25)) (.cse8 (+ c_~bag1~0 c_~sum1~0 .cse25 1)) (.cse4 (+ c_~A~0.offset .cse24)) (.cse5 (+ c_~A~0.offset .cse24 4)) (.cse10 (not (< (+ c_~j~0 1) c_~N~0))) (.cse11 (< (+ 2 c_~j~0) c_~N~0))) (and (or (and (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 .cse0 2147483648))) (not (<= (+ .cse1 c_~bag2~0 .cse0) 2147483647)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse2 (+ .cse1 c_~bag2~0 .cse0 c_~sum2~0)))))) (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse5)) (.cse6 (select .cse9 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (not (<= 0 (+ .cse7 c_~bag2~0 .cse6 2147483648))) (not (<= (+ .cse7 c_~bag2~0 .cse6) 2147483647)) (< (+ .cse7 c_~bag2~0 .cse6 c_~sum2~0) .cse8) (not (<= (+ c_~bag2~0 .cse6) 2147483647))))))) .cse10 .cse11) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse5)) (.cse12 (select .cse14 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse12 c_~sum2~0 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse12 2147483648))) (not (<= (+ .cse13 .cse12) 2147483647)) (not (<= 0 (+ .cse13 .cse12 2147483648))) (not (<= (+ c_~bag2~0 .cse12 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (<= .cse2 (+ .cse13 c_~bag2~0 .cse12 c_~sum2~0)))))) (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse5)) (.cse15 (select .cse17 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse15 c_~sum2~0 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (not (<= (+ .cse16 .cse15) 2147483647)) (not (<= 0 (+ .cse16 .cse15 2147483648))) (not (<= (+ c_~bag2~0 .cse15 c_~sum2~0) 2147483647)) (< (+ .cse16 c_~bag2~0 .cse15 c_~sum2~0) .cse8) (not (<= (+ c_~bag2~0 .cse15) 2147483647))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse5)) (.cse19 (select .cse20 .cse4))) (or (not (<= 0 (+ .cse18 .cse19 2147483648))) (< c_~bag2~0 (+ .cse18 1)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (<= .cse2 (+ .cse18 c_~bag2~0 .cse19 c_~sum2~0)))))) (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_773) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse5)) (.cse22 (select .cse23 .cse4))) (or (not (<= 0 (+ .cse21 .cse22 2147483648))) (< c_~bag2~0 (+ .cse21 1)) (< (+ .cse21 c_~bag2~0 .cse22 c_~sum2~0) .cse8) (not (<= (+ c_~bag2~0 .cse22) 2147483647))))))) .cse10 .cse11)))))) (< (+ c_~i~0 1) c_~N~0)) is different from false [2022-11-20 21:09:53,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:09:53,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 148 [2022-11-20 21:09:53,589 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 21:09:53,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 540 treesize of output 456 [2022-11-20 21:09:53,624 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 21:09:53,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 442 treesize of output 390 [2022-11-20 21:09:53,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:09:53,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 319 [2022-11-20 21:09:53,793 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:09:53,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 1 [2022-11-20 21:09:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 21:09:54,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067538680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:09:54,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [188187362] [2022-11-20 21:09:54,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-20 21:09:54,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:09:54,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-11-20 21:09:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209475613] [2022-11-20 21:09:54,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:09:54,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 21:09:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:09:54,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 21:09:54,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1179, Unknown=6, NotChecked=216, Total=1560 [2022-11-20 21:09:54,019 INFO L87 Difference]: Start difference. First operand 227 states and 625 transitions. Second operand has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 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-20 21:10:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:10:25,588 INFO L93 Difference]: Finished difference Result 1113 states and 2898 transitions. [2022-11-20 21:10:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-11-20 21:10:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:10:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:10:25,595 INFO L225 Difference]: With dead ends: 1113 [2022-11-20 21:10:25,595 INFO L226 Difference]: Without dead ends: 1090 [2022-11-20 21:10:25,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 141 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6601 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=3115, Invalid=16351, Unknown=6, NotChecked=834, Total=20306 [2022-11-20 21:10:25,598 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 816 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1527 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:10:25,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 0 Invalid, 3698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1954 Invalid, 0 Unknown, 1527 Unchecked, 3.5s Time] [2022-11-20 21:10:25,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2022-11-20 21:10:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 287. [2022-11-20 21:10:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.909090909090909) internal successors, (832), 286 states have internal predecessors, (832), 0 states have call successors, (0), 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-20 21:10:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 832 transitions. [2022-11-20 21:10:25,616 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 832 transitions. Word has length 20 [2022-11-20 21:10:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:10:25,617 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 832 transitions. [2022-11-20 21:10:25,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 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-20 21:10:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 832 transitions. [2022-11-20 21:10:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:10:25,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:10:25,618 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:10:25,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-20 21:10:25,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 21:10:25,824 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:10:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:10:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1382887058, now seen corresponding path program 18 times [2022-11-20 21:10:25,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:10:25,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865080689] [2022-11-20 21:10:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:10:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:10:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:10:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:10:28,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:10:28,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865080689] [2022-11-20 21:10:28,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865080689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:10:28,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391971883] [2022-11-20 21:10:28,334 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:10:28,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:10:28,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:10:28,339 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:10:28,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 21:10:28,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:10:28,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:10:28,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 21:10:28,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:10:29,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:10:29,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-11-20 21:10:29,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:10:29,465 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 252 treesize of output 172 [2022-11-20 21:10:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:10:29,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:10:31,276 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse22 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse22)) (.cse5 (+ c_~A~0.offset .cse22 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0)))) (and (or (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 .cse1 2147483648))) (<= .cse2 (+ c_~bag2~0 c_~sum2~0 .cse0 .cse1)) (not (<= (+ c_~bag2~0 .cse0 .cse1) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse0) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse5)) (.cse6 (select .cse8 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse6 .cse7 2147483648))) (<= (+ c_~bag2~0 c_~sum2~0 .cse6 .cse7) .cse2) (not (<= (+ c_~bag2~0 .cse6 .cse7) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (not (<= (+ c_~bag2~0 .cse6) 2147483647))))))) .cse9) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse10 (select .cse12 .cse5)) (.cse11 (select .cse12 .cse4))) (or (< c_~bag2~0 (+ .cse10 1)) (<= (+ c_~bag2~0 c_~sum2~0 .cse11 .cse10) .cse2) (not (<= 0 (+ .cse11 .cse10 2147483648))) (not (<= (+ c_~bag2~0 .cse11) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (< c_~bag2~0 (+ .cse13 1)) (<= .cse2 (+ c_~bag2~0 c_~sum2~0 .cse14 .cse13)) (not (<= 0 (+ .cse14 .cse13 2147483648))) (not (<= (+ c_~bag2~0 .cse14) 2147483647))))))) .cse9) (or (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse5)) (.cse16 (select .cse18 .cse4))) (or (not (<= (+ .cse16 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse16 2147483648))) (<= .cse2 (+ c_~bag2~0 c_~sum2~0 .cse16 .cse17)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse16) 2147483647)) (not (<= 0 (+ .cse16 .cse17 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse16 2147483648))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse5)) (.cse19 (select .cse21 .cse4))) (or (not (<= (+ .cse19 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse19 2147483648))) (<= (+ c_~bag2~0 c_~sum2~0 .cse19 .cse20) .cse2) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse19) 2147483647)) (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= (+ c_~bag2~0 .cse19) 2147483647))))))) .cse9)))))) (<= (+ c_~i~0 1) c_~N~0)) is different from false [2022-11-20 21:10:31,491 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse22 (* c_~j~0 4))) (let ((.cse1 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse5 (+ c_~A~0.offset .cse22)) (.cse6 (+ c_~A~0.offset .cse22 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0)))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse0 (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse3 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse2 .cse3)) (< c_~bag2~0 (+ .cse3 1)) (not (<= 0 (+ .cse2 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse6)) (.cse8 (select .cse9 .cse5))) (or (< c_~bag2~0 (+ .cse7 1)) (<= (+ c_~bag2~0 c_~sum2~0 .cse8 .cse7) .cse1) (not (<= 0 (+ .cse8 .cse7 2147483648))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)))))))) (or .cse0 (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse6)) (.cse10 (select .cse12 .cse5))) (or (not (<= (+ .cse10 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse10 2147483648))) (<= (+ c_~bag2~0 c_~sum2~0 .cse10 .cse11) .cse1) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse10) 2147483647)) (not (<= 0 (+ .cse10 .cse11 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse10 2147483648))) (not (<= (+ c_~bag2~0 .cse10) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse6)) (.cse13 (select .cse15 .cse5))) (or (not (<= (+ .cse13 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse13 2147483648))) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse13 .cse14)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse13 2147483648))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)))))))))) (or (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse6)) (.cse16 (select .cse18 .cse5))) (or (not (<= 0 (+ c_~bag2~0 .cse16 .cse17 2147483648))) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse16 .cse17)) (not (<= (+ c_~bag2~0 .cse16 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse16 2147483648))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse6)) (.cse19 (select .cse21 .cse5))) (or (not (<= 0 (+ c_~bag2~0 .cse19 .cse20 2147483648))) (<= (+ c_~bag2~0 c_~sum2~0 .cse19 .cse20) .cse1) (not (<= (+ c_~bag2~0 .cse19 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= (+ c_~bag2~0 .cse19) 2147483647))))))) .cse0)))) (< (+ c_~i~0 1) c_~N~0)) is different from false [2022-11-20 21:10:31,751 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~i~0 c_~N~0)) (let ((.cse22 (* c_~j~0 4))) (let ((.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse4 (+ c_~A~0.offset .cse22)) (.cse5 (+ c_~A~0.offset .cse22 4))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (< c_~bag2~0 (+ .cse0 1)) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse2 .cse0)) (not (<= 0 (+ .cse2 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (< c_~bag2~0 (+ .cse6 1)) (<= (+ c_~bag2~0 c_~sum2~0 .cse7 .cse6) .cse1) (not (<= 0 (+ .cse7 .cse6 2147483648))) (not (<= (+ c_~bag2~0 .cse7) 2147483647))))))) .cse9) (or .cse9 (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse5)) (.cse10 (select .cse12 .cse4))) (or (not (<= (+ .cse10 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse10 2147483648))) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse10 .cse11)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse10) 2147483647)) (not (<= 0 (+ .cse10 .cse11 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse10 2147483648))) (not (<= (+ c_~bag2~0 .cse10) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse5)) (.cse13 (select .cse15 .cse4))) (or (not (<= (+ .cse13 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse13 2147483648))) (<= (+ c_~bag2~0 c_~sum2~0 .cse13 .cse14) .cse1) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse13 2147483648))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)))))))))) (or .cse9 (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse5)) (.cse16 (select .cse18 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse16 .cse17 2147483648))) (not (<= (+ c_~bag2~0 .cse16 .cse17) 2147483647)) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse16 .cse17)) (not (<= 0 (+ c_~bag2~0 .cse16 2147483648))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse5)) (.cse19 (select .cse21 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse19 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse19 .cse20) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse19 .cse20) .cse1) (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= (+ c_~bag2~0 .cse19) 2147483647))))))))))) (< (+ c_~i~0 1) c_~N~0)) is different from false [2022-11-20 21:10:31,867 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-20 21:10:31,867 INFO L350 Elim1Store]: Elim1 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 354 treesize of output 275 [2022-11-20 21:10:31,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:10:31,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 158 [2022-11-20 21:10:32,075 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:10:32,076 INFO L350 Elim1Store]: Elim1 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 354 treesize of output 245 [2022-11-20 21:10:32,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:10:32,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 158 [2022-11-20 21:10:32,224 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-20 21:10:32,225 INFO L350 Elim1Store]: Elim1 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 221 treesize of output 174 [2022-11-20 21:10:32,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:10:32,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 71 [2022-11-20 21:10:32,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:10:32,495 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:10:32,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 98 treesize of output 38 [2022-11-20 21:10:32,581 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-20 21:10:32,581 INFO L350 Elim1Store]: Elim1 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 280 treesize of output 217 [2022-11-20 21:10:32,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:10:32,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 112 [2022-11-20 21:10:32,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:10:32,844 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:10:32,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 124 treesize of output 48 [2022-11-20 21:10:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 21:10:33,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391971883] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:10:33,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732673820] [2022-11-20 21:10:33,424 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-20 21:10:33,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:10:33,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2022-11-20 21:10:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623997363] [2022-11-20 21:10:33,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:10:33,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 21:10:33,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:10:33,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 21:10:33,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1059, Unknown=3, NotChecked=204, Total=1406 [2022-11-20 21:10:33,426 INFO L87 Difference]: Start difference. First operand 287 states and 832 transitions. Second operand has 38 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 21:10:36,506 WARN L837 $PredicateComparison]: unable to prove that (and (or (< 2 c_~N~0) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< 1 c_~N~0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< c_~i~0 c_~N~0)) (let ((.cse22 (* c_~j~0 4))) (let ((.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse4 (+ c_~A~0.offset .cse22)) (.cse5 (+ c_~A~0.offset .cse22 4))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (< c_~bag2~0 (+ .cse0 1)) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse2 .cse0)) (not (<= 0 (+ .cse2 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (< c_~bag2~0 (+ .cse6 1)) (<= (+ c_~bag2~0 c_~sum2~0 .cse7 .cse6) .cse1) (not (<= 0 (+ .cse7 .cse6 2147483648))) (not (<= (+ c_~bag2~0 .cse7) 2147483647))))))) .cse9) (or .cse9 (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse5)) (.cse10 (select .cse12 .cse4))) (or (not (<= (+ .cse10 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse10 2147483648))) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse10 .cse11)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse10) 2147483647)) (not (<= 0 (+ .cse10 .cse11 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse10 2147483648))) (not (<= (+ c_~bag2~0 .cse10) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse5)) (.cse13 (select .cse15 .cse4))) (or (not (<= (+ .cse13 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse13 2147483648))) (<= (+ c_~bag2~0 c_~sum2~0 .cse13 .cse14) .cse1) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse13 2147483648))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)))))))))) (or .cse9 (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse5)) (.cse16 (select .cse18 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse16 .cse17 2147483648))) (not (<= (+ c_~bag2~0 .cse16 .cse17) 2147483647)) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse16 .cse17)) (not (<= 0 (+ c_~bag2~0 .cse16 2147483648))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse5)) (.cse19 (select .cse21 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse19 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse19 .cse20) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse19 .cse20) .cse1) (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= (+ c_~bag2~0 .cse19) 2147483647))))))))))) (< (+ c_~i~0 1) c_~N~0))) is different from false [2022-11-20 21:10:55,321 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (< c_~i~0 c_~N~0)) (let ((.cse22 (* c_~j~0 4))) (let ((.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse4 (+ c_~A~0.offset .cse22)) (.cse5 (+ c_~A~0.offset .cse22 4))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (< c_~bag2~0 (+ .cse0 1)) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse2 .cse0)) (not (<= 0 (+ .cse2 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (< c_~bag2~0 (+ .cse6 1)) (<= (+ c_~bag2~0 c_~sum2~0 .cse7 .cse6) .cse1) (not (<= 0 (+ .cse7 .cse6 2147483648))) (not (<= (+ c_~bag2~0 .cse7) 2147483647))))))) .cse9) (or .cse9 (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse5)) (.cse10 (select .cse12 .cse4))) (or (not (<= (+ .cse10 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse10 2147483648))) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse10 .cse11)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse10) 2147483647)) (not (<= 0 (+ .cse10 .cse11 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse10 2147483648))) (not (<= (+ c_~bag2~0 .cse10) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse5)) (.cse13 (select .cse15 .cse4))) (or (not (<= (+ .cse13 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse13 2147483648))) (<= (+ c_~bag2~0 c_~sum2~0 .cse13 .cse14) .cse1) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse13 2147483648))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)))))))))) (or .cse9 (and (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse5)) (.cse16 (select .cse18 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse16 .cse17 2147483648))) (not (<= (+ c_~bag2~0 .cse16 .cse17) 2147483647)) (<= .cse1 (+ c_~bag2~0 c_~sum2~0 .cse16 .cse17)) (not (<= 0 (+ c_~bag2~0 .cse16 2147483648))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)))))) (forall ((v_ArrVal_808 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_808) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse5)) (.cse19 (select .cse21 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse19 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse19 .cse20) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse19 .cse20) .cse1) (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= (+ c_~bag2~0 .cse19) 2147483647))))))))))) (< (+ c_~i~0 1) c_~N~0)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|)) is different from false [2022-11-20 21:11:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:19,754 INFO L93 Difference]: Finished difference Result 1277 states and 3568 transitions. [2022-11-20 21:11:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-11-20 21:11:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:11:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:19,760 INFO L225 Difference]: With dead ends: 1277 [2022-11-20 21:11:19,761 INFO L226 Difference]: Without dead ends: 1267 [2022-11-20 21:11:19,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 13 SyntacticMatches, 10 SemanticMatches, 143 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 7178 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=3166, Invalid=16298, Unknown=16, NotChecked=1400, Total=20880 [2022-11-20 21:11:19,764 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 794 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 656 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:19,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 0 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2030 Invalid, 0 Unknown, 656 Unchecked, 3.6s Time] [2022-11-20 21:11:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-11-20 21:11:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 368. [2022-11-20 21:11:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 3.119891008174387) internal successors, (1145), 367 states have internal predecessors, (1145), 0 states have call successors, (0), 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-20 21:11:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 1145 transitions. [2022-11-20 21:11:19,787 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 1145 transitions. Word has length 20 [2022-11-20 21:11:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:19,787 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 1145 transitions. [2022-11-20 21:11:19,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 0 states have call successors, (0), 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-20 21:11:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 1145 transitions. [2022-11-20 21:11:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:11:19,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:19,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:19,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 21:11:19,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 21:11:19,996 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:11:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1410592688, now seen corresponding path program 19 times [2022-11-20 21:11:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:19,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90053845] [2022-11-20 21:11:19,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:22,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:22,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90053845] [2022-11-20 21:11:22,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90053845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:11:22,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282470127] [2022-11-20 21:11:22,400 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:11:22,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:11:22,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:11:22,402 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:11:22,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 21:11:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:22,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-20 21:11:22,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:11:23,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:11:23,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 21:11:23,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:11:23,856 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 254 treesize of output 192 [2022-11-20 21:11:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:24,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:11:26,609 WARN L837 $PredicateComparison]: unable to prove that (or (< c_~i~0 c_~N~0) (let ((.cse24 (* c_~j~0 4))) (let ((.cse6 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~bag1~0 c_~sum1~0 1)) (.cse5 (+ c_~A~0.offset .cse24)) (.cse4 (+ c_~A~0.offset .cse24 4)) (.cse10 (not (< (+ c_~j~0 1) c_~N~0))) (.cse11 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (< (+ .cse0 c_~bag2~0 c_~sum2~0 .cse1) .cse2) (not (<= 0 (+ .cse0 2147483648 .cse1))) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (< c_~bag2~0 (+ .cse0 1)))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse5)) (.cse7 (select .cse9 .cse4))) (or (<= .cse6 (+ .cse7 c_~bag2~0 c_~sum2~0 .cse8)) (not (<= 0 (+ .cse7 2147483648 .cse8))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (< c_~bag2~0 (+ .cse7 1))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse4)) (.cse13 (select .cse14 .cse5))) (or (<= .cse6 (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13)) (not (<= (+ .cse12 .cse13) 2147483647)) (not (<= 0 (+ .cse12 2147483648 .cse13))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse13))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse13))))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse4)) (.cse16 (select .cse17 .cse5))) (or (< (+ .cse15 c_~bag2~0 c_~sum2~0 .cse16) .cse2) (not (<= (+ .cse15 .cse16) 2147483647)) (not (<= 0 (+ .cse15 2147483648 .cse16))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse16) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse16))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse16)))))))) .cse10 .cse11))) (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse4)) (.cse19 (select .cse20 .cse5))) (or (<= .cse6 (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19)) (not (<= (+ .cse18 c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ .cse18 c_~bag2~0 2147483648 .cse19))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse19))))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse4)) (.cse22 (select .cse23 .cse5))) (or (< (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22) .cse2) (not (<= (+ .cse21 c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ .cse21 c_~bag2~0 2147483648 .cse22))) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse22)))))))) .cse10 .cse11))))) is different from false [2022-11-20 21:11:26,928 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse24 (* c_~j~0 4)) (.cse25 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse10 (not (< (+ c_~j~0 1) c_~N~0))) (.cse8 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse25 |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (.cse2 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse25 |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse4 (+ c_~A~0.offset .cse24)) (.cse5 (+ c_~A~0.offset .cse24 4)) (.cse11 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ .cse0 2147483648 .cse1))) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (< c_~bag2~0 (+ .cse0 1)) (<= .cse2 (+ .cse0 c_~bag2~0 c_~sum2~0 .cse1)))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse6 (select .cse9 .cse5)) (.cse7 (select .cse9 .cse4))) (or (not (<= 0 (+ .cse6 2147483648 .cse7))) (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (< c_~bag2~0 (+ .cse6 1)) (< (+ .cse6 c_~bag2~0 c_~sum2~0 .cse7) .cse8)))))) .cse10 .cse11) (or .cse10 (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse4))) (or (not (<= (+ .cse12 .cse13) 2147483647)) (not (<= 0 (+ .cse12 2147483648 .cse13))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse13))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse13))) (<= .cse2 (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13)))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse5)) (.cse16 (select .cse17 .cse4))) (or (not (<= (+ .cse15 .cse16) 2147483647)) (not (<= 0 (+ .cse15 2147483648 .cse16))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse16) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse16))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse16))) (< (+ .cse15 c_~bag2~0 c_~sum2~0 .cse16) .cse8)))))) .cse11))) (or .cse10 (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse5)) (.cse19 (select .cse20 .cse4))) (or (not (<= (+ .cse18 c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ .cse18 c_~bag2~0 2147483648 .cse19))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse19))) (< (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19) .cse8))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse5)) (.cse22 (select .cse23 .cse4))) (or (not (<= (+ .cse21 c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ .cse21 c_~bag2~0 2147483648 .cse22))) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse22))) (<= .cse2 (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22))))))) .cse11)))) (< (+ c_~i~0 1) c_~N~0)) is different from false [2022-11-20 21:11:27,850 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-20 21:11:27,851 INFO L350 Elim1Store]: Elim1 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 1759 treesize of output 1218 [2022-11-20 21:11:27,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:11:27,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1165 treesize of output 1102 [2022-11-20 21:11:27,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:11:27,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1102 treesize of output 1039 [2022-11-20 21:11:27,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:11:27,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1039 treesize of output 1000 [2022-11-20 21:11:28,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:11:28,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1000 treesize of output 961 [2022-11-20 21:11:28,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:11:28,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 961 treesize of output 910 [2022-11-20 21:11:28,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:11:28,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 910 treesize of output 859 [2022-11-20 21:11:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 21:11:30,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282470127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:11:30,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1720732395] [2022-11-20 21:11:30,532 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-20 21:11:30,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:11:30,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-11-20 21:11:30,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657617238] [2022-11-20 21:11:30,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:11:30,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 21:11:30,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:30,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 21:11:30,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1236, Unknown=9, NotChecked=146, Total=1560 [2022-11-20 21:11:30,535 INFO L87 Difference]: Start difference. First operand 368 states and 1145 transitions. Second operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 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-20 21:11:44,486 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 174 DAG size of output: 172 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:12:00,856 WARN L837 $PredicateComparison]: unable to prove that (and (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 2 c_~N~0) (or (< c_~i~0 c_~N~0) (let ((.cse24 (* c_~j~0 4))) (let ((.cse6 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~bag1~0 c_~sum1~0 1)) (.cse5 (+ c_~A~0.offset .cse24)) (.cse4 (+ c_~A~0.offset .cse24 4)) (.cse10 (not (< (+ c_~j~0 1) c_~N~0))) (.cse11 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (< (+ .cse0 c_~bag2~0 c_~sum2~0 .cse1) .cse2) (not (<= 0 (+ .cse0 2147483648 .cse1))) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (< c_~bag2~0 (+ .cse0 1)))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse5)) (.cse7 (select .cse9 .cse4))) (or (<= .cse6 (+ .cse7 c_~bag2~0 c_~sum2~0 .cse8)) (not (<= 0 (+ .cse7 2147483648 .cse8))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (< c_~bag2~0 (+ .cse7 1))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse4)) (.cse13 (select .cse14 .cse5))) (or (<= .cse6 (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13)) (not (<= (+ .cse12 .cse13) 2147483647)) (not (<= 0 (+ .cse12 2147483648 .cse13))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse13))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse13))))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse4)) (.cse16 (select .cse17 .cse5))) (or (< (+ .cse15 c_~bag2~0 c_~sum2~0 .cse16) .cse2) (not (<= (+ .cse15 .cse16) 2147483647)) (not (<= 0 (+ .cse15 2147483648 .cse16))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse16) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse16))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse16)))))))) .cse10 .cse11))) (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse4)) (.cse19 (select .cse20 .cse5))) (or (<= .cse6 (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19)) (not (<= (+ .cse18 c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ .cse18 c_~bag2~0 2147483648 .cse19))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse19))))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse4)) (.cse22 (select .cse23 .cse5))) (or (< (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22) .cse2) (not (<= (+ .cse21 c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ .cse21 c_~bag2~0 2147483648 .cse22))) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse22)))))))) .cse10 .cse11))))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) is different from false [2022-11-20 21:12:10,748 WARN L837 $PredicateComparison]: unable to prove that (and (<= 2 c_~N~0) (or (< c_~i~0 c_~N~0) (let ((.cse24 (* c_~j~0 4))) (let ((.cse6 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~bag1~0 c_~sum1~0 1)) (.cse5 (+ c_~A~0.offset .cse24)) (.cse4 (+ c_~A~0.offset .cse24 4)) (.cse10 (not (< (+ c_~j~0 1) c_~N~0))) (.cse11 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (< (+ .cse0 c_~bag2~0 c_~sum2~0 .cse1) .cse2) (not (<= 0 (+ .cse0 2147483648 .cse1))) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (< c_~bag2~0 (+ .cse0 1)))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse5)) (.cse7 (select .cse9 .cse4))) (or (<= .cse6 (+ .cse7 c_~bag2~0 c_~sum2~0 .cse8)) (not (<= 0 (+ .cse7 2147483648 .cse8))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (< c_~bag2~0 (+ .cse7 1))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse4)) (.cse13 (select .cse14 .cse5))) (or (<= .cse6 (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13)) (not (<= (+ .cse12 .cse13) 2147483647)) (not (<= 0 (+ .cse12 2147483648 .cse13))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse13))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse13))))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse4)) (.cse16 (select .cse17 .cse5))) (or (< (+ .cse15 c_~bag2~0 c_~sum2~0 .cse16) .cse2) (not (<= (+ .cse15 .cse16) 2147483647)) (not (<= 0 (+ .cse15 2147483648 .cse16))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse16) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse16))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse16)))))))) .cse10 .cse11))) (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse4)) (.cse19 (select .cse20 .cse5))) (or (<= .cse6 (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19)) (not (<= (+ .cse18 c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ .cse18 c_~bag2~0 2147483648 .cse19))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse19))))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse4)) (.cse22 (select .cse23 .cse5))) (or (< (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22) .cse2) (not (<= (+ .cse21 c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ .cse21 c_~bag2~0 2147483648 .cse22))) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse22)))))))) .cse10 .cse11))))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|)) is different from false [2022-11-20 21:12:11,439 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse0 (+ c_~bag2~0 c_~sum2~0))) (and (<= .cse0 .cse1) (let ((.cse2 (= 2 c_~j~0)) (.cse3 (<= c_~i~0 2)) (.cse4 (and (= c_~bag1~0 c_~sum1~0) (<= c_~i~0 1))) (.cse5 (<= c_~i~0 0))) (or (and .cse2 (<= 0 (+ c_~bag2~0 c_~sum1~0 2147483648)) (or (and (= c_~bag2~0 c_~bag1~0) .cse3) .cse4 .cse5) (<= (+ c_~bag2~0 c_~sum1~0) 2147483647) (= c_~sum1~0 c_~sum2~0)) (and .cse2 (<= c_~bag2~0 2147483647) (<= 0 (+ c_~bag2~0 2147483648)) (= c_~sum2~0 0) (or (and (= c_~bag2~0 .cse1) .cse3) .cse4 .cse5)))) (<= c_~sum1~0 2147483647) (<= 2 c_~N~0) (or (let ((.cse30 (* c_~j~0 4)) (.cse31 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse16 (not (< (+ c_~j~0 1) c_~N~0))) (.cse14 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse31 |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (.cse8 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse31 |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse10 (+ c_~A~0.offset .cse30)) (.cse11 (+ c_~A~0.offset .cse30 4)) (.cse17 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= .cse0 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse6 (select .cse9 .cse11)) (.cse7 (select .cse9 .cse10))) (or (not (<= 0 (+ .cse6 2147483648 .cse7))) (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (< c_~bag2~0 (+ .cse6 1)) (<= .cse8 (+ .cse6 c_~bag2~0 c_~sum2~0 .cse7)))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse12 (select .cse15 .cse11)) (.cse13 (select .cse15 .cse10))) (or (not (<= 0 (+ .cse12 2147483648 .cse13))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (< c_~bag2~0 (+ .cse12 1)) (< (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13) .cse14)))))) .cse16 .cse17) (or .cse16 (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse11)) (.cse19 (select .cse20 .cse10))) (or (not (<= (+ .cse18 .cse19) 2147483647)) (not (<= 0 (+ .cse18 2147483648 .cse19))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse19))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse19))) (<= .cse8 (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19)))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse11)) (.cse22 (select .cse23 .cse10))) (or (not (<= (+ .cse21 .cse22) 2147483647)) (not (<= 0 (+ .cse21 2147483648 .cse22))) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse22))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse22))) (< (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22) .cse14)))))) .cse17))) (or .cse16 (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse24 (select .cse26 .cse11)) (.cse25 (select .cse26 .cse10))) (or (not (<= (+ .cse24 c_~bag2~0 .cse25) 2147483647)) (not (<= 0 (+ .cse24 c_~bag2~0 2147483648 .cse25))) (not (<= (+ c_~bag2~0 .cse25) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse25))) (< (+ .cse24 c_~bag2~0 c_~sum2~0 .cse25) .cse14))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse27 (select .cse29 .cse11)) (.cse28 (select .cse29 .cse10))) (or (not (<= (+ .cse27 c_~bag2~0 .cse28) 2147483647)) (not (<= 0 (+ .cse27 c_~bag2~0 2147483648 .cse28))) (not (<= (+ c_~bag2~0 .cse28) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse28))) (<= .cse8 (+ .cse27 c_~bag2~0 c_~sum2~0 .cse28))))))) .cse17)))) (< (+ c_~i~0 1) c_~N~0)) (<= 0 (+ c_~sum1~0 2147483648)) (<= .cse1 .cse0))) is different from false [2022-11-20 21:12:27,272 WARN L233 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 143 DAG size of output: 141 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:12:51,730 WARN L837 $PredicateComparison]: unable to prove that (and (or (< c_~i~0 c_~N~0) (let ((.cse24 (* c_~j~0 4))) (let ((.cse6 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~bag1~0 c_~sum1~0 1)) (.cse5 (+ c_~A~0.offset .cse24)) (.cse4 (+ c_~A~0.offset .cse24 4)) (.cse10 (not (< (+ c_~j~0 1) c_~N~0))) (.cse11 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (< (+ .cse0 c_~bag2~0 c_~sum2~0 .cse1) .cse2) (not (<= 0 (+ .cse0 2147483648 .cse1))) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (< c_~bag2~0 (+ .cse0 1)))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse5)) (.cse7 (select .cse9 .cse4))) (or (<= .cse6 (+ .cse7 c_~bag2~0 c_~sum2~0 .cse8)) (not (<= 0 (+ .cse7 2147483648 .cse8))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (< c_~bag2~0 (+ .cse7 1))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse4)) (.cse13 (select .cse14 .cse5))) (or (<= .cse6 (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13)) (not (<= (+ .cse12 .cse13) 2147483647)) (not (<= 0 (+ .cse12 2147483648 .cse13))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse13))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse13))))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse4)) (.cse16 (select .cse17 .cse5))) (or (< (+ .cse15 c_~bag2~0 c_~sum2~0 .cse16) .cse2) (not (<= (+ .cse15 .cse16) 2147483647)) (not (<= 0 (+ .cse15 2147483648 .cse16))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse16) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse16))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse16)))))))) .cse10 .cse11))) (or (and (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse4)) (.cse19 (select .cse20 .cse5))) (or (<= .cse6 (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19)) (not (<= (+ .cse18 c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ .cse18 c_~bag2~0 2147483648 .cse19))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse19))))))) (forall ((v_ArrVal_843 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse4)) (.cse22 (select .cse23 .cse5))) (or (< (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22) .cse2) (not (<= (+ .cse21 c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ .cse21 c_~bag2~0 2147483648 .cse22))) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse22)))))))) .cse10 .cse11))))) (or (< 2 c_~N~0) (not (< 1 c_~N~0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-20 21:12:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:52,892 INFO L93 Difference]: Finished difference Result 1574 states and 4771 transitions. [2022-11-20 21:12:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-11-20 21:12:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:12:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:52,899 INFO L225 Difference]: With dead ends: 1574 [2022-11-20 21:12:52,899 INFO L226 Difference]: Without dead ends: 1547 [2022-11-20 21:12:52,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 195 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 15107 ImplicationChecksByTransitivity, 80.5s TimeCoverageRelationStatistics Valid=5722, Invalid=30517, Unknown=75, NotChecked=2298, Total=38612 [2022-11-20 21:12:52,904 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1281 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2062 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:52,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 0 Invalid, 4884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 2469 Invalid, 0 Unknown, 2062 Unchecked, 4.6s Time] [2022-11-20 21:12:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-11-20 21:12:52,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 489. [2022-11-20 21:12:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 3.3237704918032787) internal successors, (1622), 488 states have internal predecessors, (1622), 0 states have call successors, (0), 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-20 21:12:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1622 transitions. [2022-11-20 21:12:52,935 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1622 transitions. Word has length 20 [2022-11-20 21:12:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:52,935 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 1622 transitions. [2022-11-20 21:12:52,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 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-20 21:12:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1622 transitions. [2022-11-20 21:12:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:12:52,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:52,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:52,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-20 21:12:53,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:12:53,145 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:12:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:53,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1647387894, now seen corresponding path program 20 times [2022-11-20 21:12:53,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:53,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900481268] [2022-11-20 21:12:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:12:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:57,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:12:57,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900481268] [2022-11-20 21:12:57,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900481268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:12:57,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142074953] [2022-11-20 21:12:57,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:12:57,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:12:57,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:12:57,058 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:12:57,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 21:12:57,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 21:12:57,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:12:57,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-20 21:12:57,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:12:57,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:12:57,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:12:58,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:12:58,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-11-20 21:12:58,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:12:58,708 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 257 treesize of output 177 [2022-11-20 21:12:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:59,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:13:00,980 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~j~0 4))) (let ((.cse3 (+ c_~bag1~0 c_~sum1~0)) (.cse5 (+ c_~A~0.offset .cse22)) (.cse6 (+ c_~A~0.offset .cse22 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0)))) (and (or .cse0 (and (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse2 (select .cse4 .cse6)) (.cse1 (select .cse4 .cse5))) (or (not (<= (+ .cse1 c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ .cse1 c_~bag2~0 .cse2 2147483648))) (<= .cse3 (+ .cse1 c_~bag2~0 .cse2 c_~sum2~0)) (not (<= 0 (+ .cse1 c_~bag2~0 2147483648))) (not (<= (+ .cse1 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse6)) (.cse7 (select .cse9 .cse5))) (or (not (<= (+ .cse7 c_~bag2~0 .cse8) 2147483647)) (<= (+ .cse7 c_~bag2~0 .cse8 c_~sum2~0) .cse3) (not (<= 0 (+ .cse7 c_~bag2~0 .cse8 2147483648))) (not (<= 0 (+ .cse7 c_~bag2~0 2147483648))) (not (<= (+ .cse7 c_~bag2~0) 2147483647)))))))) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse10 (select .cse12 .cse6)) (.cse11 (select .cse12 .cse5))) (or (< c_~bag2~0 (+ .cse10 1)) (not (<= 0 (+ .cse11 .cse10 2147483648))) (<= .cse3 (+ .cse11 c_~bag2~0 .cse10 c_~sum2~0)) (not (<= (+ .cse11 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse6)) (.cse13 (select .cse15 .cse5))) (or (<= (+ .cse13 c_~bag2~0 .cse14 c_~sum2~0) .cse3) (< c_~bag2~0 (+ .cse14 1)) (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= (+ .cse13 c_~bag2~0) 2147483647))))))) .cse0) (or (and (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse6)) (.cse16 (select .cse18 .cse5))) (or (not (<= 0 (+ .cse16 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse16 .cse17) 2147483647)) (not (<= 0 (+ .cse16 .cse17 2147483648))) (<= .cse3 (+ .cse16 c_~bag2~0 .cse17 c_~sum2~0)) (not (<= 0 (+ .cse16 c_~bag2~0 2147483648))) (not (<= (+ .cse16 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse16 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse6)) (.cse19 (select .cse21 .cse5))) (or (<= (+ .cse19 c_~bag2~0 .cse20 c_~sum2~0) .cse3) (not (<= 0 (+ .cse19 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse19 .cse20) 2147483647)) (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= 0 (+ .cse19 c_~bag2~0 2147483648))) (not (<= (+ .cse19 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse19 c_~bag2~0) 2147483647))))))) .cse0)))))) is different from false [2022-11-20 21:13:01,928 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~j~0 4))) (let ((.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse2 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse5 (+ c_~A~0.offset .cse22 4)) (.cse4 (+ c_~A~0.offset .cse22))) (and (or (and (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= (+ .cse0 c_~bag2~0 .cse1) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 .cse1 2147483648))) (<= .cse2 (+ .cse0 c_~bag2~0 .cse1 c_~sum2~0)) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (not (<= (+ .cse0 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse4)) (.cse7 (select .cse8 .cse5))) (or (not (<= (+ .cse6 c_~bag2~0 .cse7) 2147483647)) (not (<= 0 (+ .cse6 c_~bag2~0 .cse7 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (<= (+ .cse6 c_~bag2~0 .cse7 c_~sum2~0) .cse2)))))) .cse9) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse9 (and (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse10 (select .cse12 .cse5)) (.cse11 (select .cse12 .cse4))) (or (< c_~bag2~0 (+ .cse10 1)) (not (<= 0 (+ .cse11 .cse10 2147483648))) (<= .cse2 (+ .cse11 c_~bag2~0 .cse10 c_~sum2~0)) (not (<= (+ .cse11 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse4)) (.cse13 (select .cse15 .cse5))) (or (< c_~bag2~0 (+ .cse13 1)) (not (<= 0 (+ .cse14 .cse13 2147483648))) (not (<= (+ .cse14 c_~bag2~0) 2147483647)) (<= (+ .cse14 c_~bag2~0 .cse13 c_~sum2~0) .cse2))))))) (or .cse9 (and (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse5)) (.cse16 (select .cse18 .cse4))) (or (not (<= 0 (+ .cse16 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse16 .cse17) 2147483647)) (not (<= 0 (+ .cse16 .cse17 2147483648))) (<= .cse2 (+ .cse16 c_~bag2~0 .cse17 c_~sum2~0)) (not (<= 0 (+ .cse16 c_~bag2~0 2147483648))) (not (<= (+ .cse16 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse16 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse4)) (.cse20 (select .cse21 .cse5))) (or (not (<= 0 (+ .cse19 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse19 .cse20) 2147483647)) (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= 0 (+ .cse19 c_~bag2~0 2147483648))) (not (<= (+ .cse19 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse19 c_~bag2~0) 2147483647)) (<= (+ .cse19 c_~bag2~0 .cse20 c_~sum2~0) .cse2)))))))))))) is different from false [2022-11-20 21:13:02,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~j~0 4))) (let ((.cse3 (let ((.cse23 (select |c_#memory_int| c_~A~0.base)) (.cse24 (* c_~i~0 4))) (+ c_~bag1~0 c_~sum1~0 (select .cse23 (+ c_~A~0.offset .cse24 4)) (select .cse23 (+ c_~A~0.offset .cse24))))) (.cse5 (+ c_~A~0.offset .cse22)) (.cse6 (+ c_~A~0.offset .cse22 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0)))) (and (or .cse0 (and (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse2 (select .cse4 .cse6)) (.cse1 (select .cse4 .cse5))) (or (not (<= (+ .cse1 c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ .cse1 c_~bag2~0 .cse2 2147483648))) (not (<= 0 (+ .cse1 c_~bag2~0 2147483648))) (<= (+ .cse1 c_~bag2~0 .cse2 c_~sum2~0) .cse3) (not (<= (+ .cse1 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse5)) (.cse8 (select .cse9 .cse6))) (or (not (<= (+ .cse7 c_~bag2~0 .cse8) 2147483647)) (not (<= 0 (+ .cse7 c_~bag2~0 .cse8 2147483648))) (not (<= 0 (+ .cse7 c_~bag2~0 2147483648))) (not (<= (+ .cse7 c_~bag2~0) 2147483647)) (<= .cse3 (+ .cse7 c_~bag2~0 .cse8 c_~sum2~0)))))))) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse0 (and (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse5)) (.cse10 (select .cse12 .cse6))) (or (< c_~bag2~0 (+ .cse10 1)) (not (<= 0 (+ .cse11 .cse10 2147483648))) (not (<= (+ .cse11 c_~bag2~0) 2147483647)) (<= .cse3 (+ .cse11 c_~bag2~0 .cse10 c_~sum2~0)))))) (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (< c_~bag2~0 (+ .cse13 1)) (not (<= 0 (+ .cse14 .cse13 2147483648))) (<= (+ .cse14 c_~bag2~0 .cse13 c_~sum2~0) .cse3) (not (<= (+ .cse14 c_~bag2~0) 2147483647)))))))) (or (and (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse5)) (.cse17 (select .cse18 .cse6))) (or (not (<= 0 (+ .cse16 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse16 .cse17) 2147483647)) (not (<= 0 (+ .cse16 .cse17 2147483648))) (not (<= 0 (+ .cse16 c_~bag2~0 2147483648))) (not (<= (+ .cse16 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse16 c_~bag2~0) 2147483647)) (<= .cse3 (+ .cse16 c_~bag2~0 .cse17 c_~sum2~0)))))) (forall ((v_ArrVal_881 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse6)) (.cse19 (select .cse21 .cse5))) (or (not (<= 0 (+ .cse19 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse19 .cse20) 2147483647)) (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= 0 (+ .cse19 c_~bag2~0 2147483648))) (<= (+ .cse19 c_~bag2~0 .cse20 c_~sum2~0) .cse3) (not (<= (+ .cse19 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse19 c_~bag2~0) 2147483647))))))) .cse0)))))) is different from false [2022-11-20 21:13:03,333 WARN L837 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse13 (not (< 1 c_~N~0))) (.cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (and (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_880))) (let ((.cse6 (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (select .cse6 .cse1))) (let ((.cse3 (+ .cse4 .cse5))) (or (<= (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse0 .cse1))) .cse3) (not (<= .cse3 2147483647)) (not (<= 0 (+ .cse4 .cse5 2147483648))) (not (<= 0 (+ .cse4 2147483648))) (not (<= .cse4 2147483647)))))))) (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_880))) (let ((.cse12 (select (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (select .cse12 .cse1))) (let ((.cse7 (+ .cse8 .cse9))) (or (not (<= .cse7 2147483647)) (not (<= 0 (+ .cse8 .cse9 2147483648))) (not (<= 0 (+ .cse8 2147483648))) (<= .cse7 (let ((.cse10 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse10 .cse1)))) (not (<= .cse8 2147483647))))))))) .cse13) (or .cse13 (and (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_880))) (let ((.cse18 (select (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse18 .cse1)) (.cse14 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse14 .cse15 2147483648))) (< 0 (+ .cse15 1)) (<= (+ .cse14 .cse15) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse16 .cse1)))) (not (<= .cse14 2147483647))))))) (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_880))) (let ((.cse23 (select (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (select .cse23 .cse1)) (.cse21 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (let ((.cse19 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse19 .cse1))) (+ .cse21 .cse22)) (not (<= 0 (+ .cse21 .cse22 2147483648))) (< 0 (+ .cse22 1)) (not (<= .cse21 2147483647)))))))))))) is different from false [2022-11-20 21:13:03,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:13:03,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 145 [2022-11-20 21:13:03,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:13:03,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 486 treesize of output 418 [2022-11-20 21:13:03,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:13:03,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 409 treesize of output 353 [2022-11-20 21:13:03,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:13:03,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 353 treesize of output 313 [2022-11-20 21:13:03,618 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:13:03,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 1 [2022-11-20 21:13:03,633 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:13:03,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 1 [2022-11-20 21:13:03,644 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:13:03,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 1 [2022-11-20 21:13:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 21:13:03,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142074953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:13:03,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1458072463] [2022-11-20 21:13:03,808 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-20 21:13:03,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:13:03,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-11-20 21:13:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648990842] [2022-11-20 21:13:03,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:13:03,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 21:13:03,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:13:03,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 21:13:03,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1058, Unknown=7, NotChecked=276, Total=1482 [2022-11-20 21:13:03,811 INFO L87 Difference]: Start difference. First operand 489 states and 1622 transitions. Second operand has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 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-20 21:13:11,651 WARN L233 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 138 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:13:19,277 WARN L233 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 149 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:13:50,412 WARN L233 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 172 DAG size of output: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:13:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:13:57,007 INFO L93 Difference]: Finished difference Result 1039 states and 3128 transitions. [2022-11-20 21:13:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-20 21:13:57,007 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:13:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:13:57,012 INFO L225 Difference]: With dead ends: 1039 [2022-11-20 21:13:57,012 INFO L226 Difference]: Without dead ends: 1030 [2022-11-20 21:13:57,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3105 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=1394, Invalid=8899, Unknown=25, NotChecked=812, Total=11130 [2022-11-20 21:13:57,013 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 653 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 989 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:13:57,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 0 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1630 Invalid, 0 Unknown, 989 Unchecked, 3.0s Time] [2022-11-20 21:13:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-11-20 21:13:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 505. [2022-11-20 21:13:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.2976190476190474) internal successors, (1662), 504 states have internal predecessors, (1662), 0 states have call successors, (0), 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-20 21:13:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1662 transitions. [2022-11-20 21:13:57,032 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1662 transitions. Word has length 20 [2022-11-20 21:13:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:13:57,032 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 1662 transitions. [2022-11-20 21:13:57,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 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-20 21:13:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1662 transitions. [2022-11-20 21:13:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:13:57,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:13:57,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:13:57,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-20 21:13:57,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 21:13:57,240 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:13:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:13:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1019222236, now seen corresponding path program 21 times [2022-11-20 21:13:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:13:57,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106910950] [2022-11-20 21:13:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:13:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:13:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:13:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:13:59,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:13:59,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106910950] [2022-11-20 21:13:59,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106910950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:13:59,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644119142] [2022-11-20 21:13:59,893 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:13:59,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:13:59,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:13:59,894 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:13:59,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 21:14:00,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:14:00,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:14:00,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-20 21:14:00,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:14:00,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:14:00,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 21:14:01,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:14:01,540 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 251 treesize of output 171 [2022-11-20 21:14:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:14:01,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:14:04,451 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse23 (* c_~j~0 4))) (let ((.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset .cse23)) (.cse5 (+ c_~A~0.offset .cse23 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (< (+ 2 c_~j~0) c_~N~0))) (and (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse5)) (.cse1 (select .cse2 .cse4))) (or (not (<= (+ .cse0 c_~bag2~0 .cse1) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648 .cse1))) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse1))) (<= (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse2 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse0 c_~bag2~0 c_~sum2~0 .cse1)))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= (+ .cse6 c_~bag2~0 .cse7) 2147483647)) (< (+ .cse6 c_~bag2~0 c_~sum2~0 .cse7) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse8 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648 .cse7))) (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse7)))))))) .cse9 .cse10) (or (and (or .cse9 (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse5)) (.cse11 (select .cse13 .cse4))) (or (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (< c_~bag2~0 (+ .cse12 1)) (<= (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse13 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse12 c_~bag2~0 c_~sum2~0 .cse11)) (not (<= 0 (+ .cse12 2147483648 .cse11))))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse5)) (.cse15 (select .cse16 .cse4))) (or (< (+ .cse14 c_~bag2~0 c_~sum2~0 .cse15) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse16 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (< c_~bag2~0 (+ .cse14 1)) (not (<= 0 (+ .cse14 2147483648 .cse15)))))))) .cse10) (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse5)) (.cse17 (select .cse18 .cse4))) (or (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse17))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse17) 2147483647)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse17))) (<= (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse18 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse19 c_~bag2~0 c_~sum2~0 .cse17)) (not (<= 0 (+ .cse19 2147483648 .cse17))) (not (<= (+ .cse19 .cse17) 2147483647)))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse5)) (.cse21 (select .cse22 .cse4))) (or (< (+ .cse20 c_~bag2~0 c_~sum2~0 .cse21) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse22 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse21))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse21) 2147483647)) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse21))) (not (<= 0 (+ .cse20 2147483648 .cse21))) (not (<= (+ .cse20 .cse21) 2147483647))))))) .cse9 .cse10)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))))))) (< (+ c_~i~0 1) c_~N~0)) is different from false [2022-11-20 21:14:04,729 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~i~0 c_~N~0)) (let ((.cse23 (* c_~j~0 4))) (let ((.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset .cse23)) (.cse6 (+ c_~A~0.offset .cse23 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse0 (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse6)) (.cse2 (select .cse3 .cse5))) (or (not (<= (+ .cse1 c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ .cse1 c_~bag2~0 2147483648 .cse2))) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse3 .cse4)) (+ .cse1 c_~bag2~0 c_~sum2~0 .cse2)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse2))))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse6)) (.cse8 (select .cse9 .cse5))) (or (not (<= (+ .cse7 c_~bag2~0 .cse8) 2147483647)) (not (<= 0 (+ .cse7 c_~bag2~0 2147483648 .cse8))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse8))) (< (+ .cse7 c_~bag2~0 c_~sum2~0 .cse8) (+ c_~bag1~0 c_~sum1~0 (select .cse9 .cse4) 1))))))) .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse6)) (.cse11 (select .cse13 .cse5))) (or (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse11))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse11) 2147483647)) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse11))) (< (+ .cse12 c_~bag2~0 c_~sum2~0 .cse11) (+ c_~bag1~0 c_~sum1~0 (select .cse13 .cse4) 1)) (not (<= 0 (+ .cse12 2147483648 .cse11))) (not (<= (+ .cse12 .cse11) 2147483647)))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse16 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse14))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse14) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse15 .cse4)) (+ .cse16 c_~bag2~0 c_~sum2~0 .cse14)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse14))) (not (<= 0 (+ .cse16 2147483648 .cse14))) (not (<= (+ .cse16 .cse14) 2147483647))))))) .cse0 .cse10) (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse18 (select .cse17 .cse6)) (.cse19 (select .cse17 .cse5))) (or (<= (+ c_~bag1~0 c_~sum1~0 (select .cse17 .cse4)) (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (< c_~bag2~0 (+ .cse18 1)) (not (<= 0 (+ .cse18 2147483648 .cse19))))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse6)) (.cse20 (select .cse22 .cse5))) (or (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (< c_~bag2~0 (+ .cse21 1)) (< (+ .cse21 c_~bag2~0 c_~sum2~0 .cse20) (+ c_~bag1~0 c_~sum1~0 (select .cse22 .cse4) 1)) (not (<= 0 (+ .cse21 2147483648 .cse20)))))))) .cse0 .cse10)))))) (< (+ c_~i~0 1) c_~N~0)) is different from false [2022-11-20 21:14:04,883 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:14:04,883 INFO L350 Elim1Store]: Elim1 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 219 treesize of output 151 [2022-11-20 21:14:04,910 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-11-20 21:14:04,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 75 [2022-11-20 21:14:04,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:14:05,021 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:14:05,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 99 treesize of output 39 [2022-11-20 21:14:05,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:14:05,047 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-20 21:14:05,048 INFO L350 Elim1Store]: Elim1 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 154 treesize of output 1 [2022-11-20 21:14:05,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:14:05,064 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-20 21:14:05,065 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 1 [2022-11-20 21:14:05,118 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:14:05,118 INFO L350 Elim1Store]: Elim1 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 280 treesize of output 196 [2022-11-20 21:14:05,145 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-11-20 21:14:05,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 117 [2022-11-20 21:14:05,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:14:05,238 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:14:05,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 124 treesize of output 48 [2022-11-20 21:14:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:14:05,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644119142] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:14:05,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1457441694] [2022-11-20 21:14:05,813 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-20 21:14:05,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:14:05,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-11-20 21:14:05,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198478719] [2022-11-20 21:14:05,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:14:05,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 21:14:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:14:05,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 21:14:05,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1194, Unknown=2, NotChecked=146, Total=1560 [2022-11-20 21:14:05,816 INFO L87 Difference]: Start difference. First operand 505 states and 1662 transitions. Second operand has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 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-20 21:14:22,255 WARN L837 $PredicateComparison]: unable to prove that (and (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (< c_~i~0 c_~N~0)) (let ((.cse23 (* c_~j~0 4))) (let ((.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset .cse23)) (.cse6 (+ c_~A~0.offset .cse23 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse0 (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse6)) (.cse2 (select .cse3 .cse5))) (or (not (<= (+ .cse1 c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ .cse1 c_~bag2~0 2147483648 .cse2))) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse3 .cse4)) (+ .cse1 c_~bag2~0 c_~sum2~0 .cse2)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse2))))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse6)) (.cse8 (select .cse9 .cse5))) (or (not (<= (+ .cse7 c_~bag2~0 .cse8) 2147483647)) (not (<= 0 (+ .cse7 c_~bag2~0 2147483648 .cse8))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse8))) (< (+ .cse7 c_~bag2~0 c_~sum2~0 .cse8) (+ c_~bag1~0 c_~sum1~0 (select .cse9 .cse4) 1))))))) .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse6)) (.cse11 (select .cse13 .cse5))) (or (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse11))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse11) 2147483647)) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse11))) (< (+ .cse12 c_~bag2~0 c_~sum2~0 .cse11) (+ c_~bag1~0 c_~sum1~0 (select .cse13 .cse4) 1)) (not (<= 0 (+ .cse12 2147483648 .cse11))) (not (<= (+ .cse12 .cse11) 2147483647)))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse16 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse14))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse14) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse15 .cse4)) (+ .cse16 c_~bag2~0 c_~sum2~0 .cse14)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse14))) (not (<= 0 (+ .cse16 2147483648 .cse14))) (not (<= (+ .cse16 .cse14) 2147483647))))))) .cse0 .cse10) (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse18 (select .cse17 .cse6)) (.cse19 (select .cse17 .cse5))) (or (<= (+ c_~bag1~0 c_~sum1~0 (select .cse17 .cse4)) (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (< c_~bag2~0 (+ .cse18 1)) (not (<= 0 (+ .cse18 2147483648 .cse19))))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse6)) (.cse20 (select .cse22 .cse5))) (or (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (< c_~bag2~0 (+ .cse21 1)) (< (+ .cse21 c_~bag2~0 c_~sum2~0 .cse20) (+ c_~bag1~0 c_~sum1~0 (select .cse22 .cse4) 1)) (not (<= 0 (+ .cse21 2147483648 .cse20)))))))) .cse0 .cse10)))))) (< (+ c_~i~0 1) c_~N~0)) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) is different from false [2022-11-20 21:14:29,955 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse33 (* c_~j~0 4))) (let ((.cse10 (+ c_~A~0.offset .cse33)) (.cse1 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse2 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse5 (< (+ c_~j~0 1) c_~N~0))) (and (or (< c_~i~0 c_~N~0) (let ((.cse9 (select (select |c_#memory_int| c_~A~0.base) .cse10))) (let ((.cse7 (+ c_~bag2~0 .cse9))) (let ((.cse0 (not (<= .cse7 2147483647))) (.cse3 (not (<= 0 (+ c_~bag2~0 .cse9 2147483648)))) (.cse4 (not (< c_~j~0 c_~N~0))) (.cse6 (let ((.cse8 (+ c_~bag2~0 .cse9 c_~sum2~0))) (and (< .cse8 (+ c_~bag1~0 c_~sum1~0 1)) (<= (+ c_~bag1~0 c_~sum1~0) .cse8))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse3 .cse4 (not (< .cse7 c_~cap2~0)) .cse5 .cse6)))))) (or (let ((.cse14 (+ c_~A~0.offset (* c_~i~0 4))) (.cse15 (+ c_~A~0.offset .cse33 4)) (.cse19 (not .cse5)) (.cse20 (< (+ 2 c_~j~0) c_~N~0))) (and (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse15)) (.cse12 (select .cse13 .cse10))) (or (not (<= (+ .cse11 c_~bag2~0 .cse12) 2147483647)) (not (<= 0 (+ .cse11 c_~bag2~0 2147483648 .cse12))) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse12))) (<= (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse13 .cse14) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse11 c_~bag2~0 c_~sum2~0 .cse12)))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse15)) (.cse17 (select .cse18 .cse10))) (or (not (<= (+ .cse16 c_~bag2~0 .cse17) 2147483647)) (< (+ .cse16 c_~bag2~0 c_~sum2~0 .cse17) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse18 .cse14) |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= 0 (+ .cse16 c_~bag2~0 2147483648 .cse17))) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse17)))))))) .cse19 .cse20) (or (and (or .cse19 (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse15)) (.cse21 (select .cse23 .cse10))) (or (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (< c_~bag2~0 (+ .cse22 1)) (<= (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse23 .cse14) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse22 c_~bag2~0 c_~sum2~0 .cse21)) (not (<= 0 (+ .cse22 2147483648 .cse21))))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse24 (select .cse26 .cse15)) (.cse25 (select .cse26 .cse10))) (or (< (+ .cse24 c_~bag2~0 c_~sum2~0 .cse25) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse26 .cse14) |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= (+ c_~bag2~0 .cse25) 2147483647)) (< c_~bag2~0 (+ .cse24 1)) (not (<= 0 (+ .cse24 2147483648 .cse25)))))))) .cse20) (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse29 (select .cse28 .cse15)) (.cse27 (select .cse28 .cse10))) (or (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse27))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse27) 2147483647)) (not (<= (+ c_~bag2~0 .cse27) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse27))) (<= (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse28 .cse14) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse29 c_~bag2~0 c_~sum2~0 .cse27)) (not (<= 0 (+ .cse29 2147483648 .cse27))) (not (<= (+ .cse29 .cse27) 2147483647)))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse30 (select .cse32 .cse15)) (.cse31 (select .cse32 .cse10))) (or (< (+ .cse30 c_~bag2~0 c_~sum2~0 .cse31) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse32 .cse14) |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse31))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse31) 2147483647)) (not (<= (+ c_~bag2~0 .cse31) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse31))) (not (<= 0 (+ .cse30 2147483648 .cse31))) (not (<= (+ .cse30 .cse31) 2147483647))))))) .cse19 .cse20)) .cse1 .cse2))) (< (+ c_~i~0 1) c_~N~0))))) is different from false [2022-11-20 21:15:01,138 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse34 (* c_~j~0 4))) (let ((.cse0 (< c_~i~0 c_~N~0)) (.cse2 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse3 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse11 (+ c_~A~0.offset .cse34)) (.cse6 (< (+ c_~j~0 1) c_~N~0))) (and (or .cse0 (let ((.cse10 (select (select |c_#memory_int| c_~A~0.base) .cse11))) (let ((.cse8 (+ c_~bag2~0 .cse10))) (let ((.cse1 (not (<= .cse8 2147483647))) (.cse4 (not (<= 0 (+ c_~bag2~0 .cse10 2147483648)))) (.cse5 (not (< c_~j~0 c_~N~0))) (.cse7 (let ((.cse9 (+ c_~bag2~0 .cse10 c_~sum2~0))) (and (< .cse9 (+ c_~bag1~0 c_~sum1~0 1)) (<= (+ c_~bag1~0 c_~sum1~0) .cse9))))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse1 .cse4 .cse5 (not (< .cse8 c_~cap2~0)) .cse6 .cse7)))))) (or (not .cse0) (let ((.cse16 (+ c_~A~0.offset (* c_~i~0 4))) (.cse17 (+ c_~A~0.offset .cse34 4)) (.cse12 (not .cse6)) (.cse21 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse12 (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse17)) (.cse14 (select .cse15 .cse11))) (or (not (<= (+ .cse13 c_~bag2~0 .cse14) 2147483647)) (not (<= 0 (+ .cse13 c_~bag2~0 2147483648 .cse14))) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse15 .cse16)) (+ .cse13 c_~bag2~0 c_~sum2~0 .cse14)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse14))))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse17)) (.cse19 (select .cse20 .cse11))) (or (not (<= (+ .cse18 c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ .cse18 c_~bag2~0 2147483648 .cse19))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse19))) (< (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19) (+ c_~bag1~0 c_~sum1~0 (select .cse20 .cse16) 1))))))) .cse21) (or .cse2 .cse3 (and (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse17)) (.cse22 (select .cse24 .cse11))) (or (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse22))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse22) 2147483647)) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse22))) (< (+ .cse23 c_~bag2~0 c_~sum2~0 .cse22) (+ c_~bag1~0 c_~sum1~0 (select .cse24 .cse16) 1)) (not (<= 0 (+ .cse23 2147483648 .cse22))) (not (<= (+ .cse23 .cse22) 2147483647)))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse27 (select .cse26 .cse17)) (.cse25 (select .cse26 .cse11))) (or (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse25))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse25) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse26 .cse16)) (+ .cse27 c_~bag2~0 c_~sum2~0 .cse25)) (not (<= (+ c_~bag2~0 .cse25) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse25))) (not (<= 0 (+ .cse27 2147483648 .cse25))) (not (<= (+ .cse27 .cse25) 2147483647))))))) .cse12 .cse21) (or (and (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse29 (select .cse28 .cse17)) (.cse30 (select .cse28 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 (select .cse28 .cse16)) (+ .cse29 c_~bag2~0 c_~sum2~0 .cse30)) (not (<= (+ c_~bag2~0 .cse30) 2147483647)) (< c_~bag2~0 (+ .cse29 1)) (not (<= 0 (+ .cse29 2147483648 .cse30))))))) (forall ((v_ArrVal_916 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_916) c_~A~0.base))) (let ((.cse32 (select .cse33 .cse17)) (.cse31 (select .cse33 .cse11))) (or (not (<= (+ c_~bag2~0 .cse31) 2147483647)) (< c_~bag2~0 (+ .cse32 1)) (< (+ .cse32 c_~bag2~0 c_~sum2~0 .cse31) (+ c_~bag1~0 c_~sum1~0 (select .cse33 .cse16) 1)) (not (<= 0 (+ .cse32 2147483648 .cse31)))))))) .cse12 .cse21))))) (< (+ c_~i~0 1) c_~N~0))))) is different from false [2022-11-20 21:15:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:15:04,448 INFO L93 Difference]: Finished difference Result 1812 states and 5311 transitions. [2022-11-20 21:15:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-20 21:15:04,452 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:15:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:15:04,462 INFO L225 Difference]: With dead ends: 1812 [2022-11-20 21:15:04,462 INFO L226 Difference]: Without dead ends: 1789 [2022-11-20 21:15:04,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 186 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12920 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=4722, Invalid=28570, Unknown=34, NotChecked=1830, Total=35156 [2022-11-20 21:15:04,465 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 664 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-20 21:15:04,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 0 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1987 Invalid, 0 Unknown, 664 Unchecked, 3.7s Time] [2022-11-20 21:15:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-11-20 21:15:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 554. [2022-11-20 21:15:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 3.2857142857142856) internal successors, (1817), 553 states have internal predecessors, (1817), 0 states have call successors, (0), 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-20 21:15:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1817 transitions. [2022-11-20 21:15:04,500 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1817 transitions. Word has length 20 [2022-11-20 21:15:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:15:04,501 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 1817 transitions. [2022-11-20 21:15:04,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 0 states have call successors, (0), 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-20 21:15:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1817 transitions. [2022-11-20 21:15:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:15:04,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:15:04,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:15:04,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 21:15:04,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 21:15:04,711 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:15:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:15:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash 299314074, now seen corresponding path program 22 times [2022-11-20 21:15:04,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:15:04,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793483501] [2022-11-20 21:15:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:15:04,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:15:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:15:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:15:07,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:15:07,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793483501] [2022-11-20 21:15:07,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793483501] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:15:07,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767645860] [2022-11-20 21:15:07,872 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:15:07,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:15:07,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:15:07,873 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:15:07,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 21:15:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:15:08,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-20 21:15:08,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:15:08,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:15:08,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 21:15:09,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:15:09,325 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 254 treesize of output 192 [2022-11-20 21:15:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:15:10,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:15:12,637 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse23 (* c_~j~0 4))) (let ((.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (< (+ 2 c_~j~0) c_~N~0)) (.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset .cse23)) (.cse6 (+ c_~A~0.offset .cse23 4))) (and (or .cse0 (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse6)) (.cse2 (select .cse3 .cse5))) (or (not (<= (+ c_~bag2~0 .cse1 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse1 .cse2 2147483648))) (<= (+ c_~bag2~0 .cse1 .cse2 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse3 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse6)) (.cse8 (select .cse9 .cse5))) (or (not (<= (+ c_~bag2~0 .cse7 .cse8) 2147483647)) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse9 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse7 .cse8 c_~sum2~0 1)) (not (<= 0 (+ c_~bag2~0 .cse7 .cse8 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse8 2147483648)))))))) .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse0 (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse6)) (.cse11 (select .cse13 .cse5))) (or (not (<= (+ c_~bag2~0 .cse11 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (<= (+ c_~bag2~0 .cse12 .cse11 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse13 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= (+ .cse12 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse11 2147483648))) (not (<= 0 (+ .cse12 .cse11 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse11 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse16 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (not (<= (+ c_~bag2~0 .cse14 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse15 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse16 .cse14 c_~sum2~0 1)) (not (<= (+ .cse16 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse14 2147483648))) (not (<= 0 (+ .cse16 .cse14 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse14 c_~sum2~0 2147483648)))))))) .cse10) (or .cse0 .cse10 (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse6)) (.cse17 (select .cse19 .cse5))) (or (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (<= (+ c_~bag2~0 .cse18 .cse17 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse19 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (< c_~bag2~0 (+ .cse18 1)) (not (<= 0 (+ .cse18 .cse17 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse22 (select .cse21 .cse6)) (.cse20 (select .cse21 .cse5))) (or (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse21 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse22 .cse20 c_~sum2~0 1)) (< c_~bag2~0 (+ .cse22 1)) (not (<= 0 (+ .cse22 .cse20 2147483648)))))))))))))) (< (+ c_~i~0 1) c_~N~0)) is different from false [2022-11-20 21:15:12,942 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse23 (* c_~j~0 4))) (let ((.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (< (+ 2 c_~j~0) c_~N~0)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset .cse23)) (.cse5 (+ c_~A~0.offset .cse23 4))) (and (or (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse5)) (.cse1 (select .cse2 .cse4))) (or (not (<= (+ c_~bag2~0 .cse0 .cse1) 2147483647)) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 .cse1 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse1 2147483648))) (<= (+ c_~bag2~0 .cse0 .cse1 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse2 .cse3))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= (+ c_~bag2~0 .cse6 .cse7) 2147483647)) (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse6 .cse7 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse8 .cse3)) (+ c_~bag2~0 .cse6 .cse7 c_~sum2~0 1)) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648)))))))) .cse9 .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse13 (select .cse12 .cse5)) (.cse11 (select .cse12 .cse4))) (or (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (< (+ c_~bag1~0 c_~sum1~0 (select .cse12 .cse3)) (+ c_~bag2~0 .cse13 .cse11 c_~sum2~0 1)) (< c_~bag2~0 (+ .cse13 1)) (not (<= 0 (+ .cse13 .cse11 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse5)) (.cse14 (select .cse16 .cse4))) (or (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (< c_~bag2~0 (+ .cse15 1)) (not (<= 0 (+ .cse15 .cse14 2147483648))) (<= (+ c_~bag2~0 .cse15 .cse14 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse16 .cse3)))))))) .cse9 .cse10) (or .cse9 .cse10 (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse5)) (.cse17 (select .cse19 .cse4))) (or (not (<= (+ c_~bag2~0 .cse17 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= (+ .cse18 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (not (<= 0 (+ .cse18 .cse17 2147483648))) (<= (+ c_~bag2~0 .cse18 .cse17 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse19 .cse3))) (not (<= 0 (+ c_~bag2~0 .cse17 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse4))) (or (not (<= (+ c_~bag2~0 .cse20 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (not (<= (+ .cse21 .cse20) 2147483647)) (< (+ c_~bag1~0 c_~sum1~0 (select .cse22 .cse3)) (+ c_~bag2~0 .cse21 .cse20 c_~sum2~0 1)) (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= 0 (+ .cse21 .cse20 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse20 c_~sum2~0 2147483648)))))))))))))) (< (+ c_~i~0 1) c_~N~0)) is different from false [2022-11-20 21:15:13,202 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-20 21:15:13,203 INFO L350 Elim1Store]: Elim1 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 1747 treesize of output 1254 [2022-11-20 21:15:13,284 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-20 21:15:13,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1201 treesize of output 1171 [2022-11-20 21:15:13,354 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-20 21:15:13,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1156 treesize of output 1126 [2022-11-20 21:15:13,427 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-20 21:15:13,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1111 treesize of output 1057 [2022-11-20 21:15:13,503 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-20 21:15:13,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1042 treesize of output 988 [2022-11-20 21:15:13,576 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-20 21:15:13,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 973 treesize of output 931 [2022-11-20 21:15:13,652 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-20 21:15:13,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 916 treesize of output 874 [2022-11-20 21:15:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:15:22,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767645860] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:15:22,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1192472917] [2022-11-20 21:15:22,892 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-20 21:15:22,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:15:22,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-11-20 21:15:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020308309] [2022-11-20 21:15:22,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:15:22,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 21:15:22,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:15:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 21:15:22,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1262, Unknown=2, NotChecked=146, Total=1560 [2022-11-20 21:15:22,896 INFO L87 Difference]: Start difference. First operand 554 states and 1817 transitions. Second operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 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-20 21:15:48,617 WARN L837 $PredicateComparison]: unable to prove that (and (or (let ((.cse23 (* c_~j~0 4))) (let ((.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (< (+ 2 c_~j~0) c_~N~0)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset .cse23)) (.cse5 (+ c_~A~0.offset .cse23 4))) (and (or (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse5)) (.cse1 (select .cse2 .cse4))) (or (not (<= (+ c_~bag2~0 .cse0 .cse1) 2147483647)) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 .cse1 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse1 2147483648))) (<= (+ c_~bag2~0 .cse0 .cse1 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse2 .cse3))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= (+ c_~bag2~0 .cse6 .cse7) 2147483647)) (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse6 .cse7 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse8 .cse3)) (+ c_~bag2~0 .cse6 .cse7 c_~sum2~0 1)) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648)))))))) .cse9 .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse13 (select .cse12 .cse5)) (.cse11 (select .cse12 .cse4))) (or (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (< (+ c_~bag1~0 c_~sum1~0 (select .cse12 .cse3)) (+ c_~bag2~0 .cse13 .cse11 c_~sum2~0 1)) (< c_~bag2~0 (+ .cse13 1)) (not (<= 0 (+ .cse13 .cse11 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse5)) (.cse14 (select .cse16 .cse4))) (or (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (< c_~bag2~0 (+ .cse15 1)) (not (<= 0 (+ .cse15 .cse14 2147483648))) (<= (+ c_~bag2~0 .cse15 .cse14 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse16 .cse3)))))))) .cse9 .cse10) (or .cse9 .cse10 (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse5)) (.cse17 (select .cse19 .cse4))) (or (not (<= (+ c_~bag2~0 .cse17 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= (+ .cse18 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (not (<= 0 (+ .cse18 .cse17 2147483648))) (<= (+ c_~bag2~0 .cse18 .cse17 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse19 .cse3))) (not (<= 0 (+ c_~bag2~0 .cse17 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse4))) (or (not (<= (+ c_~bag2~0 .cse20 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (not (<= (+ .cse21 .cse20) 2147483647)) (< (+ c_~bag1~0 c_~sum1~0 (select .cse22 .cse3)) (+ c_~bag2~0 .cse21 .cse20 c_~sum2~0 1)) (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= 0 (+ .cse21 .cse20 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse20 c_~sum2~0 2147483648)))))))))))))) (< (+ c_~i~0 1) c_~N~0)) (<= 2 c_~N~0) (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~N~0) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|)) is different from false [2022-11-20 21:16:05,789 WARN L233 SmtUtils]: Spent 8.56s on a formula simplification. DAG size of input: 135 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:16:24,823 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse34 (* c_~j~0 4))) (let ((.cse0 (+ c_~bag1~0 c_~sum1~0)) (.cse1 (< c_~i~0 c_~N~0)) (.cse3 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse4 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse11 (+ c_~A~0.offset .cse34)) (.cse8 (< (+ c_~j~0 1) c_~N~0))) (and (or (and (< .cse0 (+ c_~sum2~0 1)) (<= c_~sum2~0 .cse0)) .cse1) (or (let ((.cse10 (select (select |c_#memory_int| c_~A~0.base) .cse11))) (let ((.cse9 (+ c_~bag2~0 .cse10))) (let ((.cse2 (not (<= .cse9 2147483647))) (.cse5 (not (<= 0 (+ c_~bag2~0 .cse10 2147483648)))) (.cse6 (not (< c_~j~0 c_~N~0))) (.cse7 (and (< .cse0 (+ c_~bag2~0 .cse10 c_~sum2~0 1)) (<= (+ c_~bag2~0 .cse10 c_~sum2~0) .cse0)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse2 .cse5 .cse6 (not (< .cse9 c_~cap2~0)) .cse7 .cse8))))) .cse1) (or (let ((.cse12 (not .cse8)) (.cse21 (< (+ 2 c_~j~0) c_~N~0)) (.cse16 (+ c_~A~0.offset (* c_~i~0 4))) (.cse17 (+ c_~A~0.offset .cse34 4))) (and (or .cse12 (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse17)) (.cse14 (select .cse15 .cse11))) (or (not (<= (+ c_~bag2~0 .cse13 .cse14) 2147483647)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse13 .cse14 2147483648))) (<= (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse15 .cse16) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ c_~bag2~0 .cse14 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse17)) (.cse19 (select .cse20 .cse11))) (or (not (<= (+ c_~bag2~0 .cse18 .cse19) 2147483647)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse20 .cse16) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse18 .cse19 c_~sum2~0 1)) (not (<= 0 (+ c_~bag2~0 .cse18 .cse19 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse19 2147483648)))))))) .cse21) (or .cse3 .cse4 (and (or .cse12 (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse17)) (.cse22 (select .cse24 .cse11))) (or (not (<= (+ c_~bag2~0 .cse22 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (<= (+ c_~bag2~0 .cse23 .cse22 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse24 .cse16) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= (+ .cse23 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse22 2147483648))) (not (<= 0 (+ .cse23 .cse22 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse22 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse27 (select .cse26 .cse17)) (.cse25 (select .cse26 .cse11))) (or (not (<= (+ c_~bag2~0 .cse25 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse25) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse26 .cse16) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse27 .cse25 c_~sum2~0 1)) (not (<= (+ .cse27 .cse25) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse25 2147483648))) (not (<= 0 (+ .cse27 .cse25 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse25 c_~sum2~0 2147483648)))))))) .cse21) (or .cse12 .cse21 (and (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse29 (select .cse30 .cse17)) (.cse28 (select .cse30 .cse11))) (or (not (<= (+ c_~bag2~0 .cse28) 2147483647)) (<= (+ c_~bag2~0 .cse29 .cse28 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse30 .cse16) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (< c_~bag2~0 (+ .cse29 1)) (not (<= 0 (+ .cse29 .cse28 2147483648))))))) (forall ((v_ArrVal_951 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_951) c_~A~0.base))) (let ((.cse33 (select .cse32 .cse17)) (.cse31 (select .cse32 .cse11))) (or (not (<= (+ c_~bag2~0 .cse31) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse32 .cse16) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse33 .cse31 c_~sum2~0 1)) (< c_~bag2~0 (+ .cse33 1)) (not (<= 0 (+ .cse33 .cse31 2147483648))))))))))))) (< (+ c_~i~0 1) c_~N~0))))) is different from false [2022-11-20 21:16:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:16:31,703 INFO L93 Difference]: Finished difference Result 1386 states and 4240 transitions. [2022-11-20 21:16:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-11-20 21:16:31,704 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:16:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:16:31,709 INFO L225 Difference]: With dead ends: 1386 [2022-11-20 21:16:31,709 INFO L226 Difference]: Without dead ends: 1376 [2022-11-20 21:16:31,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 15 SyntacticMatches, 13 SemanticMatches, 182 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 11810 ImplicationChecksByTransitivity, 67.4s TimeCoverageRelationStatistics Valid=5372, Invalid=26820, Unknown=44, NotChecked=1436, Total=33672 [2022-11-20 21:16:31,711 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1439 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1312 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:16:31,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 0 Invalid, 4127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 2407 Invalid, 0 Unknown, 1312 Unchecked, 4.6s Time] [2022-11-20 21:16:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2022-11-20 21:16:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 701. [2022-11-20 21:16:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 3.362857142857143) internal successors, (2354), 700 states have internal predecessors, (2354), 0 states have call successors, (0), 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-20 21:16:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 2354 transitions. [2022-11-20 21:16:31,737 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 2354 transitions. Word has length 20 [2022-11-20 21:16:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:16:31,738 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 2354 transitions. [2022-11-20 21:16:31,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 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-20 21:16:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 2354 transitions. [2022-11-20 21:16:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:16:31,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:16:31,740 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:16:31,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-20 21:16:31,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:16:31,951 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:16:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:16:31,951 INFO L85 PathProgramCache]: Analyzing trace with hash 327019704, now seen corresponding path program 23 times [2022-11-20 21:16:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:16:31,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710003971] [2022-11-20 21:16:31,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:16:31,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:16:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:16:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:16:33,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:16:33,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710003971] [2022-11-20 21:16:33,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710003971] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:16:33,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792712499] [2022-11-20 21:16:33,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:16:33,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:16:33,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:16:33,814 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:16:33,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-20 21:16:33,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 21:16:33,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:16:33,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-20 21:16:33,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:16:34,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:16:34,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:16:34,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:16:34,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 21:16:34,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:16:34,968 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 252 treesize of output 172 [2022-11-20 21:16:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:16:35,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:16:37,212 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~j~0 4))) (let ((.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset .cse23)) (.cse4 (+ c_~A~0.offset .cse23 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (< (+ 2 c_~j~0) c_~N~0))) (and (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse5)) (.cse1 (select .cse2 .cse4))) (or (not (<= 0 (+ .cse0 c_~bag2~0 .cse1 2147483648))) (<= (+ (select .cse2 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse0 c_~bag2~0 .cse1 c_~sum2~0)) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= (+ .cse0 c_~bag2~0 .cse1) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= 0 (+ .cse6 c_~bag2~0 .cse7 2147483648))) (< (+ .cse6 c_~bag2~0 .cse7 c_~sum2~0) (+ (select .cse8 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (not (<= (+ .cse6 c_~bag2~0 .cse7) 2147483647))))))) .cse9 .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse4)) (.cse11 (select .cse13 .cse5))) (or (not (<= 0 (+ .cse11 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse11 .cse12) 2147483647)) (not (<= (+ .cse11 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse11 .cse12 2147483648))) (<= (+ (select .cse13 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse11 c_~bag2~0 .cse12 c_~sum2~0)) (not (<= 0 (+ .cse11 c_~bag2~0 2147483648))) (not (<= (+ .cse11 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse4)) (.cse14 (select .cse16 .cse5))) (or (not (<= 0 (+ .cse14 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse14 .cse15) 2147483647)) (not (<= (+ .cse14 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse14 .cse15 2147483648))) (< (+ .cse14 c_~bag2~0 .cse15 c_~sum2~0) (+ (select .cse16 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= 0 (+ .cse14 c_~bag2~0 2147483648))) (not (<= (+ .cse14 c_~bag2~0) 2147483647))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse4)) (.cse17 (select .cse19 .cse5))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (< c_~bag2~0 (+ .cse18 1)) (< (+ .cse17 c_~bag2~0 .cse18 c_~sum2~0) (+ (select .cse19 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= (+ .cse17 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse4)) (.cse20 (select .cse22 .cse5))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (<= (+ (select .cse22 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse20 c_~bag2~0 .cse21 c_~sum2~0)) (< c_~bag2~0 (+ .cse21 1)) (not (<= (+ .cse20 c_~bag2~0) 2147483647))))))) .cse9 .cse10)))))) is different from false [2022-11-20 21:16:37,446 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~j~0 4))) (let ((.cse5 (+ c_~A~0.offset (* c_~i~0 4))) (.cse7 (+ c_~A~0.offset .cse23)) (.cse6 (+ c_~A~0.offset .cse23 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse2 (select .cse4 .cse7)) (.cse3 (select .cse4 .cse6))) (or (not (<= 0 (+ .cse2 c_~bag2~0 .cse3 2147483648))) (<= (+ (select .cse4 .cse5) c_~bag1~0 c_~sum1~0) (+ .cse2 c_~bag2~0 .cse3 c_~sum2~0)) (not (<= 0 (+ .cse2 c_~bag2~0 2147483648))) (not (<= (+ .cse2 c_~bag2~0) 2147483647)) (not (<= (+ .cse2 c_~bag2~0 .cse3) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse7)) (.cse9 (select .cse10 .cse6))) (or (not (<= 0 (+ .cse8 c_~bag2~0 .cse9 2147483648))) (< (+ .cse8 c_~bag2~0 .cse9 c_~sum2~0) (+ (select .cse10 .cse5) c_~bag1~0 c_~sum1~0 1)) (not (<= 0 (+ .cse8 c_~bag2~0 2147483648))) (not (<= (+ .cse8 c_~bag2~0) 2147483647)) (not (<= (+ .cse8 c_~bag2~0 .cse9) 2147483647)))))))) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse0 (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse6)) (.cse11 (select .cse13 .cse7))) (or (not (<= 0 (+ .cse11 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse11 .cse12) 2147483647)) (< (+ .cse11 c_~bag2~0 .cse12 c_~sum2~0) (+ (select .cse13 .cse5) c_~bag1~0 c_~sum1~0 1)) (not (<= (+ .cse11 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse11 .cse12 2147483648))) (not (<= 0 (+ .cse11 c_~bag2~0 2147483648))) (not (<= (+ .cse11 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse6)) (.cse14 (select .cse16 .cse7))) (or (not (<= 0 (+ .cse14 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse14 .cse15) 2147483647)) (not (<= (+ .cse14 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse14 .cse15 2147483648))) (<= (+ (select .cse16 .cse5) c_~bag1~0 c_~sum1~0) (+ .cse14 c_~bag2~0 .cse15 c_~sum2~0)) (not (<= 0 (+ .cse14 c_~bag2~0 2147483648))) (not (<= (+ .cse14 c_~bag2~0) 2147483647))))))) .cse1) (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse6)) (.cse17 (select .cse19 .cse7))) (or (< (+ .cse17 c_~bag2~0 .cse18 c_~sum2~0) (+ (select .cse19 .cse5) c_~bag1~0 c_~sum1~0 1)) (not (<= 0 (+ .cse17 .cse18 2147483648))) (< c_~bag2~0 (+ .cse18 1)) (not (<= (+ .cse17 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse6)) (.cse20 (select .cse22 .cse7))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (< c_~bag2~0 (+ .cse21 1)) (<= (+ (select .cse22 .cse5) c_~bag1~0 c_~sum1~0) (+ .cse20 c_~bag2~0 .cse21 c_~sum2~0)) (not (<= (+ .cse20 c_~bag2~0) 2147483647))))))) .cse0 .cse1)))))) is different from false [2022-11-20 21:16:37,664 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (* c_~j~0 4)) (.cse25 (* c_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse25 4)) (.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse25))) (.cse8 (+ c_~A~0.offset .cse24 4)) (.cse7 (+ c_~A~0.offset .cse24)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse3 (select .cse4 .cse8)) (.cse2 (select .cse4 .cse7))) (or (< (+ .cse2 c_~bag2~0 .cse3 c_~sum2~0) (+ (select .cse4 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse6 |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= 0 (+ .cse2 .cse3 2147483648))) (< c_~bag2~0 (+ .cse3 1)) (not (<= (+ .cse2 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse11 (select .cse9 .cse8)) (.cse10 (select .cse9 .cse7))) (or (<= (+ (select .cse9 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse6 |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse10 c_~bag2~0 .cse11 c_~sum2~0)) (not (<= 0 (+ .cse10 .cse11 2147483648))) (< c_~bag2~0 (+ .cse11 1)) (not (<= (+ .cse10 c_~bag2~0) 2147483647)))))))) (or .cse0 (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse8)) (.cse12 (select .cse14 .cse7))) (or (not (<= 0 (+ .cse12 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse12 .cse13) 2147483647)) (< (+ .cse12 c_~bag2~0 .cse13 c_~sum2~0) (+ (select .cse14 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse6 |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= (+ .cse12 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse12 .cse13 2147483648))) (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))) (not (<= (+ .cse12 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse17 (select .cse16 .cse8)) (.cse15 (select .cse16 .cse7))) (or (not (<= 0 (+ .cse15 c_~bag2~0 c_~sum2~0 2147483648))) (<= (+ (select .cse16 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse6 |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse15 c_~bag2~0 .cse17 c_~sum2~0)) (not (<= (+ .cse15 .cse17) 2147483647)) (not (<= (+ .cse15 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse15 .cse17 2147483648))) (not (<= 0 (+ .cse15 c_~bag2~0 2147483648))) (not (<= (+ .cse15 c_~bag2~0) 2147483647))))))) .cse1))) (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse7)) (.cse19 (select .cse20 .cse8))) (or (not (<= 0 (+ .cse18 c_~bag2~0 .cse19 2147483648))) (<= (+ (select .cse20 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse6 |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse18 c_~bag2~0 .cse19 c_~sum2~0)) (not (<= 0 (+ .cse18 c_~bag2~0 2147483648))) (not (<= (+ .cse18 c_~bag2~0) 2147483647)) (not (<= (+ .cse18 c_~bag2~0 .cse19) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse7)) (.cse22 (select .cse23 .cse8))) (or (not (<= 0 (+ .cse21 c_~bag2~0 .cse22 2147483648))) (< (+ .cse21 c_~bag2~0 .cse22 c_~sum2~0) (+ (select .cse23 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~b#1| .cse6 |c_thread1Thread1of1ForFork0_plus_#in~a#1| 1)) (not (<= 0 (+ .cse21 c_~bag2~0 2147483648))) (not (<= (+ .cse21 c_~bag2~0) 2147483647)) (not (<= (+ .cse21 c_~bag2~0 .cse22) 2147483647))))))) .cse0 .cse1)))) is different from false [2022-11-20 21:16:37,898 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (* c_~j~0 4)) (.cse25 (* c_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse25 4)) (.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse25))) (.cse6 (+ c_~A~0.offset .cse24)) (.cse5 (+ c_~A~0.offset .cse24 4)) (.cse10 (not (< (+ c_~j~0 1) c_~N~0))) (.cse11 (< (+ 2 c_~j~0) c_~N~0))) (and (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse6)) (.cse1 (select .cse2 .cse5))) (or (not (<= 0 (+ .cse0 c_~bag2~0 .cse1 2147483648))) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (<= (+ (select .cse2 .cse3) c_~bag1~0 c_~sum1~0 .cse4) (+ .cse0 c_~bag2~0 .cse1 c_~sum2~0)) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= (+ .cse0 c_~bag2~0 .cse1) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse6)) (.cse8 (select .cse9 .cse5))) (or (not (<= 0 (+ .cse7 c_~bag2~0 .cse8 2147483648))) (< (+ .cse7 c_~bag2~0 .cse8 c_~sum2~0) (+ (select .cse9 .cse3) c_~bag1~0 c_~sum1~0 .cse4 1)) (not (<= 0 (+ .cse7 c_~bag2~0 2147483648))) (not (<= (+ .cse7 c_~bag2~0) 2147483647)) (not (<= (+ .cse7 c_~bag2~0 .cse8) 2147483647))))))) .cse10 .cse11) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse10 (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse5)) (.cse12 (select .cse14 .cse6))) (or (not (<= 0 (+ .cse12 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse12 .cse13) 2147483647)) (not (<= (+ .cse12 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse12 .cse13 2147483648))) (< (+ .cse12 c_~bag2~0 .cse13 c_~sum2~0) (+ (select .cse14 .cse3) c_~bag1~0 c_~sum1~0 .cse4 1)) (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))) (not (<= (+ .cse12 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse5)) (.cse15 (select .cse17 .cse6))) (or (not (<= 0 (+ .cse15 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse15 .cse16) 2147483647)) (not (<= (+ .cse15 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse15 .cse16 2147483648))) (not (<= 0 (+ .cse15 c_~bag2~0 2147483648))) (<= (+ (select .cse17 .cse3) c_~bag1~0 c_~sum1~0 .cse4) (+ .cse15 c_~bag2~0 .cse16 c_~sum2~0)) (not (<= (+ .cse15 c_~bag2~0) 2147483647))))))) .cse11) (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse5)) (.cse18 (select .cse20 .cse6))) (or (not (<= 0 (+ .cse18 .cse19 2147483648))) (< c_~bag2~0 (+ .cse19 1)) (<= (+ (select .cse20 .cse3) c_~bag1~0 c_~sum1~0 .cse4) (+ .cse18 c_~bag2~0 .cse19 c_~sum2~0)) (not (<= (+ .cse18 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse5)) (.cse21 (select .cse23 .cse6))) (or (not (<= 0 (+ .cse21 .cse22 2147483648))) (< (+ .cse21 c_~bag2~0 .cse22 c_~sum2~0) (+ (select .cse23 .cse3) c_~bag1~0 c_~sum1~0 .cse4 1)) (< c_~bag2~0 (+ .cse22 1)) (not (<= (+ .cse21 c_~bag2~0) 2147483647))))))) .cse10 .cse11)))))) is different from false [2022-11-20 21:16:38,272 WARN L837 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse0 (< 2 c_~N~0)) (.cse1 (not (< 1 c_~N~0))) (.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_989 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_988))) (let ((.cse5 (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse5 .cse6)) (.cse3 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= (+ .cse2 .cse3) 2147483647)) (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse3) (not (<= 0 (+ .cse2 .cse3 2147483648))) (not (<= .cse3 2147483647)) (not (<= 0 (+ .cse3 2147483648)))))))) (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_989 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_988))) (let ((.cse10 (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse10 .cse6)) (.cse8 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= (+ .cse7 .cse8) 2147483647)) (not (<= 0 (+ .cse7 .cse8 2147483648))) (< .cse8 (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (<= .cse8 2147483647)) (not (<= 0 (+ .cse8 2147483648)))))))))) (or .cse0 .cse1 (and (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_989 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_988))) (let ((.cse14 (select (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse14 .cse6)) (.cse13 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse11 1)) (<= (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse13) (not (<= 0 (+ .cse11 .cse13 2147483648))) (not (<= .cse13 2147483647))))))) (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_989 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_988))) (let ((.cse18 (select (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse18 .cse6)) (.cse16 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse15 1)) (not (<= 0 (+ .cse15 .cse16 2147483648))) (< .cse16 (+ (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (<= .cse16 2147483647)))))))))))) is different from false [2022-11-20 21:16:38,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:16:38,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 122 [2022-11-20 21:16:38,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:16:38,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 418 treesize of output 374 [2022-11-20 21:16:38,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:16:38,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 365 treesize of output 325 [2022-11-20 21:16:38,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:16:38,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 301 [2022-11-20 21:16:38,531 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:16:38,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 1 [2022-11-20 21:16:38,553 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:16:38,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 1 [2022-11-20 21:16:38,563 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 21:16:38,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 1 [2022-11-20 21:16:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 21:16:38,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792712499] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:16:38,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1156118111] [2022-11-20 21:16:38,727 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-20 21:16:38,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:16:38,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-11-20 21:16:38,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686824757] [2022-11-20 21:16:38,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:16:38,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 21:16:38,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:16:38,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 21:16:38,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1040, Unknown=5, NotChecked=350, Total=1560 [2022-11-20 21:16:38,730 INFO L87 Difference]: Start difference. First operand 701 states and 2354 transitions. Second operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 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-20 21:16:47,512 WARN L233 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 69 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:16:47,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_~j~0 4)) (.cse29 (* c_~i~0 4))) (let ((.cse1 (< 2 c_~N~0)) (.cse0 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse2 (not (< 1 c_~N~0))) (.cse3 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (.cse7 (+ c_~A~0.offset .cse29 4)) (.cse8 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse29))) (.cse10 (+ c_~A~0.offset .cse28)) (.cse9 (+ c_~A~0.offset .cse28 4)) (.cse14 (not (< (+ c_~j~0 1) c_~N~0))) (.cse15 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not .cse0) .cse1 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3) (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse4 (select .cse6 .cse10)) (.cse5 (select .cse6 .cse9))) (or (not (<= 0 (+ .cse4 c_~bag2~0 .cse5 2147483648))) (not (<= 0 (+ .cse4 c_~bag2~0 2147483648))) (<= (+ (select .cse6 .cse7) c_~bag1~0 c_~sum1~0 .cse8) (+ .cse4 c_~bag2~0 .cse5 c_~sum2~0)) (not (<= (+ .cse4 c_~bag2~0) 2147483647)) (not (<= (+ .cse4 c_~bag2~0 .cse5) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse10)) (.cse12 (select .cse13 .cse9))) (or (not (<= 0 (+ .cse11 c_~bag2~0 .cse12 2147483648))) (< (+ .cse11 c_~bag2~0 .cse12 c_~sum2~0) (+ (select .cse13 .cse7) c_~bag1~0 c_~sum1~0 .cse8 1)) (not (<= 0 (+ .cse11 c_~bag2~0 2147483648))) (not (<= (+ .cse11 c_~bag2~0) 2147483647)) (not (<= (+ .cse11 c_~bag2~0 .cse12) 2147483647))))))) .cse14 .cse15) (or .cse1 (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse0 .cse2 .cse3) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse14 (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse9)) (.cse16 (select .cse18 .cse10))) (or (not (<= 0 (+ .cse16 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse16 .cse17) 2147483647)) (not (<= (+ .cse16 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse16 .cse17 2147483648))) (< (+ .cse16 c_~bag2~0 .cse17 c_~sum2~0) (+ (select .cse18 .cse7) c_~bag1~0 c_~sum1~0 .cse8 1)) (not (<= 0 (+ .cse16 c_~bag2~0 2147483648))) (not (<= (+ .cse16 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse9)) (.cse19 (select .cse21 .cse10))) (or (not (<= 0 (+ .cse19 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse19 .cse20) 2147483647)) (not (<= (+ .cse19 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= 0 (+ .cse19 c_~bag2~0 2147483648))) (<= (+ (select .cse21 .cse7) c_~bag1~0 c_~sum1~0 .cse8) (+ .cse19 c_~bag2~0 .cse20 c_~sum2~0)) (not (<= (+ .cse19 c_~bag2~0) 2147483647))))))) .cse15) (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse9)) (.cse22 (select .cse24 .cse10))) (or (not (<= 0 (+ .cse22 .cse23 2147483648))) (< c_~bag2~0 (+ .cse23 1)) (<= (+ (select .cse24 .cse7) c_~bag1~0 c_~sum1~0 .cse8) (+ .cse22 c_~bag2~0 .cse23 c_~sum2~0)) (not (<= (+ .cse22 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse26 (select .cse27 .cse9)) (.cse25 (select .cse27 .cse10))) (or (not (<= 0 (+ .cse25 .cse26 2147483648))) (< (+ .cse25 c_~bag2~0 .cse26 c_~sum2~0) (+ (select .cse27 .cse7) c_~bag1~0 c_~sum1~0 .cse8 1)) (< c_~bag2~0 (+ .cse26 1)) (not (<= (+ .cse25 c_~bag2~0) 2147483647))))))) .cse14 .cse15)))))) is different from false [2022-11-20 21:16:55,075 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~j~0 4))) (let ((.cse5 (+ c_~A~0.offset (* c_~i~0 4))) (.cse7 (+ c_~A~0.offset .cse23)) (.cse6 (+ c_~A~0.offset .cse23 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse2 (select .cse4 .cse7)) (.cse3 (select .cse4 .cse6))) (or (not (<= 0 (+ .cse2 c_~bag2~0 .cse3 2147483648))) (<= (+ (select .cse4 .cse5) c_~bag1~0 c_~sum1~0) (+ .cse2 c_~bag2~0 .cse3 c_~sum2~0)) (not (<= 0 (+ .cse2 c_~bag2~0 2147483648))) (not (<= (+ .cse2 c_~bag2~0) 2147483647)) (not (<= (+ .cse2 c_~bag2~0 .cse3) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse7)) (.cse9 (select .cse10 .cse6))) (or (not (<= 0 (+ .cse8 c_~bag2~0 .cse9 2147483648))) (< (+ .cse8 c_~bag2~0 .cse9 c_~sum2~0) (+ (select .cse10 .cse5) c_~bag1~0 c_~sum1~0 1)) (not (<= 0 (+ .cse8 c_~bag2~0 2147483648))) (not (<= (+ .cse8 c_~bag2~0) 2147483647)) (not (<= (+ .cse8 c_~bag2~0 .cse9) 2147483647)))))))) (or (< 2 c_~N~0) (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< 1 c_~N~0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse0 (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse6)) (.cse11 (select .cse13 .cse7))) (or (not (<= 0 (+ .cse11 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse11 .cse12) 2147483647)) (< (+ .cse11 c_~bag2~0 .cse12 c_~sum2~0) (+ (select .cse13 .cse5) c_~bag1~0 c_~sum1~0 1)) (not (<= (+ .cse11 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse11 .cse12 2147483648))) (not (<= 0 (+ .cse11 c_~bag2~0 2147483648))) (not (<= (+ .cse11 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse6)) (.cse14 (select .cse16 .cse7))) (or (not (<= 0 (+ .cse14 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse14 .cse15) 2147483647)) (not (<= (+ .cse14 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse14 .cse15 2147483648))) (<= (+ (select .cse16 .cse5) c_~bag1~0 c_~sum1~0) (+ .cse14 c_~bag2~0 .cse15 c_~sum2~0)) (not (<= 0 (+ .cse14 c_~bag2~0 2147483648))) (not (<= (+ .cse14 c_~bag2~0) 2147483647))))))) .cse1) (or (and (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse6)) (.cse17 (select .cse19 .cse7))) (or (< (+ .cse17 c_~bag2~0 .cse18 c_~sum2~0) (+ (select .cse19 .cse5) c_~bag1~0 c_~sum1~0 1)) (not (<= 0 (+ .cse17 .cse18 2147483648))) (< c_~bag2~0 (+ .cse18 1)) (not (<= (+ .cse17 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_989 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_989) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse6)) (.cse20 (select .cse22 .cse7))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (< c_~bag2~0 (+ .cse21 1)) (<= (+ (select .cse22 .cse5) c_~bag1~0 c_~sum1~0) (+ .cse20 c_~bag2~0 .cse21 c_~sum2~0)) (not (<= (+ .cse20 c_~bag2~0) 2147483647))))))) .cse0 .cse1)))))) is different from false [2022-11-20 21:17:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:17:03,404 INFO L93 Difference]: Finished difference Result 1658 states and 5272 transitions. [2022-11-20 21:17:03,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-20 21:17:03,405 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:17:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:17:03,413 INFO L225 Difference]: With dead ends: 1658 [2022-11-20 21:17:03,413 INFO L226 Difference]: Without dead ends: 1640 [2022-11-20 21:17:03,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=1243, Invalid=6603, Unknown=14, NotChecked=1260, Total=9120 [2022-11-20 21:17:03,415 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 699 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 549 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:17:03,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 0 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1457 Invalid, 0 Unknown, 549 Unchecked, 2.3s Time] [2022-11-20 21:17:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2022-11-20 21:17:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 732. [2022-11-20 21:17:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 3.374829001367989) internal successors, (2467), 731 states have internal predecessors, (2467), 0 states have call successors, (0), 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-20 21:17:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2467 transitions. [2022-11-20 21:17:03,442 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2467 transitions. Word has length 20 [2022-11-20 21:17:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:17:03,443 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 2467 transitions. [2022-11-20 21:17:03,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 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-20 21:17:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2467 transitions. [2022-11-20 21:17:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:17:03,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:17:03,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:17:03,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-20 21:17:03,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-20 21:17:03,651 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:17:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:17:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1466601312, now seen corresponding path program 24 times [2022-11-20 21:17:03,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:17:03,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442916993] [2022-11-20 21:17:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:17:03,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:17:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:17:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:17:05,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:17:05,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442916993] [2022-11-20 21:17:05,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442916993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:17:05,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403031009] [2022-11-20 21:17:05,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:17:05,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:17:05,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:17:05,993 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:17:05,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-20 21:17:06,152 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:17:06,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:17:06,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-20 21:17:06,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:17:06,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:17:06,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 21:17:07,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:17:07,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 60 [2022-11-20 21:17:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:17:07,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:17:09,426 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ c_~i~0 1) c_~N~0) (let ((.cse23 (* c_~j~0 4))) (let ((.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse6 (+ c_~A~0.offset .cse23)) (.cse7 (+ c_~A~0.offset .cse23 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse7)) (.cse5 (select .cse3 .cse6))) (or (< c_~bag2~0 (+ .cse2 1)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse3 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse2 c_~sum2~0 .cse5 1)) (not (<= (+ c_~bag2~0 .cse5) 2147483647)) (not (<= 0 (+ .cse2 .cse5 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse7)) (.cse9 (select .cse10 .cse6))) (or (< c_~bag2~0 (+ .cse8 1)) (not (<= (+ c_~bag2~0 .cse9) 2147483647)) (<= (+ c_~bag2~0 .cse8 c_~sum2~0 .cse9) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse10 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse8 .cse9 2147483648))))))))) (or .cse0 (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse7)) (.cse11 (select .cse13 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse11 2147483648))) (not (<= (+ .cse12 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse11 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse11) 2147483647)) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (<= (+ c_~bag2~0 .cse12 c_~sum2~0 .cse11) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse13 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse12 .cse11 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse7)) (.cse14 (select .cse16 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse14 2147483648))) (not (<= (+ .cse15 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse14 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse14) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse16 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse15 c_~sum2~0 .cse14 1)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (not (<= 0 (+ .cse15 .cse14 2147483648)))))))) .cse1))) (or (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse7)) (.cse17 (select .cse19 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse18 .cse17 2147483648))) (not (<= (+ c_~bag2~0 .cse18 .cse17) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse19 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse18 c_~sum2~0 .cse17 1)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse7)) (.cse20 (select .cse22 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse21 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse21 .cse20) 2147483647)) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= (+ c_~bag2~0 .cse21 c_~sum2~0 .cse20) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse22 .cse4) |c_thread1Thread1of1ForFork0_plus_#in~a#1|))))))) .cse0 .cse1))))) is different from false [2022-11-20 21:17:09,688 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~i~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0) (let ((.cse23 (* c_~j~0 4))) (let ((.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse6 (+ c_~A~0.offset .cse23)) (.cse7 (+ c_~A~0.offset .cse23 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse5 (select .cse3 .cse7)) (.cse2 (select .cse3 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse3 .cse4)) (+ c_~bag2~0 .cse5 c_~sum2~0 .cse2 1)) (not (<= 0 (+ c_~bag2~0 .cse5 .cse2 2147483648))) (not (<= (+ c_~bag2~0 .cse5 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse7)) (.cse8 (select .cse10 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse8 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse9 .cse8 2147483648))) (not (<= (+ c_~bag2~0 .cse9 .cse8) 2147483647)) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (<= (+ c_~bag2~0 .cse9 c_~sum2~0 .cse8) (+ c_~bag1~0 c_~sum1~0 (select .cse10 .cse4))))))))) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse7)) (.cse12 (select .cse13 .cse6))) (or (< c_~bag2~0 (+ .cse11 1)) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (<= (+ c_~bag2~0 .cse11 c_~sum2~0 .cse12) (+ c_~bag1~0 c_~sum1~0 (select .cse13 .cse4))) (not (<= 0 (+ .cse11 .cse12 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse15 (select .cse14 .cse7)) (.cse16 (select .cse14 .cse6))) (or (< (+ c_~bag1~0 c_~sum1~0 (select .cse14 .cse4)) (+ c_~bag2~0 .cse15 c_~sum2~0 .cse16 1)) (< c_~bag2~0 (+ .cse15 1)) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= 0 (+ .cse15 .cse16 2147483648)))))))) .cse0 .cse1) (or (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse7)) (.cse17 (select .cse18 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse18 .cse4)) (+ c_~bag2~0 .cse19 c_~sum2~0 .cse17 1)) (not (<= (+ .cse19 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse17 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse17) 2147483647)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ .cse19 .cse17 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse7)) (.cse20 (select .cse22 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= (+ .cse21 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse20 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse20) 2147483647)) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= (+ c_~bag2~0 .cse21 c_~sum2~0 .cse20) (+ c_~bag1~0 c_~sum1~0 (select .cse22 .cse4))) (not (<= 0 (+ .cse21 .cse20 2147483648)))))))) .cse0 .cse1))))))) is different from false [2022-11-20 21:17:09,790 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:17:09,791 INFO L350 Elim1Store]: Elim1 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 280 treesize of output 196 [2022-11-20 21:17:09,822 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-11-20 21:17:09,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 117 [2022-11-20 21:17:09,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:17:09,887 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-20 21:17:09,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 124 treesize of output 48 [2022-11-20 21:17:09,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:17:09,918 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-20 21:17:09,918 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 1 [2022-11-20 21:17:09,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:17:09,931 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-20 21:17:09,931 INFO L350 Elim1Store]: Elim1 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 99 treesize of output 1 [2022-11-20 21:17:09,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:17:09,951 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-20 21:17:09,951 INFO L350 Elim1Store]: Elim1 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 154 treesize of output 1 [2022-11-20 21:17:09,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:17:09,963 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-20 21:17:09,963 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 1 [2022-11-20 21:17:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:17:10,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403031009] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:17:10,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [587559877] [2022-11-20 21:17:10,426 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-20 21:17:10,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:17:10,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 37 [2022-11-20 21:17:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605223069] [2022-11-20 21:17:10,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:17:10,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 21:17:10,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:17:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 21:17:10,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1191, Unknown=2, NotChecked=142, Total=1482 [2022-11-20 21:17:10,431 INFO L87 Difference]: Start difference. First operand 732 states and 2467 transitions. Second operand has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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-20 21:17:22,791 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (< c_~i~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0) (let ((.cse23 (* c_~j~0 4))) (let ((.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse6 (+ c_~A~0.offset .cse23)) (.cse7 (+ c_~A~0.offset .cse23 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse5 (select .cse3 .cse7)) (.cse2 (select .cse3 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse3 .cse4)) (+ c_~bag2~0 .cse5 c_~sum2~0 .cse2 1)) (not (<= 0 (+ c_~bag2~0 .cse5 .cse2 2147483648))) (not (<= (+ c_~bag2~0 .cse5 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse7)) (.cse8 (select .cse10 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse8 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse9 .cse8 2147483648))) (not (<= (+ c_~bag2~0 .cse9 .cse8) 2147483647)) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (<= (+ c_~bag2~0 .cse9 c_~sum2~0 .cse8) (+ c_~bag1~0 c_~sum1~0 (select .cse10 .cse4))))))))) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse7)) (.cse12 (select .cse13 .cse6))) (or (< c_~bag2~0 (+ .cse11 1)) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (<= (+ c_~bag2~0 .cse11 c_~sum2~0 .cse12) (+ c_~bag1~0 c_~sum1~0 (select .cse13 .cse4))) (not (<= 0 (+ .cse11 .cse12 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse15 (select .cse14 .cse7)) (.cse16 (select .cse14 .cse6))) (or (< (+ c_~bag1~0 c_~sum1~0 (select .cse14 .cse4)) (+ c_~bag2~0 .cse15 c_~sum2~0 .cse16 1)) (< c_~bag2~0 (+ .cse15 1)) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= 0 (+ .cse15 .cse16 2147483648)))))))) .cse0 .cse1) (or (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse7)) (.cse17 (select .cse18 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse18 .cse4)) (+ c_~bag2~0 .cse19 c_~sum2~0 .cse17 1)) (not (<= (+ .cse19 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse17 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse17) 2147483647)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ .cse19 .cse17 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse7)) (.cse20 (select .cse22 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= (+ .cse21 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse20 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse20) 2147483647)) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= (+ c_~bag2~0 .cse21 c_~sum2~0 .cse20) (+ c_~bag1~0 c_~sum1~0 (select .cse22 .cse4))) (not (<= 0 (+ .cse21 .cse20 2147483648)))))))) .cse0 .cse1))))))) (or (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= c_~bag2~0 0))) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) is different from false [2022-11-20 21:17:35,543 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (< c_~i~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0) (let ((.cse23 (* c_~j~0 4))) (let ((.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse6 (+ c_~A~0.offset .cse23)) (.cse7 (+ c_~A~0.offset .cse23 4)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse1 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse5 (select .cse3 .cse7)) (.cse2 (select .cse3 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse3 .cse4)) (+ c_~bag2~0 .cse5 c_~sum2~0 .cse2 1)) (not (<= 0 (+ c_~bag2~0 .cse5 .cse2 2147483648))) (not (<= (+ c_~bag2~0 .cse5 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse7)) (.cse8 (select .cse10 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse8 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse9 .cse8 2147483648))) (not (<= (+ c_~bag2~0 .cse9 .cse8) 2147483647)) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (<= (+ c_~bag2~0 .cse9 c_~sum2~0 .cse8) (+ c_~bag1~0 c_~sum1~0 (select .cse10 .cse4))))))))) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse7)) (.cse12 (select .cse13 .cse6))) (or (< c_~bag2~0 (+ .cse11 1)) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (<= (+ c_~bag2~0 .cse11 c_~sum2~0 .cse12) (+ c_~bag1~0 c_~sum1~0 (select .cse13 .cse4))) (not (<= 0 (+ .cse11 .cse12 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse15 (select .cse14 .cse7)) (.cse16 (select .cse14 .cse6))) (or (< (+ c_~bag1~0 c_~sum1~0 (select .cse14 .cse4)) (+ c_~bag2~0 .cse15 c_~sum2~0 .cse16 1)) (< c_~bag2~0 (+ .cse15 1)) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= 0 (+ .cse15 .cse16 2147483648)))))))) .cse0 .cse1) (or (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse7)) (.cse17 (select .cse18 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse18 .cse4)) (+ c_~bag2~0 .cse19 c_~sum2~0 .cse17 1)) (not (<= (+ .cse19 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse17 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse17) 2147483647)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ .cse19 .cse17 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse7)) (.cse20 (select .cse22 .cse6))) (or (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= (+ .cse21 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse20 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse20) 2147483647)) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= (+ c_~bag2~0 .cse21 c_~sum2~0 .cse20) (+ c_~bag1~0 c_~sum1~0 (select .cse22 .cse4))) (not (<= 0 (+ .cse21 .cse20 2147483648)))))))) .cse0 .cse1))))))) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|)) is different from false [2022-11-20 21:17:42,608 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~bag2~0 c_~sum2~0)) (.cse25 (+ c_~bag1~0 c_~sum1~0)) (.cse26 (< c_~i~0 c_~N~0))) (and (or (< (+ c_~i~0 1) c_~N~0) (let ((.cse24 (* c_~j~0 4))) (let ((.cse5 (+ c_~A~0.offset (* c_~i~0 4))) (.cse7 (+ c_~A~0.offset .cse24)) (.cse8 (+ c_~A~0.offset .cse24 4)) (.cse1 (not (< (+ c_~j~0 1) c_~N~0))) (.cse2 (< (+ 2 c_~j~0) c_~N~0))) (and (or (not (<= .cse0 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse1 .cse2 (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse3 (select .cse4 .cse8)) (.cse6 (select .cse4 .cse7))) (or (< c_~bag2~0 (+ .cse3 1)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse4 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse3 c_~sum2~0 .cse6 1)) (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (not (<= 0 (+ .cse3 .cse6 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse9 (select .cse11 .cse8)) (.cse10 (select .cse11 .cse7))) (or (< c_~bag2~0 (+ .cse9 1)) (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (<= (+ c_~bag2~0 .cse9 c_~sum2~0 .cse10) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse11 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse9 .cse10 2147483648))))))))) (or .cse1 (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse8)) (.cse12 (select .cse14 .cse7))) (or (not (<= 0 (+ c_~bag2~0 .cse12 2147483648))) (not (<= (+ .cse13 .cse12) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse12 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse12) 2147483647)) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (<= (+ c_~bag2~0 .cse13 c_~sum2~0 .cse12) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse14 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse13 .cse12 2147483648))))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse8)) (.cse15 (select .cse17 .cse7))) (or (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (not (<= (+ .cse16 .cse15) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse15 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse15) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse17 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse16 c_~sum2~0 .cse15 1)) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (not (<= 0 (+ .cse16 .cse15 2147483648)))))))) .cse2))) (or (and (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse8)) (.cse18 (select .cse20 .cse7))) (or (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse19 .cse18 2147483648))) (not (<= (+ c_~bag2~0 .cse19 .cse18) 2147483647)) (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse20 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ c_~bag2~0 .cse19 c_~sum2~0 .cse18 1)) (not (<= (+ c_~bag2~0 .cse18) 2147483647)))))) (forall ((v_ArrVal_1024 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse8)) (.cse21 (select .cse23 .cse7))) (or (not (<= 0 (+ c_~bag2~0 .cse21 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse22 .cse21 2147483648))) (not (<= (+ c_~bag2~0 .cse22 .cse21) 2147483647)) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (<= (+ c_~bag2~0 .cse22 c_~sum2~0 .cse21) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse23 .cse5) |c_thread1Thread1of1ForFork0_plus_#in~a#1|))))))) .cse1 .cse2))))) (or (and (< .cse25 (+ c_~sum2~0 1)) (<= c_~sum2~0 .cse25)) .cse26) (or (< c_~j~0 c_~N~0) (and (< .cse25 (+ c_~bag2~0 c_~sum2~0 1)) (<= .cse0 .cse25)) .cse26))) is different from false [2022-11-20 21:18:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:18:04,071 INFO L93 Difference]: Finished difference Result 1487 states and 4699 transitions. [2022-11-20 21:18:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-11-20 21:18:04,073 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:18:04,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:18:04,079 INFO L225 Difference]: With dead ends: 1487 [2022-11-20 21:18:04,079 INFO L226 Difference]: Without dead ends: 1472 [2022-11-20 21:18:04,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 15 SyntacticMatches, 15 SemanticMatches, 171 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 10577 ImplicationChecksByTransitivity, 51.5s TimeCoverageRelationStatistics Valid=3917, Invalid=24140, Unknown=19, NotChecked=1680, Total=29756 [2022-11-20 21:18:04,082 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1045 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 868 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:18:04,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 0 Invalid, 3487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2239 Invalid, 0 Unknown, 868 Unchecked, 4.2s Time] [2022-11-20 21:18:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-11-20 21:18:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 792. [2022-11-20 21:18:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 3.3830594184576483) internal successors, (2676), 791 states have internal predecessors, (2676), 0 states have call successors, (0), 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-20 21:18:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2676 transitions. [2022-11-20 21:18:04,112 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2676 transitions. Word has length 20 [2022-11-20 21:18:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:18:04,112 INFO L495 AbstractCegarLoop]: Abstraction has 792 states and 2676 transitions. [2022-11-20 21:18:04,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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-20 21:18:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2676 transitions. [2022-11-20 21:18:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:18:04,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:18:04,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:18:04,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-20 21:18:04,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-20 21:18:04,321 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 21:18:04,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:18:04,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1438895682, now seen corresponding path program 25 times [2022-11-20 21:18:04,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:18:04,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228208667] [2022-11-20 21:18:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:18:04,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:18:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:18:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:18:06,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:18:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228208667] [2022-11-20 21:18:06,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228208667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:18:06,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211519571] [2022-11-20 21:18:06,606 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:18:06,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:18:06,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:18:06,607 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:18:06,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d071bc-4656-4aa0-a81d-92b5f4d7e54e/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-20 21:18:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:18:06,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-20 21:18:06,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:18:07,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:18:07,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20