./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2329fc7 [2022-12-14 11:43:44,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:43:44,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:43:44,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:43:44,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:43:44,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:43:44,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:43:44,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:43:44,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:43:44,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:43:44,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:43:44,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:43:44,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:43:44,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:43:44,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:43:44,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:43:44,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:43:44,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:43:44,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:43:44,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:43:44,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:43:44,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:43:44,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:43:44,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:43:44,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:43:44,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:43:44,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:43:44,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:43:44,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:43:44,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:43:44,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:43:44,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:43:44,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:43:44,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:43:44,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:43:44,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:43:44,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:43:44,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:43:44,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:43:44,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:43:44,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:43:44,615 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 11:43:44,630 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:43:44,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:43:44,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:43:44,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:43:44,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:43:44,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:43:44,632 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:43:44,632 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:43:44,632 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:43:44,632 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:43:44,632 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:43:44,633 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:43:44,633 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:43:44,633 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:43:44,633 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:43:44,633 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:43:44,634 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:43:44,634 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:43:44,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:43:44,635 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:43:44,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:43:44,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:43:44,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:43:44,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:43:44,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:43:44,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:43:44,636 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:43:44,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:43:44,636 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:43:44,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:43:44,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:43:44,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:43:44,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:43:44,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:43:44,637 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:43:44,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:43:44,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:43:44,638 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:43:44,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:43:44,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:43:44,638 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:43:44,638 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_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-12-14 11:43:44,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:43:44,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:43:44,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:43:44,822 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:43:44,823 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:43:44,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-12-14 11:43:47,403 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:43:47,556 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:43:47,557 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-12-14 11:43:47,562 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/data/e2aa97980/0d0706028df0406ba55c7e7857d653f6/FLAGaf0b3e459 [2022-12-14 11:43:47,979 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/data/e2aa97980/0d0706028df0406ba55c7e7857d653f6 [2022-12-14 11:43:47,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:43:47,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:43:47,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:43:47,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:43:47,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:43:47,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:43:47" (1/1) ... [2022-12-14 11:43:47,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b868f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:47, skipping insertion in model container [2022-12-14 11:43:47,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:43:47" (1/1) ... [2022-12-14 11:43:47,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:43:48,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:43:48,138 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_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 11:43:48,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:43:48,152 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:43:48,168 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_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 11:43:48,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:43:48,181 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:43:48,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48 WrapperNode [2022-12-14 11:43:48,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:43:48,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:43:48,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:43:48,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:43:48,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,218 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-12-14 11:43:48,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:43:48,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:43:48,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:43:48,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:43:48,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:43:48,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:43:48,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:43:48,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:43:48,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (1/1) ... [2022-12-14 11:43:48,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:43:48,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:43:48,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:43:48,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:43:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:43:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 11:43:48,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 11:43:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 11:43:48,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 11:43:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:43:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:43:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 11:43:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 11:43:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:43:48,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:43:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 11:43:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:43:48,313 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 11:43:48,391 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:43:48,393 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:43:48,775 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:43:48,788 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:43:48,788 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 11:43:48,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:43:48 BoogieIcfgContainer [2022-12-14 11:43:48,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:43:48,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:43:48,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:43:48,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:43:48,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:43:47" (1/3) ... [2022-12-14 11:43:48,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee8a0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:43:48, skipping insertion in model container [2022-12-14 11:43:48,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:48" (2/3) ... [2022-12-14 11:43:48,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee8a0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:43:48, skipping insertion in model container [2022-12-14 11:43:48,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:43:48" (3/3) ... [2022-12-14 11:43:48,800 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-12-14 11:43:48,807 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 11:43:48,815 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:43:48,815 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 11:43:48,815 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 11:43:48,930 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 11:43:48,964 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 11:43:48,976 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 396 transitions, 808 flow [2022-12-14 11:43:48,978 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 396 transitions, 808 flow [2022-12-14 11:43:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 396 transitions, 808 flow [2022-12-14 11:43:49,106 INFO L130 PetriNetUnfolder]: 28/394 cut-off events. [2022-12-14 11:43:49,107 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 11:43:49,116 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 919 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-12-14 11:43:49,126 INFO L119 LiptonReduction]: Number of co-enabled transitions 37700 [2022-12-14 11:43:58,170 INFO L134 LiptonReduction]: Checked pairs total: 32396 [2022-12-14 11:43:58,170 INFO L136 LiptonReduction]: Total number of compositions: 494 [2022-12-14 11:43:58,175 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 20 transitions, 56 flow [2022-12-14 11:43:58,184 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:43:58,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:43:58,199 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;@1f39db2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:43:58,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-14 11:43:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:43:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:43:58,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:58,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:58,205 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-12-14 11:43:58,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash 202132216, now seen corresponding path program 1 times [2022-12-14 11:43:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:58,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569299754] [2022-12-14 11:43:58,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:58,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:58,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569299754] [2022-12-14 11:43:58,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569299754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:58,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:58,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:43:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355705268] [2022-12-14 11:43:58,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:58,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:43:58,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:43:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:58,764 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 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-12-14 11:43:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:58,877 INFO L93 Difference]: Finished difference Result 70 states and 168 transitions. [2022-12-14 11:43:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:58,879 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-12-14 11:43:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:58,885 INFO L225 Difference]: With dead ends: 70 [2022-12-14 11:43:58,885 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 11:43:58,886 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-12-14 11:43:58,888 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:58,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:58,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 11:43:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2022-12-14 11:43:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:43:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 83 transitions. [2022-12-14 11:43:58,916 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 83 transitions. Word has length 12 [2022-12-14 11:43:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:58,917 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 83 transitions. [2022-12-14 11:43:58,917 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-12-14 11:43:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 83 transitions. [2022-12-14 11:43:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 11:43:58,918 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:58,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:58,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:43:58,918 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-12-14 11:43:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:58,919 INFO L85 PathProgramCache]: Analyzing trace with hash 66485805, now seen corresponding path program 1 times [2022-12-14 11:43:58,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:58,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967094463] [2022-12-14 11:43:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:59,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:59,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967094463] [2022-12-14 11:43:59,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967094463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:59,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:59,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:43:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329324522] [2022-12-14 11:43:59,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:59,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:43:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:59,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:43:59,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:43:59,084 INFO L87 Difference]: Start difference. First operand 39 states and 83 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-12-14 11:43:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:59,147 INFO L93 Difference]: Finished difference Result 77 states and 151 transitions. [2022-12-14 11:43:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:59,147 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-12-14 11:43:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:59,149 INFO L225 Difference]: With dead ends: 77 [2022-12-14 11:43:59,149 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 11:43:59,149 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-12-14 11:43:59,151 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:59,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 11:43:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2022-12-14 11:43:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 58 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:43:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 126 transitions. [2022-12-14 11:43:59,161 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 126 transitions. Word has length 13 [2022-12-14 11:43:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:59,161 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 126 transitions. [2022-12-14 11:43:59,162 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-12-14 11:43:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 126 transitions. [2022-12-14 11:43:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:43:59,163 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:59,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:59,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:43:59,163 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-12-14 11:43:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash 837008054, now seen corresponding path program 1 times [2022-12-14 11:43:59,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:59,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410871707] [2022-12-14 11:43:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:59,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:59,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:59,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410871707] [2022-12-14 11:43:59,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410871707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:59,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:59,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:43:59,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915518598] [2022-12-14 11:43:59,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:59,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:43:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:59,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:43:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:43:59,348 INFO L87 Difference]: Start difference. First operand 59 states and 126 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-12-14 11:43:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:59,402 INFO L93 Difference]: Finished difference Result 47 states and 92 transitions. [2022-12-14 11:43:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:59,402 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-12-14 11:43:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:59,403 INFO L225 Difference]: With dead ends: 47 [2022-12-14 11:43:59,403 INFO L226 Difference]: Without dead ends: 40 [2022-12-14 11:43:59,403 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-12-14 11:43:59,404 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:59,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:43:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-14 11:43:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-12-14 11:43:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:43:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 84 transitions. [2022-12-14 11:43:59,409 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 84 transitions. Word has length 14 [2022-12-14 11:43:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:59,409 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 84 transitions. [2022-12-14 11:43:59,409 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-12-14 11:43:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 84 transitions. [2022-12-14 11:43:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:43:59,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:59,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:59,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:43:59,410 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-12-14 11:43:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:59,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1763425234, now seen corresponding path program 1 times [2022-12-14 11:43:59,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:59,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607854926] [2022-12-14 11:43:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:59,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:59,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607854926] [2022-12-14 11:43:59,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607854926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:43:59,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091059429] [2022-12-14 11:43:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:59,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:43:59,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:43:59,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:43:59,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:43:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:59,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 11:43:59,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:43:59,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:43:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:43:59,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091059429] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 11:43:59,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 11:43:59,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-14 11:43:59,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945768087] [2022-12-14 11:43:59,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:59,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:43:59,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:59,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:43:59,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:43:59,821 INFO L87 Difference]: Start difference. First operand 40 states and 84 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-12-14 11:43:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:59,877 INFO L93 Difference]: Finished difference Result 38 states and 81 transitions. [2022-12-14 11:43:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:59,877 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-12-14 11:43:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:59,878 INFO L225 Difference]: With dead ends: 38 [2022-12-14 11:43:59,878 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 11:43:59,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:43:59,879 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:59,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:43:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 11:43:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-12-14 11:43:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:43:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2022-12-14 11:43:59,882 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 71 transitions. Word has length 14 [2022-12-14 11:43:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:59,882 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 71 transitions. [2022-12-14 11:43:59,882 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-12-14 11:43:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 71 transitions. [2022-12-14 11:43:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 11:43:59,883 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:59,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:59,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:44:00,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:00,085 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-12-14 11:44:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1902522801, now seen corresponding path program 1 times [2022-12-14 11:44:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:00,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834201757] [2022-12-14 11:44:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:00,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:00,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834201757] [2022-12-14 11:44:00,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834201757] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:00,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587893815] [2022-12-14 11:44:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:00,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:00,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:00,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:44:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:00,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 11:44:00,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:00,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:00,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587893815] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:00,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 11:44:00,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2022-12-14 11:44:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388957314] [2022-12-14 11:44:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:44:00,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:44:00,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:44:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:44:00,454 INFO L87 Difference]: Start difference. First operand 34 states and 71 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-12-14 11:44:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:00,495 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2022-12-14 11:44:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:44:00,495 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-12-14 11:44:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:00,496 INFO L225 Difference]: With dead ends: 44 [2022-12-14 11:44:00,496 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 11:44:00,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:44:00,497 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:00,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:44:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 11:44:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-14 11:44:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 95 transitions. [2022-12-14 11:44:00,501 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 95 transitions. Word has length 15 [2022-12-14 11:44:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:00,501 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 95 transitions. [2022-12-14 11:44:00,502 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-12-14 11:44:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 95 transitions. [2022-12-14 11:44:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:44:00,502 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:00,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:00,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 11:44:00,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:00,703 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-12-14 11:44:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1238986388, now seen corresponding path program 1 times [2022-12-14 11:44:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:00,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992203882] [2022-12-14 11:44:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:03,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:03,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992203882] [2022-12-14 11:44:03,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992203882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:03,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658448681] [2022-12-14 11:44:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:03,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:03,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:03,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:03,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:44:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:03,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 11:44:03,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:03,702 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-12-14 11:44:03,739 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-12-14 11:44:03,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:44:03,870 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-12-14 11:44:03,958 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 189 treesize of output 157 [2022-12-14 11:44:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:04,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:04,294 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-12-14 11:44:04,707 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_132 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse0 2147483647)) (not (<= 0 (+ .cse0 2147483648))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |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 (+ .cse1 2147483648))) (<= .cse0 .cse1)))))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse3 (select (select (store .cse4 |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 (+ .cse3 2147483648))) (not (<= .cse3 2147483647)) (<= .cse3 (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|)))))) (forall ((v_ArrVal_132 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse5 2147483647)) (not (<= 0 (+ .cse5 2147483648))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse6 (select (select (store .cse7 |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 (<= .cse6 2147483647)) (<= .cse6 .cse5)))))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse8 (select (select (store .cse9 |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 (+ .cse8 2147483648))) (<= (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|) .cse8) (not (<= .cse8 2147483647))))))) is different from false [2022-12-14 11:44:04,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:44:04,740 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 119 treesize of output 71 [2022-12-14 11:44:04,746 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 420 treesize of output 372 [2022-12-14 11:44:04,755 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 310 treesize of output 286 [2022-12-14 11:44:04,759 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 330 treesize of output 306 [2022-12-14 11:44:05,090 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:44:05,090 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-12-14 11:44:05,095 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:44:05,095 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 121 treesize of output 1 [2022-12-14 11:44:05,100 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:44:05,100 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-12-14 11:44:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 11:44:05,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658448681] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:05,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [106692360] [2022-12-14 11:44:05,121 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:05,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:05,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-12-14 11:44:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800738997] [2022-12-14 11:44:05,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:05,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 11:44:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:05,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 11:44:05,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=381, Unknown=2, NotChecked=82, Total=552 [2022-12-14 11:44:05,124 INFO L87 Difference]: Start difference. First operand 44 states and 95 transitions. Second operand has 24 states, 23 states have (on average 1.826086956521739) 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-12-14 11:44:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:05,926 INFO L93 Difference]: Finished difference Result 152 states and 366 transitions. [2022-12-14 11:44:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 11:44:05,926 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.826086956521739) 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-12-14 11:44:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:05,927 INFO L225 Difference]: With dead ends: 152 [2022-12-14 11:44:05,927 INFO L226 Difference]: Without dead ends: 142 [2022-12-14 11:44:05,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=244, Invalid=1022, Unknown=2, NotChecked=138, Total=1406 [2022-12-14 11:44:05,928 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 178 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:05,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 0 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 337 Invalid, 0 Unknown, 119 Unchecked, 0.3s Time] [2022-12-14 11:44:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-12-14 11:44:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 54. [2022-12-14 11:44:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.3773584905660377) internal successors, (126), 53 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 126 transitions. [2022-12-14 11:44:05,932 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 126 transitions. Word has length 16 [2022-12-14 11:44:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:05,932 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 126 transitions. [2022-12-14 11:44:05,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.826086956521739) 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-12-14 11:44:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 126 transitions. [2022-12-14 11:44:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:44:05,933 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:05,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:05,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:44:06,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 11:44:06,135 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-12-14 11:44:06,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1336864238, now seen corresponding path program 2 times [2022-12-14 11:44:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:06,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158407593] [2022-12-14 11:44:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:07,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158407593] [2022-12-14 11:44:07,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158407593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967839596] [2022-12-14 11:44:07,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:44:07,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:07,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:07,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:07,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 11:44:07,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 11:44:07,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:44:07,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 11:44:07,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:07,516 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-12-14 11:44:07,567 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-12-14 11:44:07,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:44:07,711 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-12-14 11:44:07,822 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 183 treesize of output 151 [2022-12-14 11:44:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:07,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:08,336 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~j~0 c_~N~0)) (< (+ c_~j~0 1) c_~N~0) (let ((.cse1 (+ 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) .cse1))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse1))) (or (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (< (+ c_~bag2~0 .cse2 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 1)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)))))))) is different from false [2022-12-14 11:44:08,540 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse1 (let ((.cse3 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse0) (+ c_~bag2~0 .cse2 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse2) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse3))) (or (not (<= 0 (+ c_~bag2~0 .cse4 2147483648))) (< (+ c_~bag2~0 .cse4 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse0 1)) (not (<= (+ c_~bag2~0 .cse4) 2147483647))))))))) (and (or (not (<= (+ c_~bag1~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse0 2147483648))) .cse1) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse1 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647)))))) (not (< c_~j~0 c_~N~0)) (< (+ c_~j~0 1) c_~N~0)) is different from false [2022-12-14 11:44:08,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:44:08,853 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-12-14 11:44:08,859 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-12-14 11:44:08,871 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-12-14 11:44:08,878 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-12-14 11:44:08,957 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:44:08,958 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 101 treesize of output 1 [2022-12-14 11:44:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 11:44:08,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967839596] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:08,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [896252561] [2022-12-14 11:44:08,982 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:08,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:08,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-14 11:44:08,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644810395] [2022-12-14 11:44:08,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:08,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 11:44:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:08,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 11:44:08,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=452, Unknown=3, NotChecked=90, Total=650 [2022-12-14 11:44:08,983 INFO L87 Difference]: Start difference. First operand 54 states and 126 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:10,216 INFO L93 Difference]: Finished difference Result 174 states and 389 transitions. [2022-12-14 11:44:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 11:44:10,217 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:44:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:10,217 INFO L225 Difference]: With dead ends: 174 [2022-12-14 11:44:10,217 INFO L226 Difference]: Without dead ends: 164 [2022-12-14 11:44:10,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=333, Invalid=1478, Unknown=3, NotChecked=166, Total=1980 [2022-12-14 11:44:10,218 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 255 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:10,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 0 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 423 Invalid, 0 Unknown, 132 Unchecked, 0.4s Time] [2022-12-14 11:44:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-14 11:44:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 54. [2022-12-14 11:44:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.3773584905660377) internal successors, (126), 53 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 126 transitions. [2022-12-14 11:44:10,222 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 126 transitions. Word has length 16 [2022-12-14 11:44:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:10,222 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 126 transitions. [2022-12-14 11:44:10,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 126 transitions. [2022-12-14 11:44:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:44:10,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:10,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:10,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 11:44:10,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 11:44:10,425 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-12-14 11:44:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1239164706, now seen corresponding path program 3 times [2022-12-14 11:44:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:10,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947192425] [2022-12-14 11:44:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:13,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:13,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947192425] [2022-12-14 11:44:13,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947192425] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719825251] [2022-12-14 11:44:13,241 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:44:13,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:13,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:13,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:13,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:44:13,311 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:44:13,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:44:13,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 11:44:13,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:13,348 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-12-14 11:44:13,387 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-12-14 11:44:13,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:44:13,544 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-12-14 11:44:13,697 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 183 treesize of output 151 [2022-12-14 11:44:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:13,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:14,194 WARN L837 $PredicateComparison]: unable to prove that (or (<= (+ 2 c_~j~0) c_~N~0) (not (< c_~j~0 c_~N~0)) (< c_~i~0 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-12-14 11:44:14,394 WARN L837 $PredicateComparison]: unable to prove that (or (<= (+ 2 c_~j~0) c_~N~0) (not (< c_~j~0 c_~N~0)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse0 (< (+ c_~i~0 1) c_~N~0)) (.cse1 (let ((.cse4 (+ c_~bag1~0 c_~sum1~0 .cse2)) (.cse5 (+ c_~A~0.offset (* c_~j~0 4)))) (and (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) .cse5))) (or (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse4) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648)))))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse5))) (or (<= .cse4 (+ c_~bag2~0 .cse6 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse6 2147483648)))))))))) (and (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse0 .cse1 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (or (not (<= (+ c_~bag1~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse2 2147483648))) .cse0 .cse1))))) is different from false [2022-12-14 11:44:14,617 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse0 2147483647)) (not (<= 0 (+ .cse0 2147483648))) (<= (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|) .cse0))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200))) (let ((.cse2 (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|))) (or (not (<= 0 (+ .cse2 2147483648))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse3 2147483647)) (<= .cse3 .cse2)))) (not (<= .cse2 2147483647)))))) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse5 2147483647)) (not (<= 0 (+ .cse5 2147483648))) (<= .cse5 (select (select .cse6 |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_200 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200))) (let ((.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|))) (or (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |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 (+ .cse7 2147483648))) (<= .cse8 .cse7)))) (not (<= 0 (+ .cse8 2147483648))) (not (<= .cse8 2147483647))))))) (<= 2 c_~N~0)) is different from false [2022-12-14 11:44:14,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:44:14,643 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 119 treesize of output 71 [2022-12-14 11:44:14,648 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 420 treesize of output 372 [2022-12-14 11:44:14,663 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 310 treesize of output 286 [2022-12-14 11:44:14,668 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 330 treesize of output 306 [2022-12-14 11:44:14,913 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:44:14,913 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-12-14 11:44:14,919 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:44:14,919 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-12-14 11:44:14,925 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:44:14,926 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 121 treesize of output 1 [2022-12-14 11:44:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 11:44:14,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719825251] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:14,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [955557786] [2022-12-14 11:44:14,955 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:14,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:14,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-14 11:44:14,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605306239] [2022-12-14 11:44:14,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:14,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 11:44:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 11:44:14,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=355, Unknown=3, NotChecked=120, Total=552 [2022-12-14 11:44:14,957 INFO L87 Difference]: Start difference. First operand 54 states and 126 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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-12-14 11:44:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:17,339 INFO L93 Difference]: Finished difference Result 216 states and 488 transitions. [2022-12-14 11:44:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 11:44:17,340 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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-12-14 11:44:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:17,340 INFO L225 Difference]: With dead ends: 216 [2022-12-14 11:44:17,340 INFO L226 Difference]: Without dead ends: 188 [2022-12-14 11:44:17,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=565, Invalid=2200, Unknown=3, NotChecked=312, Total=3080 [2022-12-14 11:44:17,341 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 309 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:17,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 0 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 461 Invalid, 0 Unknown, 210 Unchecked, 0.4s Time] [2022-12-14 11:44:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-12-14 11:44:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 58. [2022-12-14 11:44:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.280701754385965) internal successors, (130), 57 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-12-14 11:44:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 130 transitions. [2022-12-14 11:44:17,345 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 130 transitions. Word has length 16 [2022-12-14 11:44:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:17,345 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 130 transitions. [2022-12-14 11:44:17,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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-12-14 11:44:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 130 transitions. [2022-12-14 11:44:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:44:17,346 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:17,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:17,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 11:44:17,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:17,548 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-12-14 11:44:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:17,549 INFO L85 PathProgramCache]: Analyzing trace with hash 463410492, now seen corresponding path program 4 times [2022-12-14 11:44:17,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:17,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022445998] [2022-12-14 11:44:17,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:17,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:19,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:19,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022445998] [2022-12-14 11:44:19,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022445998] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:19,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604288558] [2022-12-14 11:44:19,066 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 11:44:19,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:19,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:19,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 11:44:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:19,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 11:44:19,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:19,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:44:19,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 11:44:19,336 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 189 treesize of output 157 [2022-12-14 11:44:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:19,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:19,580 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_232 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) c_~A~0.base) .cse1))) (or (<= c_~sum1~0 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_232 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) c_~A~0.base) .cse1))) (or (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (<= (+ c_~bag2~0 .cse2 c_~sum2~0) c_~sum1~0)))))) is different from false [2022-12-14 11:44:19,597 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_232 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1)))) (forall ((v_ArrVal_232 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0))))))) is different from false [2022-12-14 11:44:19,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:44:19,684 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 452 treesize of output 400 [2022-12-14 11:44:19,694 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 181 treesize of output 163 [2022-12-14 11:44:19,704 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 163 treesize of output 145 [2022-12-14 11:44:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-14 11:44:20,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604288558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:20,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1726197991] [2022-12-14 11:44:20,000 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:20,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:20,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2022-12-14 11:44:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777602665] [2022-12-14 11:44:20,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:20,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 11:44:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:20,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 11:44:20,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=355, Unknown=2, NotChecked=78, Total=506 [2022-12-14 11:44:20,002 INFO L87 Difference]: Start difference. First operand 58 states and 130 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 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-12-14 11:44:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:20,597 INFO L93 Difference]: Finished difference Result 128 states and 277 transitions. [2022-12-14 11:44:20,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 11:44:20,598 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 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-12-14 11:44:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:20,598 INFO L225 Difference]: With dead ends: 128 [2022-12-14 11:44:20,599 INFO L226 Difference]: Without dead ends: 118 [2022-12-14 11:44:20,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=866, Unknown=2, NotChecked=126, Total=1190 [2022-12-14 11:44:20,599 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 198 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:20,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 0 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 352 Invalid, 0 Unknown, 112 Unchecked, 0.2s Time] [2022-12-14 11:44:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-14 11:44:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 60. [2022-12-14 11:44:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.23728813559322) internal successors, (132), 59 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 132 transitions. [2022-12-14 11:44:20,604 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 132 transitions. Word has length 16 [2022-12-14 11:44:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:20,604 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 132 transitions. [2022-12-14 11:44:20,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 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-12-14 11:44:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 132 transitions. [2022-12-14 11:44:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:44:20,605 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:20,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:20,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 11:44:20,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:20,807 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-12-14 11:44:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash 935736482, now seen corresponding path program 5 times [2022-12-14 11:44:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:20,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527496211] [2022-12-14 11:44:20,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:20,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:22,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:22,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527496211] [2022-12-14 11:44:22,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527496211] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:22,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890506549] [2022-12-14 11:44:22,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:44:22,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:22,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:22,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:22,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 11:44:22,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 11:44:22,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:44:22,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 11:44:22,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:22,114 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-12-14 11:44:22,147 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-12-14 11:44:22,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 6 treesize of output 5 [2022-12-14 11:44:22,354 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 173 treesize of output 153 [2022-12-14 11:44:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:22,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:23,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-12-14 11:44:23,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890506549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:23,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [878255618] [2022-12-14 11:44:23,510 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:23,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:23,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2022-12-14 11:44:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94439513] [2022-12-14 11:44:23,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:23,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 11:44:23,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:23,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 11:44:23,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=448, Unknown=7, NotChecked=0, Total=552 [2022-12-14 11:44:23,511 INFO L87 Difference]: Start difference. First operand 60 states and 132 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 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-12-14 11:44:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:37,084 INFO L93 Difference]: Finished difference Result 216 states and 500 transitions. [2022-12-14 11:44:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 11:44:37,084 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 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-12-14 11:44:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:37,085 INFO L225 Difference]: With dead ends: 216 [2022-12-14 11:44:37,085 INFO L226 Difference]: Without dead ends: 206 [2022-12-14 11:44:37,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=524, Invalid=2549, Unknown=7, NotChecked=0, Total=3080 [2022-12-14 11:44:37,086 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 48 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:37,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 554 Invalid, 3 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 11:44:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-14 11:44:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 70. [2022-12-14 11:44:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.449275362318841) internal successors, (169), 69 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-12-14 11:44:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 169 transitions. [2022-12-14 11:44:37,089 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 169 transitions. Word has length 16 [2022-12-14 11:44:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:37,090 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 169 transitions. [2022-12-14 11:44:37,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 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-12-14 11:44:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 169 transitions. [2022-12-14 11:44:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:44:37,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:37,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:37,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 11:44:37,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 11:44:37,292 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-12-14 11:44:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1033614332, now seen corresponding path program 6 times [2022-12-14 11:44:37,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:37,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145323437] [2022-12-14 11:44:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:39,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:39,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145323437] [2022-12-14 11:44:39,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145323437] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:39,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617030537] [2022-12-14 11:44:39,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:44:39,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:39,111 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:39,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 11:44:39,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:44:39,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:44:39,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 11:44:39,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:39,523 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 166 treesize of output 150 [2022-12-14 11:44:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:39,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:40,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:44:40,045 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 393 treesize of output 301 [2022-12-14 11:44:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:40,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617030537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:40,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [452650696] [2022-12-14 11:44:40,663 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:40,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:40,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2022-12-14 11:44:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080366814] [2022-12-14 11:44:40,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:40,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 11:44:40,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:40,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 11:44:40,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-12-14 11:44:40,664 INFO L87 Difference]: Start difference. First operand 70 states and 169 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:43,591 INFO L93 Difference]: Finished difference Result 253 states and 581 transitions. [2022-12-14 11:44:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 11:44:43,591 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:44:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:43,592 INFO L225 Difference]: With dead ends: 253 [2022-12-14 11:44:43,592 INFO L226 Difference]: Without dead ends: 239 [2022-12-14 11:44:43,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 11:44:43,593 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:43,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 11:44:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-12-14 11:44:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 108. [2022-12-14 11:44:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.607476635514019) internal successors, (279), 107 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 279 transitions. [2022-12-14 11:44:43,597 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 279 transitions. Word has length 16 [2022-12-14 11:44:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:43,597 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 279 transitions. [2022-12-14 11:44:43,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 279 transitions. [2022-12-14 11:44:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:44:43,598 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:43,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:43,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 11:44:43,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:43,800 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-12-14 11:44:43,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash 938115066, now seen corresponding path program 7 times [2022-12-14 11:44:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:43,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144631126] [2022-12-14 11:44:43,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:44,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:44,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144631126] [2022-12-14 11:44:44,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144631126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083391839] [2022-12-14 11:44:44,964 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 11:44:44,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:44,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:44,965 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:44,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 11:44:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:45,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 11:44:45,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:45,075 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-12-14 11:44:45,120 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-12-14 11:44:45,180 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-12-14 11:44:45,404 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 173 treesize of output 153 [2022-12-14 11:44:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:45,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:46,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083391839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:46,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1330136047] [2022-12-14 11:44:46,478 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:46,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:46,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2022-12-14 11:44:46,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057643908] [2022-12-14 11:44:46,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:46,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 11:44:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 11:44:46,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=469, Unknown=5, NotChecked=0, Total=552 [2022-12-14 11:44:46,479 INFO L87 Difference]: Start difference. First operand 108 states and 279 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 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-12-14 11:44:53,285 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 128 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:44:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:56,921 INFO L93 Difference]: Finished difference Result 218 states and 481 transitions. [2022-12-14 11:44:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 11:44:56,922 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 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-12-14 11:44:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:56,923 INFO L225 Difference]: With dead ends: 218 [2022-12-14 11:44:56,923 INFO L226 Difference]: Without dead ends: 208 [2022-12-14 11:44:56,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=327, Invalid=1830, Unknown=5, NotChecked=0, Total=2162 [2022-12-14 11:44:56,924 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 198 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:56,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 0 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 534 Invalid, 3 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 11:44:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-12-14 11:44:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 112. [2022-12-14 11:44:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.5675675675675675) internal successors, (285), 111 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 285 transitions. [2022-12-14 11:44:56,930 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 285 transitions. Word has length 16 [2022-12-14 11:44:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:56,931 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 285 transitions. [2022-12-14 11:44:56,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 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-12-14 11:44:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 285 transitions. [2022-12-14 11:44:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 11:44:56,932 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:56,932 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:56,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 11:44:57,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 11:44:57,134 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-12-14 11:44:57,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:57,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2144194065, now seen corresponding path program 8 times [2022-12-14 11:44:57,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:57,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239946638] [2022-12-14 11:44:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:57,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:57,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:57,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239946638] [2022-12-14 11:44:57,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239946638] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:57,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859623272] [2022-12-14 11:44:57,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:44:57,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:57,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:57,258 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:57,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 11:44:57,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 11:44:57,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:44:57,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 11:44:57,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:57,433 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:44:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:44:57,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:57,723 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:44:57,723 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 366 treesize of output 270 [2022-12-14 11:44:57,896 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 222 treesize of output 206 [2022-12-14 11:44:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:57,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859623272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:57,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [112003893] [2022-12-14 11:44:57,942 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:57,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:57,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-12-14 11:44:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37973954] [2022-12-14 11:44:57,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:57,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 11:44:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:57,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 11:44:57,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-12-14 11:44:57,943 INFO L87 Difference]: Start difference. First operand 112 states and 285 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:58,339 INFO L93 Difference]: Finished difference Result 180 states and 368 transitions. [2022-12-14 11:44:58,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 11:44:58,339 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 11:44:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:58,341 INFO L225 Difference]: With dead ends: 180 [2022-12-14 11:44:58,341 INFO L226 Difference]: Without dead ends: 148 [2022-12-14 11:44:58,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2022-12-14 11:44:58,342 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:58,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:44:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-12-14 11:44:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 108. [2022-12-14 11:44:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.439252336448598) internal successors, (261), 107 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 261 transitions. [2022-12-14 11:44:58,346 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 261 transitions. Word has length 17 [2022-12-14 11:44:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:58,346 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 261 transitions. [2022-12-14 11:44:58,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 261 transitions. [2022-12-14 11:44:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 11:44:58,346 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:58,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:58,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 11:44:58,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 11:44:58,548 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-12-14 11:44:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:58,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1504606674, now seen corresponding path program 9 times [2022-12-14 11:44:58,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:58,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787265892] [2022-12-14 11:44:58,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:58,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:58,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:58,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787265892] [2022-12-14 11:44:58,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787265892] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:58,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376511716] [2022-12-14 11:44:58,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:44:58,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:58,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:58,691 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:58,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 11:44:58,754 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:44:58,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:44:58,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 11:44:58,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:58,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:58,953 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 222 treesize of output 206 [2022-12-14 11:44:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:59,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376511716] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:59,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2096223481] [2022-12-14 11:44:59,008 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:59,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:59,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-14 11:44:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124409556] [2022-12-14 11:44:59,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:59,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 11:44:59,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:59,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 11:44:59,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:44:59,009 INFO L87 Difference]: Start difference. First operand 108 states and 261 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:59,126 INFO L93 Difference]: Finished difference Result 114 states and 268 transitions. [2022-12-14 11:44:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:44:59,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-14 11:44:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:59,127 INFO L225 Difference]: With dead ends: 114 [2022-12-14 11:44:59,127 INFO L226 Difference]: Without dead ends: 89 [2022-12-14 11:44:59,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-12-14 11:44:59,127 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:59,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:44:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-14 11:44:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-12-14 11:44:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.534090909090909) internal successors, (223), 88 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2022-12-14 11:44:59,130 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 18 [2022-12-14 11:44:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:59,130 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2022-12-14 11:44:59,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2022-12-14 11:44:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 11:44:59,131 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:59,131 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:59,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 11:44:59,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 11:44:59,333 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-12-14 11:44:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:44:59,334 INFO L85 PathProgramCache]: Analyzing trace with hash -20075288, now seen corresponding path program 10 times [2022-12-14 11:44:59,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:44:59,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425970963] [2022-12-14 11:44:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:44:59,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:44:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:59,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:44:59,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425970963] [2022-12-14 11:44:59,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425970963] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:44:59,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842298691] [2022-12-14 11:44:59,458 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 11:44:59,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:44:59,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:44:59,459 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:44:59,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 11:44:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:44:59,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 11:44:59,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:44:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:59,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:44:59,765 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 222 treesize of output 206 [2022-12-14 11:44:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:44:59,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842298691] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:44:59,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1717478902] [2022-12-14 11:44:59,830 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:44:59,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:44:59,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-14 11:44:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101339959] [2022-12-14 11:44:59,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:44:59,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 11:44:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:44:59,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 11:44:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:44:59,831 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:44:59,951 INFO L93 Difference]: Finished difference Result 91 states and 218 transitions. [2022-12-14 11:44:59,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:44:59,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-14 11:44:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:44:59,953 INFO L225 Difference]: With dead ends: 91 [2022-12-14 11:44:59,953 INFO L226 Difference]: Without dead ends: 91 [2022-12-14 11:44:59,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-12-14 11:44:59,953 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:44:59,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:44:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-14 11:44:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 61. [2022-12-14 11:44:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 2.2333333333333334) internal successors, (134), 60 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 134 transitions. [2022-12-14 11:44:59,956 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 134 transitions. Word has length 18 [2022-12-14 11:44:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:44:59,956 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 134 transitions. [2022-12-14 11:44:59,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:44:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 134 transitions. [2022-12-14 11:44:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:44:59,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:44:59,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:44:59,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 11:45:00,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:45:00,158 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-12-14 11:45:00,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:45:00,159 INFO L85 PathProgramCache]: Analyzing trace with hash 756939345, now seen corresponding path program 11 times [2022-12-14 11:45:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:45:00,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436240169] [2022-12-14 11:45:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:45:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:45:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:45:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 11:45:00,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:45:00,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436240169] [2022-12-14 11:45:00,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436240169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:45:00,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270843363] [2022-12-14 11:45:00,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:45:00,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:45:00,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:45:00,288 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:45:00,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 11:45:00,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 11:45:00,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:45:00,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 11:45:00,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:45:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 11:45:00,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:45:00,606 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 269 treesize of output 213 [2022-12-14 11:45:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 11:45:00,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270843363] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:45:00,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1611627693] [2022-12-14 11:45:00,696 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:45:00,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:45:00,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-14 11:45:00,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291721433] [2022-12-14 11:45:00,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:45:00,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 11:45:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:45:00,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 11:45:00,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-12-14 11:45:00,697 INFO L87 Difference]: Start difference. First operand 61 states and 134 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:45:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:45:00,822 INFO L93 Difference]: Finished difference Result 75 states and 168 transitions. [2022-12-14 11:45:00,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:45:00,822 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 11:45:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:45:00,823 INFO L225 Difference]: With dead ends: 75 [2022-12-14 11:45:00,823 INFO L226 Difference]: Without dead ends: 75 [2022-12-14 11:45:00,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-12-14 11:45:00,824 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:45:00,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:45:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-14 11:45:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-12-14 11:45:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.27027027027027) internal successors, (168), 74 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:45:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2022-12-14 11:45:00,827 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 19 [2022-12-14 11:45:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:45:00,827 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2022-12-14 11:45:00,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:45:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2022-12-14 11:45:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 11:45:00,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:45:00,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:45:00,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 11:45:01,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 11:45:01,030 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-12-14 11:45:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:45:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash 85637620, now seen corresponding path program 12 times [2022-12-14 11:45:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:45:01,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547925148] [2022-12-14 11:45:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:45:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:45:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:45:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:45:05,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:45:05,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547925148] [2022-12-14 11:45:05,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547925148] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:45:05,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768306559] [2022-12-14 11:45:05,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:45:05,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:45:05,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:45:05,305 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:45:05,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 11:45:05,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:45:05,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:45:05,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-14 11:45:05,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:45:05,507 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-12-14 11:45:05,561 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-12-14 11:45:06,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:45:06,430 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 97 treesize of output 83 [2022-12-14 11:45:06,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:45:06,821 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 298 treesize of output 202 [2022-12-14 11:45:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:45:07,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:45:09,505 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse0 (not (<= 0 (+ |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483648)))) (.cse1 (not (<= |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483647))) (.cse3 (< |c_thread1Thread1of1ForFork0_#t~ret2#1| c_~cap1~0)) (.cse4 (let ((.cse29 (* c_~j~0 4))) (let ((.cse9 (+ c_~bag1~0 c_~sum1~0 .cse2)) (.cse11 (+ c_~A~0.offset .cse29)) (.cse12 (+ c_~A~0.offset .cse29 4)) (.cse6 (not (< (+ c_~j~0 1) c_~N~0))) (.cse16 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse6 (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse12)) (.cse7 (select .cse10 .cse11))) (or (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (<= (+ .cse8 c_~bag2~0 c_~sum2~0 .cse7) .cse9) (not (<= (+ .cse8 c_~bag2~0 .cse7) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (not (<= 0 (+ .cse8 c_~bag2~0 .cse7 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse12)) (.cse13 (select .cse15 .cse11))) (or (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (not (<= (+ .cse14 c_~bag2~0 .cse13) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse13 2147483648))) (< .cse9 (+ .cse14 c_~bag2~0 c_~sum2~0 .cse13 1)) (not (<= 0 (+ .cse14 c_~bag2~0 .cse13 2147483648)))))))) .cse16) (or (and (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse12)) (.cse18 (select .cse19 .cse11))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (not (<= (+ .cse17 .cse18) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))) (< .cse9 (+ .cse17 c_~bag2~0 c_~sum2~0 .cse18 1)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse18) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse18 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse12)) (.cse21 (select .cse22 .cse11))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (<= (+ .cse20 c_~bag2~0 c_~sum2~0 .cse21) .cse9) (not (<= (+ .cse20 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse21 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse21 2147483648)))))))) .cse6 .cse16) (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse12)) (.cse24 (select .cse25 .cse11))) (or (not (<= 0 (+ .cse23 .cse24 2147483648))) (< c_~bag2~0 (+ .cse23 1)) (not (<= (+ c_~bag2~0 .cse24) 2147483647)) (< .cse9 (+ .cse23 c_~bag2~0 c_~sum2~0 .cse24 1)))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse26 (select .cse28 .cse12)) (.cse27 (select .cse28 .cse11))) (or (not (<= 0 (+ .cse26 .cse27 2147483648))) (< c_~bag2~0 (+ .cse26 1)) (not (<= (+ c_~bag2~0 .cse27) 2147483647)) (<= (+ .cse26 c_~bag2~0 c_~sum2~0 .cse27) .cse9)))))) .cse6 .cse16)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))))))) (.cse5 (< (+ c_~i~0 1) c_~N~0))) (and (or .cse0 .cse1 (not (<= (+ c_~bag1~0 .cse2) 2147483647)) (not .cse3) (not (<= 0 (+ c_~bag1~0 .cse2 2147483648))) .cse4 .cse5) (or .cse0 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse1 .cse3 .cse4 .cse5 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647)))))) is different from false [2022-12-14 11:45:17,077 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)) (.cse7 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse62 (not (< 1 c_~N~0)))) (and (or (and (or .cse0 (and (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse9 .cse7)) (.cse1 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse3 (+ .cse2 .cse1))) (or (not (<= 0 (+ .cse1 2147483648))) (not (<= 0 (+ .cse2 .cse1 2147483648))) (not (<= .cse3 2147483647)) (not (<= .cse1 2147483647)) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse6 (select (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |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|))) (let ((.cse5 (+ (select .cse6 .cse7) .cse4))) (or (not (<= .cse4 2147483647)) (<= .cse5 .cse3) (not (<= .cse5 2147483647)) (not (<= 0 (+ .cse4 2147483648)))))))))))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse17 .cse7)) (.cse10 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse12 (+ .cse11 .cse10))) (or (not (<= 0 (+ .cse10 2147483648))) (not (<= 0 (+ .cse11 .cse10 2147483648))) (not (<= .cse12 2147483647)) (not (<= .cse10 2147483647)) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse15 (select (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (select .cse15 .cse7))) (or (not (<= .cse13 2147483647)) (<= (+ .cse14 .cse13) .cse12) (< 0 (+ .cse14 1)))))))))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse25 .cse7)) (.cse18 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse20 (+ .cse19 .cse18))) (or (not (<= 0 (+ .cse18 2147483648))) (not (<= 0 (+ .cse19 .cse18 2147483648))) (not (<= .cse20 2147483647)) (not (<= .cse18 2147483647)) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (select .cse23 .cse7)) (.cse21 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse21 2147483647)) (not (<= 0 (+ .cse21 2147483648))) (< .cse20 (+ .cse22 .cse21 1)) (not (<= 0 (+ .cse22 .cse21 2147483648))))))))))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse27 (select .cse33 .cse7)) (.cse26 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse28 (+ .cse27 .cse26))) (or (not (<= 0 (+ .cse26 2147483648))) (not (<= 0 (+ .cse27 .cse26 2147483648))) (not (<= .cse28 2147483647)) (not (<= .cse26 2147483647)) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse31 (select (store .cse32 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse31 .cse7)) (.cse29 (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse29 2147483647)) (< .cse28 (+ .cse30 .cse29 1)) (< 0 (+ .cse30 1)) (not (<= 0 (+ .cse30 .cse29 2147483648))))))))))))))) (or .cse0 (and (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse35 (select .cse40 .cse7)) (.cse34 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse34 2147483648) 0) (< (+ .cse35 .cse34 2147483648) 0) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse38 (select (store .cse39 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse37 (select .cse38 .cse7))) (or (not (<= .cse36 2147483647)) (<= (+ .cse37 .cse36) (+ .cse35 .cse34)) (< 0 (+ .cse37 1)))))) (< 2147483646 .cse34)))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse43 (select .cse47 .cse7)) (.cse44 (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse45 (select (store .cse46 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse42 (select .cse45 .cse7)) (.cse41 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse41 2147483647)) (not (<= (+ .cse42 .cse41) 2147483647)) (not (<= 0 (+ .cse41 2147483648))) (< (+ .cse43 .cse44) (+ .cse42 .cse41 1)) (not (<= 0 (+ .cse42 .cse41 2147483648))))))) (< (+ .cse44 2147483648) 0) (< (+ .cse43 .cse44 2147483648) 0) (< 2147483646 .cse44)))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse49 (select .cse54 .cse7)) (.cse48 (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse48 2147483648) 0) (< (+ .cse49 .cse48 2147483648) 0) (< 2147483646 .cse48) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse52 (select (store .cse53 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse51 (+ (select .cse52 .cse7) .cse50))) (or (not (<= .cse50 2147483647)) (<= .cse51 (+ .cse49 .cse48)) (not (<= .cse51 2147483647)) (not (<= 0 (+ .cse50 2147483648))))))))))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse56 (select .cse61 .cse7)) (.cse55 (select .cse61 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse55 2147483648) 0) (< (+ .cse56 .cse55 2147483648) 0) (< 2147483646 .cse55) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse59 (select (store .cse60 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse58 (select .cse59 .cse7)) (.cse57 (select .cse59 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse57 2147483647)) (< (+ .cse56 .cse55) (+ .cse58 .cse57 1)) (< 0 (+ .cse58 1)) (not (<= 0 (+ .cse58 .cse57 2147483648))))))))))))))) .cse62) (or (and (or .cse0 (and (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse69 (select .cse68 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse64 (select .cse69 .cse7)) (.cse63 (select .cse69 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse63 2147483648) 0) (< 2147483647 .cse63) (< (+ .cse64 .cse63 2147483648) 0) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse67 (select (store .cse68 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse65 (select .cse67 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse66 (select .cse67 .cse7))) (or (not (<= .cse65 2147483647)) (<= (+ .cse66 .cse65) (+ .cse64 .cse63)) (< 0 (+ .cse66 1))))))))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse75 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse76 (select .cse75 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse71 (select .cse76 .cse7)) (.cse70 (select .cse76 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse70 2147483648) 0) (< 2147483647 .cse70) (< (+ .cse71 .cse70 2147483648) 0) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse74 (select (store .cse75 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse72 (select .cse74 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse73 (+ (select .cse74 .cse7) .cse72))) (or (not (<= .cse72 2147483647)) (<= .cse73 (+ .cse71 .cse70)) (not (<= .cse73 2147483647)) (not (<= 0 (+ .cse72 2147483648))))))))))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse83 (select .cse82 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse79 (select .cse83 .cse7)) (.cse80 (select .cse83 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse81 (select (store .cse82 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse78 (select .cse81 .cse7)) (.cse77 (select .cse81 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse77 2147483647)) (not (<= (+ .cse78 .cse77) 2147483647)) (not (<= 0 (+ .cse77 2147483648))) (< (+ .cse79 .cse80) (+ .cse78 .cse77 1)) (not (<= 0 (+ .cse78 .cse77 2147483648))))))) (< (+ .cse80 2147483648) 0) (< 2147483647 .cse80) (< (+ .cse79 .cse80 2147483648) 0)))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse85 (select .cse90 .cse7)) (.cse84 (select .cse90 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse84 2147483648) 0) (< 2147483647 .cse84) (< (+ .cse85 .cse84 2147483648) 0) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse88 (select (store .cse89 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse87 (select .cse88 .cse7)) (.cse86 (select .cse88 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse86 2147483647)) (< (+ .cse85 .cse84) (+ .cse87 .cse86 1)) (< 0 (+ .cse87 1)) (not (<= 0 (+ .cse87 .cse86 2147483648)))))))))))))) (or .cse0 (and (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse97 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse98 (select .cse97 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse93 (select .cse98 .cse7)) (.cse92 (select .cse98 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse91 (+ .cse93 .cse92))) (or (< 2147483647 .cse91) (< 2147483647 .cse92) (< (+ .cse93 .cse92 2147483648) 0) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse96 (select (store .cse97 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse94 (select .cse96 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse95 (+ (select .cse96 .cse7) .cse94))) (or (not (<= .cse94 2147483647)) (<= .cse95 .cse91) (not (<= .cse95 2147483647)) (not (<= 0 (+ .cse94 2147483648)))))))))))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse105 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse106 (select .cse105 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse101 (select .cse106 .cse7)) (.cse100 (select .cse106 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse99 (+ .cse101 .cse100))) (or (< 2147483647 .cse99) (< 2147483647 .cse100) (< (+ .cse101 .cse100 2147483648) 0) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse104 (select (store .cse105 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse102 (select .cse104 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse103 (select .cse104 .cse7))) (or (not (<= .cse102 2147483647)) (<= (+ .cse103 .cse102) .cse99) (< 0 (+ .cse103 1)))))))))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse114 (select .cse113 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse109 (select .cse114 .cse7)) (.cse108 (select .cse114 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse107 (+ .cse109 .cse108))) (or (< 2147483647 .cse107) (< 2147483647 .cse108) (< (+ .cse109 .cse108 2147483648) 0) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse112 (select (store .cse113 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse111 (select .cse112 .cse7)) (.cse110 (select .cse112 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse110 2147483647)) (< .cse107 (+ .cse111 .cse110 1)) (< 0 (+ .cse111 1)) (not (<= 0 (+ .cse111 .cse110 2147483648))))))))))))) (forall ((v_ArrVal_495 (Array Int Int))) (let ((.cse121 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_495))) (let ((.cse122 (select .cse121 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse117 (select .cse122 .cse7)) (.cse116 (select .cse122 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse115 (+ .cse117 .cse116))) (or (< 2147483647 .cse115) (< 2147483647 .cse116) (< (+ .cse117 .cse116 2147483648) 0) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse120 (select (store .cse121 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse119 (select .cse120 .cse7)) (.cse118 (select .cse120 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse118 2147483647)) (not (<= 0 (+ .cse118 2147483648))) (< .cse115 (+ .cse119 .cse118 1)) (not (<= 0 (+ .cse119 .cse118 2147483648)))))))))))))))) .cse62)))) is different from false [2022-12-14 11:45:17,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:45:17,367 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 315 treesize of output 171 [2022-12-14 11:45:17,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:45:17,381 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 953 treesize of output 813 [2022-12-14 11:45:17,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:45:17,408 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 579 treesize of output 527 [2022-12-14 11:45:17,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:45:17,425 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 501 treesize of output 431 [2022-12-14 11:45:17,546 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,546 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 316 treesize of output 1 [2022-12-14 11:45:17,552 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,552 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 262 treesize of output 1 [2022-12-14 11:45:17,560 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,560 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 313 treesize of output 1 [2022-12-14 11:45:17,571 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,572 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 241 treesize of output 1 [2022-12-14 11:45:17,579 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,580 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 346 treesize of output 1 [2022-12-14 11:45:17,587 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,588 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 295 treesize of output 1 [2022-12-14 11:45:17,595 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,596 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 292 treesize of output 1 [2022-12-14 11:45:17,613 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,613 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 344 treesize of output 1 [2022-12-14 11:45:17,620 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,620 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 341 treesize of output 1 [2022-12-14 11:45:17,628 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,628 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 343 treesize of output 1 [2022-12-14 11:45:17,635 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,635 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 290 treesize of output 1 [2022-12-14 11:45:17,646 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,646 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 346 treesize of output 1 [2022-12-14 11:45:17,653 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,653 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 241 treesize of output 1 [2022-12-14 11:45:17,661 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 1 [2022-12-14 11:45:17,669 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:45:17,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 1 [2022-12-14 11:45:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 11:45:17,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768306559] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:45:17,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [742253876] [2022-12-14 11:45:17,793 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:45:17,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:45:17,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-12-14 11:45:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848181503] [2022-12-14 11:45:17,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:45:17,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 11:45:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:45:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 11:45:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1170, Unknown=6, NotChecked=146, Total=1560 [2022-12-14 11:45:17,796 INFO L87 Difference]: Start difference. First operand 75 states and 168 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-12-14 11:45:41,161 WARN L233 SmtUtils]: Spent 22.11s on a formula simplification. DAG size of input: 278 DAG size of output: 218 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:45:59,561 WARN L233 SmtUtils]: Spent 17.09s on a formula simplification. DAG size of input: 302 DAG size of output: 237 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:46:33,101 WARN L233 SmtUtils]: Spent 29.17s on a formula simplification. DAG size of input: 170 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:46:52,820 WARN L233 SmtUtils]: Spent 19.52s on a formula simplification. DAG size of input: 220 DAG size of output: 175 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:47:19,089 WARN L233 SmtUtils]: Spent 15.20s on a formula simplification. DAG size of input: 296 DAG size of output: 257 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:47:25,164 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 290 DAG size of output: 289 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:47:39,655 WARN L233 SmtUtils]: Spent 9.60s on a formula simplification. DAG size of input: 230 DAG size of output: 184 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:47:49,894 WARN L233 SmtUtils]: Spent 9.61s on a formula simplification. DAG size of input: 300 DAG size of output: 261 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:47:57,769 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 299 DAG size of output: 298 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:48:12,676 WARN L233 SmtUtils]: Spent 7.25s on a formula simplification. DAG size of input: 295 DAG size of output: 294 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:48:14,224 WARN L837 $PredicateComparison]: unable to prove that (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|)))) (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) (<= c_~sum2~0 2147483647) (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 (let ((.cse27 (* c_~j~0 4))) (let ((.cse5 (+ c_~bag1~0 c_~sum1~0)) (.cse8 (+ c_~A~0.offset .cse27)) (.cse9 (+ c_~A~0.offset .cse27 4)) (.cse13 (not (< (+ c_~j~0 1) c_~N~0))) (.cse14 (< (+ 2 c_~j~0) c_~N~0))) (and (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse9)) (.cse4 (select .cse7 .cse8))) (or (not (<= (+ c_~bag2~0 .cse4) 2147483647)) (< .cse5 (+ .cse6 c_~bag2~0 c_~sum2~0 .cse4 1)) (not (<= (+ .cse6 c_~bag2~0 .cse4) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse4 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 .cse4 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse9)) (.cse10 (select .cse12 .cse8))) (or (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (<= (+ .cse11 c_~bag2~0 c_~sum2~0 .cse10) .cse5) (not (<= (+ .cse11 c_~bag2~0 .cse10) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse10 2147483648))) (not (<= 0 (+ .cse11 c_~bag2~0 .cse10 2147483648)))))))) .cse13 .cse14) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse13 (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse9)) (.cse16 (select .cse17 .cse8))) (or (not (<= 0 (+ .cse15 .cse16 2147483648))) (< c_~bag2~0 (+ .cse15 1)) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (<= (+ .cse15 c_~bag2~0 c_~sum2~0 .cse16) .cse5))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse9)) (.cse19 (select .cse20 .cse8))) (or (not (<= 0 (+ .cse18 .cse19 2147483648))) (< c_~bag2~0 (+ .cse18 1)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (< .cse5 (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19 1))))))) .cse14) (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse9)) (.cse22 (select .cse23 .cse8))) (or (not (<= 0 (+ .cse21 .cse22 2147483648))) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (<= (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22) .cse5) (not (<= (+ .cse21 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse22 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse22 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse24 (select .cse26 .cse9)) (.cse25 (select .cse26 .cse8))) (or (not (<= 0 (+ .cse24 .cse25 2147483648))) (not (<= (+ c_~bag2~0 .cse25) 2147483647)) (not (<= (+ .cse24 .cse25) 2147483647)) (< .cse5 (+ .cse24 c_~bag2~0 c_~sum2~0 .cse25 1)) (not (<= 0 (+ c_~bag2~0 .cse25 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse25) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse25 2147483648)))))))) .cse13 .cse14)))))) (< c_~i~0 c_~N~0)) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum2~0 2147483648)))) is different from false [2022-12-14 11:48:25,446 WARN L233 SmtUtils]: Spent 9.44s on a formula simplification. DAG size of input: 285 DAG size of output: 284 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:48:25,477 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (let ((.cse24 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse5 (+ c_~A~0.offset .cse24)) (.cse6 (+ 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_496 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse3 (select .cse4 .cse6)) (.cse1 (select .cse4 .cse5))) (or (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (< .cse2 (+ .cse3 c_~bag2~0 c_~sum2~0 .cse1 1)) (not (<= (+ .cse3 c_~bag2~0 .cse1) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse1 2147483648))) (not (<= 0 (+ .cse3 c_~bag2~0 .cse1 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse6)) (.cse7 (select .cse9 .cse5))) (or (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (<= (+ .cse8 c_~bag2~0 c_~sum2~0 .cse7) .cse2) (not (<= (+ .cse8 c_~bag2~0 .cse7) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (not (<= 0 (+ .cse8 c_~bag2~0 .cse7 2147483648)))))))) .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_496 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse6)) (.cse13 (select .cse14 .cse5))) (or (not (<= 0 (+ .cse12 .cse13 2147483648))) (< c_~bag2~0 (+ .cse12 1)) (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (<= (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13) .cse2))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse6)) (.cse16 (select .cse17 .cse5))) (or (not (<= 0 (+ .cse15 .cse16 2147483648))) (< c_~bag2~0 (+ .cse15 1)) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (< .cse2 (+ .cse15 c_~bag2~0 c_~sum2~0 .cse16 1))))))) .cse11) (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse6)) (.cse19 (select .cse20 .cse5))) (or (not (<= 0 (+ .cse18 .cse19 2147483648))) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (<= (+ .cse18 c_~bag2~0 c_~sum2~0 .cse19) .cse2) (not (<= (+ .cse18 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse19 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse6)) (.cse22 (select .cse23 .cse5))) (or (not (<= 0 (+ .cse21 .cse22 2147483648))) (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= (+ .cse21 .cse22) 2147483647)) (< .cse2 (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22 1)) (not (<= 0 (+ c_~bag2~0 .cse22 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse22 2147483648)))))))) .cse10 .cse11)))))) (< c_~i~0 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) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-12-14 11:48:42,703 WARN L233 SmtUtils]: Spent 15.50s on a formula simplification. DAG size of input: 290 DAG size of output: 289 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:48:53,646 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 300 DAG size of output: 299 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:49:01,884 WARN L233 SmtUtils]: Spent 7.53s on a formula simplification. DAG size of input: 278 DAG size of output: 277 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:49:05,967 WARN L837 $PredicateComparison]: unable to prove that (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|)))) (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 .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 (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse6 (let ((.cse31 (* c_~j~0 4))) (let ((.cse11 (+ c_~bag1~0 c_~sum1~0 .cse4)) (.cse13 (+ c_~A~0.offset .cse31)) (.cse14 (+ c_~A~0.offset .cse31 4)) (.cse8 (not (< (+ c_~j~0 1) c_~N~0))) (.cse18 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse8 (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse10 (select .cse12 .cse14)) (.cse9 (select .cse12 .cse13))) (or (not (<= (+ c_~bag2~0 .cse9) 2147483647)) (<= (+ .cse10 c_~bag2~0 c_~sum2~0 .cse9) .cse11) (not (<= (+ .cse10 c_~bag2~0 .cse9) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse9 2147483648))) (not (<= 0 (+ .cse10 c_~bag2~0 .cse9 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse14)) (.cse15 (select .cse17 .cse13))) (or (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (not (<= (+ .cse16 c_~bag2~0 .cse15) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (< .cse11 (+ .cse16 c_~bag2~0 c_~sum2~0 .cse15 1)) (not (<= 0 (+ .cse16 c_~bag2~0 .cse15 2147483648)))))))) .cse18) (or (and (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse14)) (.cse20 (select .cse21 .cse13))) (or (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (not (<= (+ .cse19 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (< .cse11 (+ .cse19 c_~bag2~0 c_~sum2~0 .cse20 1)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse20 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse14)) (.cse23 (select .cse24 .cse13))) (or (not (<= 0 (+ .cse22 .cse23 2147483648))) (not (<= (+ c_~bag2~0 .cse23) 2147483647)) (<= (+ .cse22 c_~bag2~0 c_~sum2~0 .cse23) .cse11) (not (<= (+ .cse22 .cse23) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse23 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse23) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse23 2147483648)))))))) .cse8 .cse18) (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse14)) (.cse26 (select .cse27 .cse13))) (or (not (<= 0 (+ .cse25 .cse26 2147483648))) (< c_~bag2~0 (+ .cse25 1)) (not (<= (+ c_~bag2~0 .cse26) 2147483647)) (< .cse11 (+ .cse25 c_~bag2~0 c_~sum2~0 .cse26 1)))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse28 (select .cse30 .cse14)) (.cse29 (select .cse30 .cse13))) (or (not (<= 0 (+ .cse28 .cse29 2147483648))) (< c_~bag2~0 (+ .cse28 1)) (not (<= (+ c_~bag2~0 .cse29) 2147483647)) (<= (+ .cse28 c_~bag2~0 c_~sum2~0 .cse29) .cse11)))))) .cse8 .cse18)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))))))) (.cse7 (< (+ c_~i~0 1) c_~N~0)) (.cse5 (+ c_~bag1~0 .cse4 2147483648))) (and (or (< (+ 2147483647 c_~cap1~0) 0) (not (<= (+ c_~bag1~0 .cse4) 2147483647)) (not (<= 0 .cse5)) .cse6 .cse7) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (< 2147483647 c_~cap1~0) .cse6 .cse7 (< .cse5 0) (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647)))))) (not (< c_~i~0 c_~N~0))))) is different from false [2022-12-14 11:49:05,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse53 (* c_~j~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|))) (.cse5 (+ c_~bag1~0 c_~sum1~0)) (.cse8 (+ c_~A~0.offset .cse53)) (.cse9 (+ c_~A~0.offset .cse53 4)) (.cse13 (not (< (+ c_~j~0 1) c_~N~0))) (.cse14 (< (+ 2 c_~j~0) c_~N~0)) (.cse15 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse16 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse29 (< c_~i~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 .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 (and (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse9)) (.cse4 (select .cse7 .cse8))) (or (not (<= (+ c_~bag2~0 .cse4) 2147483647)) (< .cse5 (+ .cse6 c_~bag2~0 c_~sum2~0 .cse4 1)) (not (<= (+ .cse6 c_~bag2~0 .cse4) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse4 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 .cse4 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse9)) (.cse10 (select .cse12 .cse8))) (or (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (<= (+ .cse11 c_~bag2~0 c_~sum2~0 .cse10) .cse5) (not (<= (+ .cse11 c_~bag2~0 .cse10) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse10 2147483648))) (not (<= 0 (+ .cse11 c_~bag2~0 .cse10 2147483648)))))))) .cse13 .cse14) (or .cse15 .cse16 (and (or .cse13 (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse9)) (.cse18 (select .cse19 .cse8))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (< c_~bag2~0 (+ .cse17 1)) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (<= (+ .cse17 c_~bag2~0 c_~sum2~0 .cse18) .cse5))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse9)) (.cse21 (select .cse22 .cse8))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (< c_~bag2~0 (+ .cse20 1)) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (< .cse5 (+ .cse20 c_~bag2~0 c_~sum2~0 .cse21 1))))))) .cse14) (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse9)) (.cse24 (select .cse25 .cse8))) (or (not (<= 0 (+ .cse23 .cse24 2147483648))) (not (<= (+ c_~bag2~0 .cse24) 2147483647)) (<= (+ .cse23 c_~bag2~0 c_~sum2~0 .cse24) .cse5) (not (<= (+ .cse23 .cse24) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse24 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse24) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse24 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse26 (select .cse28 .cse9)) (.cse27 (select .cse28 .cse8))) (or (not (<= 0 (+ .cse26 .cse27 2147483648))) (not (<= (+ c_~bag2~0 .cse27) 2147483647)) (not (<= (+ .cse26 .cse27) 2147483647)) (< .cse5 (+ .cse26 c_~bag2~0 c_~sum2~0 .cse27 1)) (not (<= 0 (+ c_~bag2~0 .cse27 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse27) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse27 2147483648)))))))) .cse13 .cse14)))) .cse29) (or (let ((.cse30 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse32 (let ((.cse36 (+ c_~bag1~0 c_~sum1~0 .cse30))) (and (or .cse13 (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse35 (select .cse37 .cse9)) (.cse34 (select .cse37 .cse8))) (or (not (<= (+ c_~bag2~0 .cse34) 2147483647)) (<= (+ .cse35 c_~bag2~0 c_~sum2~0 .cse34) .cse36) (not (<= (+ .cse35 c_~bag2~0 .cse34) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse34 2147483648))) (not (<= 0 (+ .cse35 c_~bag2~0 .cse34 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse39 (select .cse40 .cse9)) (.cse38 (select .cse40 .cse8))) (or (not (<= (+ c_~bag2~0 .cse38) 2147483647)) (not (<= (+ .cse39 c_~bag2~0 .cse38) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse38 2147483648))) (< .cse36 (+ .cse39 c_~bag2~0 c_~sum2~0 .cse38 1)) (not (<= 0 (+ .cse39 c_~bag2~0 .cse38 2147483648)))))))) .cse14) (or (and (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse41 (select .cse43 .cse9)) (.cse42 (select .cse43 .cse8))) (or (not (<= 0 (+ .cse41 .cse42 2147483648))) (not (<= (+ c_~bag2~0 .cse42) 2147483647)) (not (<= (+ .cse41 .cse42) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse42 2147483648))) (< .cse36 (+ .cse41 c_~bag2~0 c_~sum2~0 .cse42 1)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse42) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse42 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse44 (select .cse46 .cse9)) (.cse45 (select .cse46 .cse8))) (or (not (<= 0 (+ .cse44 .cse45 2147483648))) (not (<= (+ c_~bag2~0 .cse45) 2147483647)) (<= (+ .cse44 c_~bag2~0 c_~sum2~0 .cse45) .cse36) (not (<= (+ .cse44 .cse45) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse45 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse45) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse45 2147483648)))))))) .cse13 .cse14) (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse47 (select .cse49 .cse9)) (.cse48 (select .cse49 .cse8))) (or (not (<= 0 (+ .cse47 .cse48 2147483648))) (< c_~bag2~0 (+ .cse47 1)) (not (<= (+ c_~bag2~0 .cse48) 2147483647)) (< .cse36 (+ .cse47 c_~bag2~0 c_~sum2~0 .cse48 1)))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse50 (select .cse52 .cse9)) (.cse51 (select .cse52 .cse8))) (or (not (<= 0 (+ .cse50 .cse51 2147483648))) (< c_~bag2~0 (+ .cse50 1)) (not (<= (+ c_~bag2~0 .cse51) 2147483647)) (<= (+ .cse50 c_~bag2~0 c_~sum2~0 .cse51) .cse36)))))) .cse13 .cse14)) .cse15 .cse16)))) (.cse33 (< (+ c_~i~0 1) c_~N~0)) (.cse31 (+ c_~bag1~0 .cse30 2147483648))) (and (or (< (+ 2147483647 c_~cap1~0) 0) (not (<= (+ c_~bag1~0 .cse30) 2147483647)) (not (<= 0 .cse31)) .cse32 .cse33) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (< 2147483647 c_~cap1~0) .cse32 .cse33 (< .cse31 0) (not (<= .cse5 2147483647)))))) (not .cse29))))) is different from false [2022-12-14 11:49:14,226 WARN L233 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 273 DAG size of output: 272 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:49:28,693 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 287 DAG size of output: 286 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:49:34,779 WARN L233 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 283 DAG size of output: 282 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:49:37,738 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse49 (* c_~j~0 4))) (let ((.cse1 (+ 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 (< (+ 2 c_~j~0) c_~N~0)) (.cse11 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse12 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse25 (< c_~i~0 c_~N~0))) (and (or (and (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (< .cse1 (+ .cse2 c_~bag2~0 c_~sum2~0 .cse0 1)) (not (<= (+ .cse2 c_~bag2~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= 0 (+ .cse2 c_~bag2~0 .cse0 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse5)) (.cse6 (select .cse8 .cse4))) (or (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (<= (+ .cse7 c_~bag2~0 c_~sum2~0 .cse6) .cse1) (not (<= (+ .cse7 c_~bag2~0 .cse6) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (not (<= 0 (+ .cse7 c_~bag2~0 .cse6 2147483648)))))))) .cse9 .cse10) (or .cse11 .cse12 (and (or .cse9 (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (not (<= 0 (+ .cse13 .cse14 2147483648))) (< c_~bag2~0 (+ .cse13 1)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (<= (+ .cse13 c_~bag2~0 c_~sum2~0 .cse14) .cse1))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse5)) (.cse17 (select .cse18 .cse4))) (or (not (<= 0 (+ .cse16 .cse17 2147483648))) (< c_~bag2~0 (+ .cse16 1)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (< .cse1 (+ .cse16 c_~bag2~0 c_~sum2~0 .cse17 1))))))) .cse10) (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse5)) (.cse20 (select .cse21 .cse4))) (or (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (<= (+ .cse19 c_~bag2~0 c_~sum2~0 .cse20) .cse1) (not (<= (+ .cse19 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse20 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse5)) (.cse23 (select .cse24 .cse4))) (or (not (<= 0 (+ .cse22 .cse23 2147483648))) (not (<= (+ c_~bag2~0 .cse23) 2147483647)) (not (<= (+ .cse22 .cse23) 2147483647)) (< .cse1 (+ .cse22 c_~bag2~0 c_~sum2~0 .cse23 1)) (not (<= 0 (+ c_~bag2~0 .cse23 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse23) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse23 2147483648)))))))) .cse9 .cse10)))) .cse25) (or (let ((.cse26 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse28 (let ((.cse32 (+ c_~bag1~0 c_~sum1~0 .cse26))) (and (or .cse9 (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse31 (select .cse33 .cse5)) (.cse30 (select .cse33 .cse4))) (or (not (<= (+ c_~bag2~0 .cse30) 2147483647)) (<= (+ .cse31 c_~bag2~0 c_~sum2~0 .cse30) .cse32) (not (<= (+ .cse31 c_~bag2~0 .cse30) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse30 2147483648))) (not (<= 0 (+ .cse31 c_~bag2~0 .cse30 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse5)) (.cse34 (select .cse36 .cse4))) (or (not (<= (+ c_~bag2~0 .cse34) 2147483647)) (not (<= (+ .cse35 c_~bag2~0 .cse34) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse34 2147483648))) (< .cse32 (+ .cse35 c_~bag2~0 c_~sum2~0 .cse34 1)) (not (<= 0 (+ .cse35 c_~bag2~0 .cse34 2147483648)))))))) .cse10) (or (and (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse37 (select .cse39 .cse5)) (.cse38 (select .cse39 .cse4))) (or (not (<= 0 (+ .cse37 .cse38 2147483648))) (not (<= (+ c_~bag2~0 .cse38) 2147483647)) (not (<= (+ .cse37 .cse38) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse38 2147483648))) (< .cse32 (+ .cse37 c_~bag2~0 c_~sum2~0 .cse38 1)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse38) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse38 2147483648))))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse40 (select .cse42 .cse5)) (.cse41 (select .cse42 .cse4))) (or (not (<= 0 (+ .cse40 .cse41 2147483648))) (not (<= (+ c_~bag2~0 .cse41) 2147483647)) (<= (+ .cse40 c_~bag2~0 c_~sum2~0 .cse41) .cse32) (not (<= (+ .cse40 .cse41) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse41 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse41) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse41 2147483648)))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse43 (select .cse45 .cse5)) (.cse44 (select .cse45 .cse4))) (or (not (<= 0 (+ .cse43 .cse44 2147483648))) (< c_~bag2~0 (+ .cse43 1)) (not (<= (+ c_~bag2~0 .cse44) 2147483647)) (< .cse32 (+ .cse43 c_~bag2~0 c_~sum2~0 .cse44 1)))))) (forall ((v_ArrVal_496 (Array Int Int))) (let ((.cse48 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_496) c_~A~0.base))) (let ((.cse46 (select .cse48 .cse5)) (.cse47 (select .cse48 .cse4))) (or (not (<= 0 (+ .cse46 .cse47 2147483648))) (< c_~bag2~0 (+ .cse46 1)) (not (<= (+ c_~bag2~0 .cse47) 2147483647)) (<= (+ .cse46 c_~bag2~0 c_~sum2~0 .cse47) .cse32)))))) .cse9 .cse10)) .cse11 .cse12)))) (.cse29 (< (+ c_~i~0 1) c_~N~0)) (.cse27 (+ c_~bag1~0 .cse26 2147483648))) (and (or (< (+ 2147483647 c_~cap1~0) 0) (not (<= (+ c_~bag1~0 .cse26) 2147483647)) (not (<= 0 .cse27)) .cse28 .cse29) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (< 2147483647 c_~cap1~0) .cse28 .cse29 (< .cse27 0) (not (<= .cse1 2147483647)))))) (not .cse25))))) is different from false [2022-12-14 11:49:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:45,198 INFO L93 Difference]: Finished difference Result 572 states and 1267 transitions. [2022-12-14 11:49:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-12-14 11:49:45,198 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-12-14 11:49:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:45,200 INFO L225 Difference]: With dead ends: 572 [2022-12-14 11:49:45,200 INFO L226 Difference]: Without dead ends: 555 [2022-12-14 11:49:45,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 120 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4777 ImplicationChecksByTransitivity, 267.2s TimeCoverageRelationStatistics Valid=2397, Invalid=10681, Unknown=60, NotChecked=1624, Total=14762 [2022-12-14 11:49:45,202 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 565 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 168 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:45,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 0 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1162 Invalid, 39 Unknown, 346 Unchecked, 3.8s Time] [2022-12-14 11:49:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-12-14 11:49:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 117. [2022-12-14 11:49:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.310344827586207) internal successors, (268), 116 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 268 transitions. [2022-12-14 11:49:45,207 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 268 transitions. Word has length 20 [2022-12-14 11:49:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:45,207 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 268 transitions. [2022-12-14 11:49:45,207 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-12-14 11:49:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 268 transitions. [2022-12-14 11:49:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 11:49:45,208 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:45,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:45,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 11:49:45,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 11:49:45,409 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-12-14 11:49:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:45,410 INFO L85 PathProgramCache]: Analyzing trace with hash 183515470, now seen corresponding path program 13 times [2022-12-14 11:49:45,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:45,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407854283] [2022-12-14 11:49:45,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:45,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:47,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:47,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407854283] [2022-12-14 11:49:47,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407854283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830254789] [2022-12-14 11:49:47,551 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 11:49:47,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:47,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:47,551 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:47,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 11:49:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:47,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-14 11:49:47,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:47,738 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-12-14 11:49:47,792 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-12-14 11:49:48,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:48,309 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 174 treesize of output 154 [2022-12-14 11:49:48,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:49:48,761 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 311 treesize of output 207 [2022-12-14 11:49:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:49,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:50,170 WARN L837 $PredicateComparison]: unable to prove that (or (< c_~i~0 c_~N~0) (let ((.cse22 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse22 4)) (.cse5 (+ c_~A~0.offset .cse22)) (.cse9 (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 (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (<= (+ .cse0 .cse1 c_~bag2~0 c_~sum2~0) .cse2) (not (<= 0 (+ .cse0 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse0 .cse1) 2147483647)) (not (<= (+ .cse0 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse0 .cse1 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse6 .cse7) 2147483647)) (not (<= (+ .cse6 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse6 .cse7 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse6 .cse7 2147483648)))))))) .cse9) (or .cse9 (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse5)) (.cse10 (select .cse12 .cse4))) (or (< c_~bag2~0 (+ .cse10 1)) (not (<= (+ .cse11 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse11 .cse10 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse11 .cse10 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (<= (+ .cse13 .cse14 c_~bag2~0 c_~sum2~0) .cse2) (< c_~bag2~0 (+ .cse14 1)) (not (<= (+ .cse13 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse13 .cse14 2147483648))))))))))) (or (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse5)) (.cse17 (select .cse18 .cse4))) (or (not (<= 0 (+ .cse16 c_~bag2~0 2147483648))) (<= (+ .cse16 .cse17 c_~bag2~0 c_~sum2~0) .cse2) (not (<= (+ .cse16 .cse17 c_~bag2~0) 2147483647)) (not (<= (+ .cse16 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse16 .cse17 c_~bag2~0 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse5)) (.cse20 (select .cse21 .cse4))) (or (not (<= 0 (+ .cse19 c_~bag2~0 2147483648))) (not (<= (+ .cse19 .cse20 c_~bag2~0) 2147483647)) (not (<= (+ .cse19 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse19 .cse20 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse19 .cse20 c_~bag2~0 2147483648)))))))) .cse9))))) is different from false [2022-12-14 11:49:50,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse0 (not (<= 0 (+ |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483648)))) (.cse1 (let ((.cse28 (* c_~j~0 4))) (let ((.cse8 (+ c_~bag1~0 c_~sum1~0 .cse3)) (.cse10 (+ c_~A~0.offset .cse28 4)) (.cse11 (+ c_~A~0.offset .cse28)) (.cse15 (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 (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse6 (select .cse9 .cse11)) (.cse7 (select .cse9 .cse10))) (or (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse6 .cse7) 2147483647)) (<= (+ .cse6 .cse7 c_~bag2~0 c_~sum2~0) .cse8) (not (<= (+ .cse6 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse6 .cse7 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse11)) (.cse13 (select .cse14 .cse10))) (or (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse12 c_~bag2~0 c_~sum2~0 2147483648))) (<= .cse8 (+ .cse12 .cse13 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse12 .cse13) 2147483647)) (not (<= (+ .cse12 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse12 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse12 .cse13 2147483648)))))))) .cse15) (or (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse11)) (.cse17 (select .cse18 .cse10))) (or (<= (+ .cse16 .cse17 c_~bag2~0 c_~sum2~0) .cse8) (< c_~bag2~0 (+ .cse17 1)) (not (<= (+ .cse16 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse16 .cse17 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse11)) (.cse20 (select .cse21 .cse10))) (or (<= .cse8 (+ .cse19 .cse20 c_~bag2~0 c_~sum2~0)) (< c_~bag2~0 (+ .cse20 1)) (not (<= (+ .cse19 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse19 .cse20 2147483648)))))))) .cse15))) (or (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse11)) (.cse23 (select .cse24 .cse10))) (or (not (<= 0 (+ .cse22 c_~bag2~0 2147483648))) (<= (+ .cse22 .cse23 c_~bag2~0 c_~sum2~0) .cse8) (not (<= (+ .cse22 .cse23 c_~bag2~0) 2147483647)) (not (<= (+ .cse22 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse22 .cse23 c_~bag2~0 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse11)) (.cse26 (select .cse27 .cse10))) (or (not (<= 0 (+ .cse25 c_~bag2~0 2147483648))) (<= .cse8 (+ .cse25 .cse26 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse25 .cse26 c_~bag2~0) 2147483647)) (not (<= (+ .cse25 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse25 .cse26 c_~bag2~0 2147483648)))))))) .cse15))))) (.cse2 (not (<= |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483647))) (.cse4 (< |c_thread1Thread1of1ForFork0_#t~ret2#1| c_~cap1~0)) (.cse5 (< (+ c_~i~0 1) c_~N~0))) (and (or .cse0 .cse1 .cse2 (not (<= (+ c_~bag1~0 .cse3) 2147483647)) (not .cse4) (not (<= 0 (+ c_~bag1~0 .cse3 2147483648))) .cse5) (or .cse0 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse1 .cse2 .cse4 .cse5 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647)))))) is different from false [2022-12-14 11:49:51,115 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse5 (+ c_~bag1~0 .cse6))) (let ((.cse0 (let ((.cse29 (* c_~j~0 4))) (let ((.cse9 (+ c_~bag1~0 c_~sum1~0 .cse6)) (.cse11 (+ c_~A~0.offset .cse29 4)) (.cse12 (+ c_~A~0.offset .cse29)) (.cse16 (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 (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse7 (select .cse10 .cse12)) (.cse8 (select .cse10 .cse11))) (or (not (<= 0 (+ .cse7 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse7 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse7 .cse8) 2147483647)) (<= (+ .cse7 .cse8 c_~bag2~0 c_~sum2~0) .cse9) (not (<= (+ .cse7 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse7 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse7 .cse8 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse12)) (.cse14 (select .cse15 .cse11))) (or (not (<= 0 (+ .cse13 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse13 c_~bag2~0 c_~sum2~0 2147483648))) (<= .cse9 (+ .cse13 .cse14 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse13 .cse14) 2147483647)) (not (<= (+ .cse13 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse13 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse13 .cse14 2147483648)))))))) .cse16) (or (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse12)) (.cse18 (select .cse19 .cse11))) (or (<= (+ .cse17 .cse18 c_~bag2~0 c_~sum2~0) .cse9) (< c_~bag2~0 (+ .cse18 1)) (not (<= (+ .cse17 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse17 .cse18 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse12)) (.cse21 (select .cse22 .cse11))) (or (<= .cse9 (+ .cse20 .cse21 c_~bag2~0 c_~sum2~0)) (< c_~bag2~0 (+ .cse21 1)) (not (<= (+ .cse20 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse20 .cse21 2147483648)))))))) .cse16))) (or (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse12)) (.cse24 (select .cse25 .cse11))) (or (not (<= 0 (+ .cse23 c_~bag2~0 2147483648))) (<= (+ .cse23 .cse24 c_~bag2~0 c_~sum2~0) .cse9) (not (<= (+ .cse23 .cse24 c_~bag2~0) 2147483647)) (not (<= (+ .cse23 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse23 .cse24 c_~bag2~0 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse26 (select .cse28 .cse12)) (.cse27 (select .cse28 .cse11))) (or (not (<= 0 (+ .cse26 c_~bag2~0 2147483648))) (<= .cse9 (+ .cse26 .cse27 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse26 .cse27 c_~bag2~0) 2147483647)) (not (<= (+ .cse26 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse26 .cse27 c_~bag2~0 2147483648)))))))) .cse16))))) (.cse1 (not (<= .cse5 2147483647))) (.cse3 (not (<= 0 (+ c_~bag1~0 .cse6 2147483648)))) (.cse2 (< .cse5 c_~cap1~0)) (.cse4 (< (+ c_~i~0 1) c_~N~0))) (and (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (or .cse0 .cse1 .cse3 (not .cse2) .cse4))))) is different from false [2022-12-14 11:49:55,650 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< 2 c_~N~0)) (.cse7 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (not (< 1 c_~N~0)))) (and (or .cse0 (and (or (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse9 .cse7)) (.cse2 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse3 (+ .cse1 .cse2))) (or (< (+ .cse1 .cse2 2147483648) 0) (not (<= 0 (+ .cse2 2147483648))) (< 2147483647 .cse3) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse6 (select (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse4 (+ (select .cse6 .cse7) .cse5))) (or (<= .cse4 .cse3) (not (<= .cse5 2147483647)) (not (<= .cse4 2147483647)) (not (<= 0 (+ 2147483648 .cse5)))))))) (not (<= .cse2 2147483647)))))))) (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse17 .cse7)) (.cse11 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse12 (+ .cse10 .cse11))) (or (< (+ .cse10 .cse11 2147483648) 0) (not (<= 0 (+ .cse11 2147483648))) (< 2147483647 .cse12) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse15 (select (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse14 (select .cse15 .cse7)) (.cse13 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse13 2147483647)) (<= .cse12 (+ .cse14 .cse13)) (not (<= 0 (+ .cse14 2147483648 .cse13))) (not (<= 0 (+ 2147483648 .cse13))))))) (not (<= .cse11 2147483647))))))))) .cse18) (or (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse26 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse26 .cse7)) (.cse25 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse21 (+ .cse24 .cse25))) (or (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse22 (select (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse22 .cse7)) (.cse20 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse19 1)) (not (<= .cse20 2147483647)) (<= .cse21 (+ .cse19 .cse20)) (not (<= 0 (+ .cse19 2147483648 .cse20))))))) (< (+ .cse24 .cse25 2147483648) 0) (not (<= 0 (+ .cse25 2147483648))) (< 2147483647 .cse21) (not (<= .cse25 2147483647)))))))) (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse27 (select .cse34 .cse7)) (.cse28 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse31 (+ .cse27 .cse28))) (or (< (+ .cse27 .cse28 2147483648) 0) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse32 (select (store .cse33 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse29 (select .cse32 .cse7)) (.cse30 (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse29 1)) (<= (+ .cse29 .cse30) .cse31) (not (<= .cse30 2147483647)))))) (not (<= 0 (+ .cse28 2147483648))) (< 2147483647 .cse31) (not (<= .cse28 2147483647))))))))) .cse18))) (or .cse0 (and (or (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse42 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse41 (select .cse42 .cse7)) (.cse40 (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse35 (+ .cse41 .cse40))) (or (not (<= .cse35 2147483647)) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse38 (select (store .cse39 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse36 (select .cse38 .cse7)) (.cse37 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse36 1)) (<= (+ .cse36 .cse37) .cse35) (not (<= .cse37 2147483647)))))) (not (<= 0 (+ .cse40 2147483648))) (not (<= 0 (+ .cse41 .cse40 2147483648))) (not (<= .cse40 2147483647)))))))) (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse50 (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse49 (select .cse50 .cse7)) (.cse48 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse43 (+ .cse49 .cse48))) (or (not (<= .cse43 2147483647)) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse46 (select (store .cse47 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse44 (select .cse46 .cse7)) (.cse45 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse44 1)) (not (<= .cse45 2147483647)) (<= .cse43 (+ .cse44 .cse45)) (not (<= 0 (+ .cse44 2147483648 .cse45))))))) (not (<= 0 (+ .cse48 2147483648))) (not (<= 0 (+ .cse49 .cse48 2147483648))) (not (<= .cse48 2147483647))))))))) .cse18) (or (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse53 (select .cse58 .cse7)) (.cse52 (select .cse58 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse51 (+ .cse53 .cse52))) (or (not (<= .cse51 2147483647)) (not (<= 0 (+ .cse52 2147483648))) (not (<= 0 (+ .cse53 .cse52 2147483648))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse56 (select (store .cse57 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse55 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse54 (+ (select .cse56 .cse7) .cse55))) (or (<= .cse54 .cse51) (not (<= .cse55 2147483647)) (not (<= .cse54 2147483647)) (not (<= 0 (+ 2147483648 .cse55)))))))) (not (<= .cse52 2147483647)))))))) (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse61 (select .cse66 .cse7)) (.cse60 (select .cse66 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse59 (+ .cse61 .cse60))) (or (not (<= .cse59 2147483647)) (not (<= 0 (+ .cse60 2147483648))) (not (<= 0 (+ .cse61 .cse60 2147483648))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse64 (select (store .cse65 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse63 (select .cse64 .cse7)) (.cse62 (select .cse64 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse62 2147483647)) (<= .cse59 (+ .cse63 .cse62)) (not (<= 0 (+ .cse63 2147483648 .cse62))) (not (<= 0 (+ 2147483648 .cse62))))))) (not (<= .cse60 2147483647))))))))) .cse18))) (or .cse0 (and (or (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse67 (select .cse73 .cse7)) (.cse68 (select .cse73 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse67 1)) (not (<= 0 (+ .cse67 .cse68 2147483648))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse71 (select (store .cse72 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse70 (select .cse71 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse69 (+ (select .cse71 .cse7) .cse70))) (or (<= .cse69 (+ .cse67 .cse68)) (not (<= .cse70 2147483647)) (not (<= .cse69 2147483647)) (not (<= 0 (+ 2147483648 .cse70)))))))) (not (<= .cse68 2147483647))))))) (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse74 (select .cse80 .cse7)) (.cse75 (select .cse80 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse74 1)) (not (<= 0 (+ .cse74 .cse75 2147483648))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse78 (select (store .cse79 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse77 (select .cse78 .cse7)) (.cse76 (select .cse78 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse76 2147483647)) (<= (+ .cse74 .cse75) (+ .cse77 .cse76)) (not (<= 0 (+ .cse77 2147483648 .cse76))) (not (<= 0 (+ 2147483648 .cse76))))))) (not (<= .cse75 2147483647)))))))) .cse18) (or (and (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse86 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse87 (select .cse86 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse83 (select .cse87 .cse7)) (.cse84 (select .cse87 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse85 (select (store .cse86 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse81 (select .cse85 .cse7)) (.cse82 (select .cse85 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse81 1)) (not (<= .cse82 2147483647)) (<= (+ .cse83 .cse84) (+ .cse81 .cse82)) (not (<= 0 (+ .cse81 2147483648 .cse82))))))) (< 0 (+ .cse83 1)) (not (<= 0 (+ .cse83 .cse84 2147483648))) (not (<= .cse84 2147483647))))))) (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse93 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_533))) (let ((.cse94 (select .cse93 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse88 (select .cse94 .cse7)) (.cse91 (select .cse94 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse88 1)) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse92 (select (store .cse93 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse89 (select .cse92 .cse7)) (.cse90 (select .cse92 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse89 1)) (<= (+ .cse89 .cse90) (+ .cse88 .cse91)) (not (<= .cse90 2147483647)))))) (not (<= 0 (+ .cse88 .cse91 2147483648))) (not (<= .cse91 2147483647)))))))) .cse18))))) is different from false [2022-12-14 11:49:55,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:49:55,873 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 342 treesize of output 186 [2022-12-14 11:49:55,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:49:55,887 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 978 treesize of output 834 [2022-12-14 11:49:55,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 527 treesize of output 457 [2022-12-14 11:49:55,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:49:55,924 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 543 treesize of output 495 [2022-12-14 11:49:56,024 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,025 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 341 treesize of output 1 [2022-12-14 11:49:56,034 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,034 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 343 treesize of output 1 [2022-12-14 11:49:56,041 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,041 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 290 treesize of output 1 [2022-12-14 11:49:56,051 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,051 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 245 treesize of output 1 [2022-12-14 11:49:56,056 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,057 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 298 treesize of output 1 [2022-12-14 11:49:56,062 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,063 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 297 treesize of output 1 [2022-12-14 11:49:56,069 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,069 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 296 treesize of output 1 [2022-12-14 11:49:56,078 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,078 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 341 treesize of output 1 [2022-12-14 11:49:56,085 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,085 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 288 treesize of output 1 [2022-12-14 11:49:56,093 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,093 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 340 treesize of output 1 [2022-12-14 11:49:56,099 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:56,099 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 339 treesize of output 1 [2022-12-14 11:49:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 11:49:56,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830254789] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:56,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913904975] [2022-12-14 11:49:56,199 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:49:56,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:56,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-12-14 11:49:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118522629] [2022-12-14 11:49:56,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:49:56,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 11:49:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:56,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 11:49:56,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1037, Unknown=5, NotChecked=276, Total=1482 [2022-12-14 11:49:56,201 INFO L87 Difference]: Start difference. First operand 117 states and 268 transitions. Second operand has 39 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:50:25,766 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or (< c_~i~0 c_~N~0) (let ((.cse22 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse22 4)) (.cse5 (+ c_~A~0.offset .cse22)) (.cse9 (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 (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (<= (+ .cse0 .cse1 c_~bag2~0 c_~sum2~0) .cse2) (not (<= 0 (+ .cse0 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse0 .cse1) 2147483647)) (not (<= (+ .cse0 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse0 .cse1 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse6 .cse7) 2147483647)) (not (<= (+ .cse6 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse6 .cse7 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse6 .cse7 2147483648)))))))) .cse9) (or .cse9 (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse5)) (.cse10 (select .cse12 .cse4))) (or (< c_~bag2~0 (+ .cse10 1)) (not (<= (+ .cse11 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse11 .cse10 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse11 .cse10 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (<= (+ .cse13 .cse14 c_~bag2~0 c_~sum2~0) .cse2) (< c_~bag2~0 (+ .cse14 1)) (not (<= (+ .cse13 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse13 .cse14 2147483648))))))))))) (or (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse5)) (.cse17 (select .cse18 .cse4))) (or (not (<= 0 (+ .cse16 c_~bag2~0 2147483648))) (<= (+ .cse16 .cse17 c_~bag2~0 c_~sum2~0) .cse2) (not (<= (+ .cse16 .cse17 c_~bag2~0) 2147483647)) (not (<= (+ .cse16 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse16 .cse17 c_~bag2~0 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse5)) (.cse20 (select .cse21 .cse4))) (or (not (<= 0 (+ .cse19 c_~bag2~0 2147483648))) (not (<= (+ .cse19 .cse20 c_~bag2~0) 2147483647)) (not (<= (+ .cse19 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse19 .cse20 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse19 .cse20 c_~bag2~0 2147483648)))))))) .cse9))))) (<= .cse23 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 2 c_~N~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-12-14 11:50:37,562 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse45 (* c_~j~0 4))) (let ((.cse14 (select |c_#memory_int| c_~A~0.base)) (.cse29 (+ c_~A~0.offset .cse45))) (let ((.cse4 (select .cse14 .cse29)) (.cse0 (+ c_~bag2~0 c_~sum2~0))) (let ((.cse9 (not (<= .cse0 2147483647))) (.cse10 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse15 (+ c_~A~0.offset .cse45 4)) (.cse7 (not (< (+ c_~j~0 1) c_~N~0))) (.cse19 (select .cse14 (+ c_~A~0.offset (* c_~i~0 4)))) (.cse24 (+ c_~bag2~0 .cse4))) (let ((.cse2 (< c_~i~0 c_~N~0)) (.cse3 (not (<= .cse24 2147483647))) (.cse6 (not (<= 0 (+ c_~bag2~0 .cse4 2147483648)))) (.cse11 (+ c_~bag2~0 .cse4 c_~sum2~0)) (.cse16 (not (<= 0 (+ |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483648)))) (.cse17 (let ((.cse27 (+ c_~bag1~0 c_~sum1~0 .cse19))) (and (or .cse9 .cse10 (and (or (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse25 (select .cse28 .cse29)) (.cse26 (select .cse28 .cse15))) (or (not (<= 0 (+ .cse25 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse25 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse25 .cse26) 2147483647)) (<= (+ .cse25 .cse26 c_~bag2~0 c_~sum2~0) .cse27) (not (<= (+ .cse25 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse25 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse25 .cse26 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse30 (select .cse32 .cse29)) (.cse31 (select .cse32 .cse15))) (or (not (<= 0 (+ .cse30 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse30 c_~bag2~0 c_~sum2~0 2147483648))) (<= .cse27 (+ .cse30 .cse31 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse30 .cse31) 2147483647)) (not (<= (+ .cse30 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse30 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse30 .cse31 2147483648)))))))) .cse7) (or (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse33 (select .cse35 .cse29)) (.cse34 (select .cse35 .cse15))) (or (<= (+ .cse33 .cse34 c_~bag2~0 c_~sum2~0) .cse27) (< c_~bag2~0 (+ .cse34 1)) (not (<= (+ .cse33 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse33 .cse34 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse36 (select .cse38 .cse29)) (.cse37 (select .cse38 .cse15))) (or (<= .cse27 (+ .cse36 .cse37 c_~bag2~0 c_~sum2~0)) (< c_~bag2~0 (+ .cse37 1)) (not (<= (+ .cse36 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse36 .cse37 2147483648)))))))) .cse7))) (or (and (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse39 (select .cse41 .cse29)) (.cse40 (select .cse41 .cse15))) (or (not (<= 0 (+ .cse39 c_~bag2~0 2147483648))) (<= (+ .cse39 .cse40 c_~bag2~0 c_~sum2~0) .cse27) (not (<= (+ .cse39 .cse40 c_~bag2~0) 2147483647)) (not (<= (+ .cse39 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse39 .cse40 c_~bag2~0 2147483648))))))) (forall ((v_ArrVal_534 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~A~0.base))) (let ((.cse42 (select .cse44 .cse29)) (.cse43 (select .cse44 .cse15))) (or (not (<= 0 (+ .cse42 c_~bag2~0 2147483648))) (<= .cse27 (+ .cse42 .cse43 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse42 .cse43 c_~bag2~0) 2147483647)) (not (<= (+ .cse42 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse42 .cse43 c_~bag2~0 2147483648)))))))) .cse7)))) (.cse18 (not (<= |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483647))) (.cse20 (< |c_thread1Thread1of1ForFork0_#t~ret2#1| c_~cap1~0)) (.cse21 (< (+ c_~i~0 1) c_~N~0)) (.cse1 (+ c_~bag1~0 c_~sum1~0))) (and (or (and (<= .cse0 .cse1) (<= .cse1 .cse0)) .cse2) (or (let ((.cse5 (select .cse14 .cse15))) (let ((.cse8 (let ((.cse13 (+ c_~bag2~0 .cse4 .cse5 c_~sum2~0))) (and (<= .cse13 .cse1) (<= .cse1 .cse13))))) (and (or .cse3 (not (<= (+ c_~bag2~0 .cse4 .cse5) 2147483647)) .cse6 .cse7 (not (<= 0 (+ c_~bag2~0 .cse4 .cse5 2147483648))) .cse8) (or .cse3 .cse9 .cse10 .cse6 (let ((.cse12 (not (<= 0 (+ .cse4 .cse5 2147483648))))) (and (or (not (<= .cse11 2147483647)) .cse12 (not (<= 0 (+ c_~bag2~0 .cse4 c_~sum2~0 2147483648))) .cse7 (not (<= (+ .cse4 .cse5) 2147483647)) .cse8) (or .cse12 .cse7 (< c_~bag2~0 (+ .cse5 1)) .cse8))))))) .cse2) (or .cse16 .cse17 .cse18 (not (<= (+ c_~bag1~0 .cse19) 2147483647)) (not .cse20) (not (<= 0 (+ c_~bag1~0 .cse19 2147483648))) .cse21) (or .cse2 (let ((.cse22 (not (< c_~j~0 c_~N~0))) (.cse23 (and (<= .cse11 .cse1) (<= .cse1 .cse11)))) (and (or .cse3 .cse9 .cse10 .cse6 .cse22 .cse23) (or .cse3 .cse6 .cse22 (not (< .cse24 c_~cap2~0)) .cse23)))) (or .cse16 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse17 .cse18 .cse20 .cse21 (not (<= .cse1 2147483647))))))))) is different from false [2022-12-14 11:50:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:50:37,773 INFO L93 Difference]: Finished difference Result 418 states and 986 transitions. [2022-12-14 11:50:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-14 11:50:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 0 states have call successors, (0), 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-12-14 11:50:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:50:37,775 INFO L225 Difference]: With dead ends: 418 [2022-12-14 11:50:37,775 INFO L226 Difference]: Without dead ends: 414 [2022-12-14 11:50:37,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2576 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=1145, Invalid=6672, Unknown=39, NotChecked=1074, Total=8930 [2022-12-14 11:50:37,776 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 449 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 108 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:50:37,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 0 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1460 Invalid, 28 Unknown, 522 Unchecked, 3.2s Time] [2022-12-14 11:50:37,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-12-14 11:50:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 146. [2022-12-14 11:50:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.503448275862069) internal successors, (363), 145 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:50:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 363 transitions. [2022-12-14 11:50:37,781 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 363 transitions. Word has length 20 [2022-12-14 11:50:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:50:37,781 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 363 transitions. [2022-12-14 11:50:37,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:50:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 363 transitions. [2022-12-14 11:50:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 11:50:37,781 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:50:37,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:50:37,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 11:50:37,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 11:50:37,983 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-12-14 11:50:37,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:50:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash 193778950, now seen corresponding path program 14 times [2022-12-14 11:50:37,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:50:37,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321249216] [2022-12-14 11:50:37,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:50:37,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:50:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:50:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:50:40,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:50:40,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321249216] [2022-12-14 11:50:40,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321249216] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:50:40,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324188835] [2022-12-14 11:50:40,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:50:40,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:50:40,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:50:40,722 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:50:40,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 11:50:40,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 11:50:40,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:50:40,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 11:50:40,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:50:41,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:50:41,465 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 90 treesize of output 86 [2022-12-14 11:50:41,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:41,892 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 293 treesize of output 195 [2022-12-14 11:50:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:50:42,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:50:43,678 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse23 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse23 4)) (.cse5 (+ c_~A~0.offset .cse23)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ .cse0 .cse1 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= (+ .cse0 .cse1 c_~bag2~0) 2147483647)) (<= (+ .cse0 .cse1 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= 0 (+ .cse6 .cse7 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (not (<= (+ .cse6 .cse7 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse6 .cse7 c_~bag2~0 c_~sum2~0))))))) .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_569 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse5)) (.cse12 (select .cse13 .cse4))) (or (not (<= 0 (+ .cse11 c_~bag2~0 2147483648))) (not (<= (+ .cse11 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse11 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse11 .cse12 2147483648))) (not (<= (+ .cse11 c_~bag2~0) 2147483647)) (not (<= (+ .cse11 .cse12) 2147483647)) (<= (+ .cse11 .cse12 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse5)) (.cse15 (select .cse16 .cse4))) (or (not (<= 0 (+ .cse14 c_~bag2~0 2147483648))) (not (<= (+ .cse14 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse14 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse14 .cse15 2147483648))) (not (<= (+ .cse14 c_~bag2~0) 2147483647)) (not (<= (+ .cse14 .cse15) 2147483647)) (<= .cse2 (+ .cse14 .cse15 c_~bag2~0 c_~sum2~0))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse5)) (.cse18 (select .cse19 .cse4))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (not (<= (+ .cse17 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse18 1)) (<= .cse2 (+ .cse17 .cse18 c_~bag2~0 c_~sum2~0)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse5)) (.cse21 (select .cse22 .cse4))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (not (<= (+ .cse20 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse21 1)) (<= (+ .cse20 .cse21 c_~bag2~0 c_~sum2~0) .cse2)))))) .cse9 .cse10)))))) (< c_~i~0 c_~N~0)) is different from false [2022-12-14 11:50:46,022 INFO L321 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2022-12-14 11:50:46,022 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 3576 treesize of output 2556 [2022-12-14 11:50:46,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,110 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 2317 treesize of output 2278 [2022-12-14 11:50:46,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,171 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 2278 treesize of output 2239 [2022-12-14 11:50:46,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,230 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 2239 treesize of output 2176 [2022-12-14 11:50:46,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,281 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 2176 treesize of output 2113 [2022-12-14 11:50:46,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,333 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 2113 treesize of output 2062 [2022-12-14 11:50:46,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,385 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 2062 treesize of output 2011 [2022-12-14 11:50:46,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,434 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 2011 treesize of output 1972 [2022-12-14 11:50:46,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,483 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 1972 treesize of output 1933 [2022-12-14 11:50:46,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,533 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 1933 treesize of output 1870 [2022-12-14 11:50:46,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,584 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 1870 treesize of output 1807 [2022-12-14 11:50:46,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,650 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 1807 treesize of output 1756 [2022-12-14 11:50:46,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:46,700 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 1756 treesize of output 1705 [2022-12-14 11:50:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:50:49,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324188835] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:50:49,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1985050811] [2022-12-14 11:50:49,635 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:50:49,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:50:49,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 34 [2022-12-14 11:50:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632214294] [2022-12-14 11:50:49,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:50:49,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 11:50:49,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:50:49,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 11:50:49,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1017, Unknown=1, NotChecked=66, Total=1260 [2022-12-14 11:50:49,637 INFO L87 Difference]: Start difference. First operand 146 states and 363 transitions. Second operand has 36 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 35 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:50:55,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse27 (+ c_~j~0 1)) (.cse55 (* c_~j~0 4)) (.cse26 (+ c_~bag2~0 c_~sum2~0))) (let ((.cse32 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse28 (< 2 c_~N~0)) (.cse30 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse29 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse31 (<= c_~N~0 1)) (.cse25 (< c_~i~0 c_~N~0)) (.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse11 (not (<= .cse26 2147483647))) (.cse12 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse4 (+ c_~A~0.offset .cse55 4)) (.cse5 (+ c_~A~0.offset .cse55)) (.cse9 (not (< .cse27 c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ .cse0 .cse1 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= (+ .cse0 .cse1 c_~bag2~0) 2147483647)) (<= (+ .cse0 .cse1 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= 0 (+ .cse6 .cse7 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (not (<= (+ .cse6 .cse7 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse6 .cse7 c_~bag2~0 c_~sum2~0))))))) .cse9 .cse10) (or .cse11 .cse12 (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (not (<= 0 (+ .cse13 c_~bag2~0 2147483648))) (not (<= (+ .cse13 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse13 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= (+ .cse13 c_~bag2~0) 2147483647)) (not (<= (+ .cse13 .cse14) 2147483647)) (<= (+ .cse13 .cse14 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse5)) (.cse17 (select .cse18 .cse4))) (or (not (<= 0 (+ .cse16 c_~bag2~0 2147483648))) (not (<= (+ .cse16 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse16 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse16 .cse17 2147483648))) (not (<= (+ .cse16 c_~bag2~0) 2147483647)) (not (<= (+ .cse16 .cse17) 2147483647)) (<= .cse2 (+ .cse16 .cse17 c_~bag2~0 c_~sum2~0))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse5)) (.cse20 (select .cse21 .cse4))) (or (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= (+ .cse19 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse20 1)) (<= .cse2 (+ .cse19 .cse20 c_~bag2~0 c_~sum2~0)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse5)) (.cse23 (select .cse24 .cse4))) (or (not (<= 0 (+ .cse22 .cse23 2147483648))) (not (<= (+ .cse22 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse23 1)) (<= (+ .cse22 .cse23 c_~bag2~0 c_~sum2~0) .cse2)))))) .cse9 .cse10)))) .cse25) (or (and (<= c_~sum1~0 .cse26) (<= .cse26 c_~sum1~0)) (<= .cse27 c_~N~0)) (or .cse28 .cse29 (not .cse30) .cse31 .cse32) (or (not .cse32) .cse28 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse29 .cse31) (or .cse28 .cse30 .cse29 .cse31) (or (not .cse25) (let ((.cse35 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse33 (< (+ c_~i~0 1) c_~N~0)) (.cse34 (let ((.cse38 (+ c_~bag1~0 c_~sum1~0 .cse35))) (and (or .cse11 .cse12 (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse36 (select .cse39 .cse5)) (.cse37 (select .cse39 .cse4))) (or (not (<= 0 (+ .cse36 .cse37 2147483648))) (not (<= (+ .cse36 c_~bag2~0) 2147483647)) (<= (+ .cse36 .cse37 c_~bag2~0 c_~sum2~0) .cse38) (< c_~bag2~0 (+ .cse37 1)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse40 (select .cse42 .cse5)) (.cse41 (select .cse42 .cse4))) (or (not (<= 0 (+ .cse40 .cse41 2147483648))) (not (<= (+ .cse40 c_~bag2~0) 2147483647)) (<= .cse38 (+ .cse40 .cse41 c_~bag2~0 c_~sum2~0)) (< c_~bag2~0 (+ .cse41 1))))))) .cse9 .cse10) (or .cse9 (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse43 (select .cse45 .cse5)) (.cse44 (select .cse45 .cse4))) (or (not (<= 0 (+ .cse43 c_~bag2~0 2147483648))) (not (<= (+ .cse43 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse43 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse43 .cse44 2147483648))) (not (<= (+ .cse43 c_~bag2~0) 2147483647)) (<= (+ .cse43 .cse44 c_~bag2~0 c_~sum2~0) .cse38) (not (<= (+ .cse43 .cse44) 2147483647)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse48 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse46 (select .cse48 .cse5)) (.cse47 (select .cse48 .cse4))) (or (not (<= 0 (+ .cse46 c_~bag2~0 2147483648))) (not (<= (+ .cse46 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse46 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse46 .cse47 2147483648))) (not (<= (+ .cse46 c_~bag2~0) 2147483647)) (<= .cse38 (+ .cse46 .cse47 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse46 .cse47) 2147483647))))))) .cse10))) (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse49 (select .cse51 .cse5)) (.cse50 (select .cse51 .cse4))) (or (not (<= 0 (+ .cse49 .cse50 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse49 c_~bag2~0 2147483648))) (not (<= (+ .cse49 c_~bag2~0) 2147483647)) (<= .cse38 (+ .cse49 .cse50 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse49 .cse50 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse52 (select .cse54 .cse5)) (.cse53 (select .cse54 .cse4))) (or (not (<= 0 (+ .cse52 .cse53 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse52 c_~bag2~0 2147483648))) (not (<= (+ .cse52 c_~bag2~0) 2147483647)) (<= (+ .cse52 .cse53 c_~bag2~0 c_~sum2~0) .cse38) (not (<= (+ .cse52 .cse53 c_~bag2~0) 2147483647))))))) .cse9 .cse10))))) (and (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (< 2147483647 c_~cap1~0) .cse33 .cse34 (not (<= .cse2 2147483647))) (or (< (+ 2147483647 c_~cap1~0) 0) (not (<= (+ c_~bag1~0 .cse35) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse35 2147483648))) .cse33 .cse34)))))))) is different from false [2022-12-14 11:51:11,366 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse24 (< 2 c_~N~0)) (.cse26 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse25 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse27 (<= c_~N~0 1))) (and (or (let ((.cse23 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse23 4)) (.cse5 (+ c_~A~0.offset .cse23)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ .cse0 .cse1 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= (+ .cse0 .cse1 c_~bag2~0) 2147483647)) (<= (+ .cse0 .cse1 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= 0 (+ .cse6 .cse7 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (not (<= (+ .cse6 .cse7 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse6 .cse7 c_~bag2~0 c_~sum2~0))))))) .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_569 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse5)) (.cse12 (select .cse13 .cse4))) (or (not (<= 0 (+ .cse11 c_~bag2~0 2147483648))) (not (<= (+ .cse11 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse11 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse11 .cse12 2147483648))) (not (<= (+ .cse11 c_~bag2~0) 2147483647)) (not (<= (+ .cse11 .cse12) 2147483647)) (<= (+ .cse11 .cse12 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse5)) (.cse15 (select .cse16 .cse4))) (or (not (<= 0 (+ .cse14 c_~bag2~0 2147483648))) (not (<= (+ .cse14 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse14 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse14 .cse15 2147483648))) (not (<= (+ .cse14 c_~bag2~0) 2147483647)) (not (<= (+ .cse14 .cse15) 2147483647)) (<= .cse2 (+ .cse14 .cse15 c_~bag2~0 c_~sum2~0))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse5)) (.cse18 (select .cse19 .cse4))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (not (<= (+ .cse17 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse18 1)) (<= .cse2 (+ .cse17 .cse18 c_~bag2~0 c_~sum2~0)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse5)) (.cse21 (select .cse22 .cse4))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (not (<= (+ .cse20 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse21 1)) (<= (+ .cse20 .cse21 c_~bag2~0 c_~sum2~0) .cse2)))))) .cse9 .cse10)))))) (< c_~i~0 c_~N~0)) (or .cse24 .cse25 (not .cse26) .cse27 .cse28) (or (not .cse28) .cse24 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse25 .cse27) (or .cse24 .cse26 .cse25 .cse27))) is different from false [2022-12-14 11:51:13,942 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~bag2~0 c_~sum2~0)) (.cse24 (+ c_~j~0 1)) (.cse29 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse26 (< 2 c_~N~0)) (.cse27 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse28 (<= c_~N~0 1))) (and (or (let ((.cse25 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset .cse25 4)) (.cse5 (+ c_~A~0.offset .cse25)) (.cse9 (not (< .cse24 c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ .cse0 .cse1 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= (+ .cse0 .cse1 c_~bag2~0) 2147483647)) (<= (+ .cse0 .cse1 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= 0 (+ .cse6 .cse7 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (not (<= (+ .cse6 .cse7 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse6 .cse7 c_~bag2~0 c_~sum2~0))))))) .cse9 .cse10) (or (not (<= .cse11 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse4))) (or (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))) (not (<= (+ .cse12 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse12 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse12 .cse13 2147483648))) (not (<= (+ .cse12 c_~bag2~0) 2147483647)) (not (<= (+ .cse12 .cse13) 2147483647)) (<= (+ .cse12 .cse13 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse5)) (.cse16 (select .cse17 .cse4))) (or (not (<= 0 (+ .cse15 c_~bag2~0 2147483648))) (not (<= (+ .cse15 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse15 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse15 .cse16 2147483648))) (not (<= (+ .cse15 c_~bag2~0) 2147483647)) (not (<= (+ .cse15 .cse16) 2147483647)) (<= .cse2 (+ .cse15 .cse16 c_~bag2~0 c_~sum2~0))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse5)) (.cse19 (select .cse20 .cse4))) (or (not (<= 0 (+ .cse18 .cse19 2147483648))) (not (<= (+ .cse18 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse19 1)) (<= .cse2 (+ .cse18 .cse19 c_~bag2~0 c_~sum2~0)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse5)) (.cse22 (select .cse23 .cse4))) (or (not (<= 0 (+ .cse21 .cse22 2147483648))) (not (<= (+ .cse21 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse22 1)) (<= (+ .cse21 .cse22 c_~bag2~0 c_~sum2~0) .cse2)))))) .cse9 .cse10)))))) (< c_~i~0 c_~N~0)) (or (and (<= c_~sum1~0 .cse11) (<= .cse11 c_~sum1~0)) (<= .cse24 c_~N~0)) (or .cse26 .cse27 (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse28 .cse29) (or (not .cse29) .cse26 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse27 .cse28))) is different from false [2022-12-14 11:51:26,119 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse53 (* c_~j~0 4))) (let ((.cse30 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse26 (< 2 c_~N~0)) (.cse28 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse27 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse29 (<= c_~N~0 1)) (.cse25 (< c_~i~0 c_~N~0)) (.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse11 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse12 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse4 (+ c_~A~0.offset .cse53 4)) (.cse5 (+ c_~A~0.offset .cse53)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ .cse0 .cse1 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= (+ .cse0 .cse1 c_~bag2~0) 2147483647)) (<= (+ .cse0 .cse1 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= 0 (+ .cse6 .cse7 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= (+ .cse6 c_~bag2~0) 2147483647)) (not (<= (+ .cse6 .cse7 c_~bag2~0) 2147483647)) (<= .cse2 (+ .cse6 .cse7 c_~bag2~0 c_~sum2~0))))))) .cse9 .cse10) (or .cse11 .cse12 (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (not (<= 0 (+ .cse13 c_~bag2~0 2147483648))) (not (<= (+ .cse13 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse13 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= (+ .cse13 c_~bag2~0) 2147483647)) (not (<= (+ .cse13 .cse14) 2147483647)) (<= (+ .cse13 .cse14 c_~bag2~0 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse5)) (.cse17 (select .cse18 .cse4))) (or (not (<= 0 (+ .cse16 c_~bag2~0 2147483648))) (not (<= (+ .cse16 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse16 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse16 .cse17 2147483648))) (not (<= (+ .cse16 c_~bag2~0) 2147483647)) (not (<= (+ .cse16 .cse17) 2147483647)) (<= .cse2 (+ .cse16 .cse17 c_~bag2~0 c_~sum2~0))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse5)) (.cse20 (select .cse21 .cse4))) (or (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= (+ .cse19 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse20 1)) (<= .cse2 (+ .cse19 .cse20 c_~bag2~0 c_~sum2~0)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse5)) (.cse23 (select .cse24 .cse4))) (or (not (<= 0 (+ .cse22 .cse23 2147483648))) (not (<= (+ .cse22 c_~bag2~0) 2147483647)) (< c_~bag2~0 (+ .cse23 1)) (<= (+ .cse22 .cse23 c_~bag2~0 c_~sum2~0) .cse2)))))) .cse9 .cse10)))) .cse25) (or .cse26 .cse27 (not .cse28) .cse29 .cse30) (or (not .cse30) .cse26 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse27 .cse29) (or .cse26 .cse28 .cse27 .cse29) (or (not .cse25) (let ((.cse33 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse31 (< (+ c_~i~0 1) c_~N~0)) (.cse32 (let ((.cse36 (+ c_~bag1~0 c_~sum1~0 .cse33))) (and (or .cse11 .cse12 (and (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse34 (select .cse37 .cse5)) (.cse35 (select .cse37 .cse4))) (or (not (<= 0 (+ .cse34 .cse35 2147483648))) (not (<= (+ .cse34 c_~bag2~0) 2147483647)) (<= (+ .cse34 .cse35 c_~bag2~0 c_~sum2~0) .cse36) (< c_~bag2~0 (+ .cse35 1)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse38 (select .cse40 .cse5)) (.cse39 (select .cse40 .cse4))) (or (not (<= 0 (+ .cse38 .cse39 2147483648))) (not (<= (+ .cse38 c_~bag2~0) 2147483647)) (<= .cse36 (+ .cse38 .cse39 c_~bag2~0 c_~sum2~0)) (< c_~bag2~0 (+ .cse39 1))))))) .cse9 .cse10) (or .cse9 (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse41 (select .cse43 .cse5)) (.cse42 (select .cse43 .cse4))) (or (not (<= 0 (+ .cse41 c_~bag2~0 2147483648))) (not (<= (+ .cse41 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse41 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse41 .cse42 2147483648))) (not (<= (+ .cse41 c_~bag2~0) 2147483647)) (<= (+ .cse41 .cse42 c_~bag2~0 c_~sum2~0) .cse36) (not (<= (+ .cse41 .cse42) 2147483647)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse44 (select .cse46 .cse5)) (.cse45 (select .cse46 .cse4))) (or (not (<= 0 (+ .cse44 c_~bag2~0 2147483648))) (not (<= (+ .cse44 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse44 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse44 .cse45 2147483648))) (not (<= (+ .cse44 c_~bag2~0) 2147483647)) (<= .cse36 (+ .cse44 .cse45 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse44 .cse45) 2147483647))))))) .cse10))) (or (and (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse47 (select .cse49 .cse5)) (.cse48 (select .cse49 .cse4))) (or (not (<= 0 (+ .cse47 .cse48 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse47 c_~bag2~0 2147483648))) (not (<= (+ .cse47 c_~bag2~0) 2147483647)) (<= .cse36 (+ .cse47 .cse48 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse47 .cse48 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) c_~A~0.base))) (let ((.cse50 (select .cse52 .cse5)) (.cse51 (select .cse52 .cse4))) (or (not (<= 0 (+ .cse50 .cse51 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse50 c_~bag2~0 2147483648))) (not (<= (+ .cse50 c_~bag2~0) 2147483647)) (<= (+ .cse50 .cse51 c_~bag2~0 c_~sum2~0) .cse36) (not (<= (+ .cse50 .cse51 c_~bag2~0) 2147483647))))))) .cse9 .cse10))))) (and (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (< 2147483647 c_~cap1~0) .cse31 .cse32 (not (<= .cse2 2147483647))) (or (< (+ 2147483647 c_~cap1~0) 0) (not (<= (+ c_~bag1~0 .cse33) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse33 2147483648))) .cse31 .cse32)))))))) is different from false [2022-12-14 11:51:33,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-14 11:51:33,297 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-14 11:51:33,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-12-14 11:51:33,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2588 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=1556, Invalid=7193, Unknown=13, NotChecked=940, Total=9702 [2022-12-14 11:51:33,301 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 441 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 129 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:51:33,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 0 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 925 Invalid, 10 Unknown, 80 Unchecked, 2.0s Time] [2022-12-14 11:51:33,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 11:51:33,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:51:33,503 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:392) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 55 more [2022-12-14 11:51:33,508 INFO L158 Benchmark]: Toolchain (without parser) took 465524.54ms. Allocated memory was 123.7MB in the beginning and 490.7MB in the end (delta: 367.0MB). Free memory was 89.3MB in the beginning and 370.9MB in the end (delta: -281.6MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2022-12-14 11:51:33,508 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:51:33,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.72ms. Allocated memory is still 123.7MB. Free memory was 89.3MB in the beginning and 77.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 11:51:33,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.23ms. Allocated memory is still 123.7MB. Free memory was 77.2MB in the beginning and 74.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:51:33,511 INFO L158 Benchmark]: Boogie Preprocessor took 33.37ms. Allocated memory is still 123.7MB. Free memory was 74.6MB in the beginning and 73.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:51:33,512 INFO L158 Benchmark]: RCFGBuilder took 538.50ms. Allocated memory is still 123.7MB. Free memory was 72.5MB in the beginning and 47.1MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-14 11:51:33,513 INFO L158 Benchmark]: TraceAbstraction took 464711.84ms. Allocated memory was 123.7MB in the beginning and 490.7MB in the end (delta: 367.0MB). Free memory was 46.3MB in the beginning and 370.9MB in the end (delta: -324.6MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2022-12-14 11:51:33,517 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.72ms. Allocated memory is still 123.7MB. Free memory was 89.3MB in the beginning and 77.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.23ms. Allocated memory is still 123.7MB. Free memory was 77.2MB in the beginning and 74.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.37ms. Allocated memory is still 123.7MB. Free memory was 74.6MB in the beginning and 73.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.50ms. Allocated memory is still 123.7MB. Free memory was 72.5MB in the beginning and 47.1MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 464711.84ms. Allocated memory was 123.7MB in the beginning and 490.7MB in the end (delta: 367.0MB). Free memory was 46.3MB in the beginning and 370.9MB in the end (delta: -324.6MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2s, 375 PlacesBefore, 23 PlacesAfterwards, 396 TransitionsBefore, 20 TransitionsAfterwards, 37700 CoEnabledTransitionPairs, 9 FixpointIterations, 115 TrivialSequentialCompositions, 265 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 76 ConcurrentYvCompositions, 24 ChoiceCompositions, 494 TotalNumberOfCompositions, 32396 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31839, independent: 31802, independent conditional: 0, independent unconditional: 31802, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27962, independent: 27945, independent conditional: 0, independent unconditional: 27945, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27962, independent: 27945, independent conditional: 0, independent unconditional: 27945, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31839, independent: 3857, independent conditional: 0, independent unconditional: 3857, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 27962, unknown conditional: 0, unknown unconditional: 27962] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2329fc7 [2022-12-14 11:51:34,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:51:34,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:51:34,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:51:34,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:51:34,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:51:34,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:51:34,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:51:34,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:51:34,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:51:34,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:51:34,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:51:34,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:51:34,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:51:34,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:51:34,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:51:34,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:51:34,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:51:34,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:51:34,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:51:34,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:51:34,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:51:34,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:51:34,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:51:34,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:51:34,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:51:34,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:51:34,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:51:34,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:51:34,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:51:34,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:51:34,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:51:34,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:51:34,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:51:34,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:51:34,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:51:34,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:51:34,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:51:34,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:51:34,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:51:34,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:51:34,943 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 11:51:34,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:51:34,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:51:34,966 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:51:34,966 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:51:34,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:51:34,967 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:51:34,968 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:51:34,968 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:51:34,968 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:51:34,968 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:51:34,968 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:51:34,969 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:51:34,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:51:34,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:51:34,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:51:34,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:51:34,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:51:34,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:51:34,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:51:34,971 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 11:51:34,971 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 11:51:34,971 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 11:51:34,971 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:51:34,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:51:34,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:51:34,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:51:34,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:51:34,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 11:51:34,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:51:34,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:51:34,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:51:34,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:51:34,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:51:34,974 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 11:51:34,974 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 11:51:34,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:51:34,974 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:51:34,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 11:51:34,975 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-12-14 11:51:35,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:51:35,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:51:35,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:51:35,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:51:35,234 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:51:35,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-12-14 11:51:37,801 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:51:37,966 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:51:37,967 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-12-14 11:51:37,974 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/data/1c98c6683/bc7157b6508742dfb596a93fb6b9387a/FLAGb8a5697e1 [2022-12-14 11:51:37,987 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/data/1c98c6683/bc7157b6508742dfb596a93fb6b9387a [2022-12-14 11:51:37,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:51:37,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:51:37,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:51:37,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:51:37,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:51:37,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:51:37" (1/1) ... [2022-12-14 11:51:37,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68eb2b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:37, skipping insertion in model container [2022-12-14 11:51:37,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:51:37" (1/1) ... [2022-12-14 11:51:38,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:51:38,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:51:38,172 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_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 11:51:38,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:51:38,197 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 11:51:38,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:51:38,214 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_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 11:51:38,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:51:38,223 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:51:38,244 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_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 11:51:38,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:51:38,263 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:51:38,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38 WrapperNode [2022-12-14 11:51:38,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:51:38,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:51:38,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:51:38,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:51:38,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,311 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 259 [2022-12-14 11:51:38,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:51:38,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:51:38,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:51:38,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:51:38,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,351 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:51:38,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:51:38,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:51:38,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:51:38,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (1/1) ... [2022-12-14 11:51:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:51:38,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:51:38,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:51:38,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:51:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:51:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 11:51:38,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 11:51:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 11:51:38,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 11:51:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 11:51:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:51:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 11:51:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 11:51:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:51:38,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:51:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:51:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 11:51:38,419 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 11:51:38,516 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:51:38,518 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:51:38,966 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:51:38,975 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:51:38,976 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 11:51:38,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:51:38 BoogieIcfgContainer [2022-12-14 11:51:38,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:51:38,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:51:38,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:51:38,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:51:38,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:51:37" (1/3) ... [2022-12-14 11:51:38,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af638b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:51:38, skipping insertion in model container [2022-12-14 11:51:38,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:51:38" (2/3) ... [2022-12-14 11:51:38,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af638b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:51:38, skipping insertion in model container [2022-12-14 11:51:38,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:51:38" (3/3) ... [2022-12-14 11:51:38,984 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-12-14 11:51:38,990 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 11:51:38,998 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:51:38,998 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 11:51:38,998 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 11:51:39,102 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 11:51:39,131 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 11:51:39,144 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 378 transitions, 772 flow [2022-12-14 11:51:39,147 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 378 transitions, 772 flow [2022-12-14 11:51:39,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 378 transitions, 772 flow [2022-12-14 11:51:39,268 INFO L130 PetriNetUnfolder]: 28/376 cut-off events. [2022-12-14 11:51:39,269 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 11:51:39,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 376 events. 28/376 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 901 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 263. Up to 2 conditions per place. [2022-12-14 11:51:39,288 INFO L119 LiptonReduction]: Number of co-enabled transitions 35532 [2022-12-14 11:52:07,884 INFO L134 LiptonReduction]: Checked pairs total: 30568 [2022-12-14 11:52:07,884 INFO L136 LiptonReduction]: Total number of compositions: 466 [2022-12-14 11:52:07,890 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 20 transitions, 56 flow [2022-12-14 11:52:07,898 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:07,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:52:07,915 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;@4850605f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:52:07,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-14 11:52:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:52:07,920 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:07,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:07,921 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-12-14 11:52:07,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash -944570146, now seen corresponding path program 1 times [2022-12-14 11:52:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:07,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121502325] [2022-12-14 11:52:07,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:07,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:07,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:07,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:52:07,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 11:52:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:08,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 11:52:08,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:08,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:08,236 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:08,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121502325] [2022-12-14 11:52:08,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121502325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:08,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:08,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427107314] [2022-12-14 11:52:08,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:08,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:52:08,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:52:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:08,269 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 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-12-14 11:52:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:08,533 INFO L93 Difference]: Finished difference Result 70 states and 168 transitions. [2022-12-14 11:52:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:52:08,534 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-12-14 11:52:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:08,540 INFO L225 Difference]: With dead ends: 70 [2022-12-14 11:52:08,541 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 11:52:08,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:08,543 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:08,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:52:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 11:52:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2022-12-14 11:52:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 83 transitions. [2022-12-14 11:52:08,567 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 83 transitions. Word has length 12 [2022-12-14 11:52:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:08,567 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 83 transitions. [2022-12-14 11:52:08,567 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-12-14 11:52:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 83 transitions. [2022-12-14 11:52:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 11:52:08,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:08,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:08,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:52:08,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:08,770 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-12-14 11:52:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:08,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1231294251, now seen corresponding path program 1 times [2022-12-14 11:52:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:08,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125172220] [2022-12-14 11:52:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:08,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:08,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:08,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:52:08,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 11:52:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:08,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 11:52:08,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:08,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:08,970 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:08,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125172220] [2022-12-14 11:52:08,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125172220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:08,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:08,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:08,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472301943] [2022-12-14 11:52:08,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:08,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:52:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:08,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:52:08,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:08,972 INFO L87 Difference]: Start difference. First operand 39 states and 83 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-12-14 11:52:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:09,187 INFO L93 Difference]: Finished difference Result 55 states and 104 transitions. [2022-12-14 11:52:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:52:09,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-12-14 11:52:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:09,188 INFO L225 Difference]: With dead ends: 55 [2022-12-14 11:52:09,189 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 11:52:09,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:52:09,189 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:09,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:52:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 11:52:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-12-14 11:52:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 65 transitions. [2022-12-14 11:52:09,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 65 transitions. Word has length 13 [2022-12-14 11:52:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:09,193 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 65 transitions. [2022-12-14 11:52:09,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-12-14 11:52:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 65 transitions. [2022-12-14 11:52:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 11:52:09,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:09,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:09,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 11:52:09,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:09,395 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-12-14 11:52:09,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1219933763, now seen corresponding path program 2 times [2022-12-14 11:52:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:09,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125271887] [2022-12-14 11:52:09,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:52:09,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:09,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:52:09,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 11:52:09,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:52:09,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:52:09,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 11:52:09,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:09,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:09,567 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:09,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125271887] [2022-12-14 11:52:09,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125271887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:09,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:09,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824109829] [2022-12-14 11:52:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:09,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:52:09,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:09,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:52:09,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:09,569 INFO L87 Difference]: Start difference. First operand 31 states and 65 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-12-14 11:52:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:09,857 INFO L93 Difference]: Finished difference Result 43 states and 94 transitions. [2022-12-14 11:52:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:52:09,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-12-14 11:52:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:09,858 INFO L225 Difference]: With dead ends: 43 [2022-12-14 11:52:09,858 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 11:52:09,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:52:09,859 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:09,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:52:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 11:52:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-12-14 11:52:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 84 transitions. [2022-12-14 11:52:09,862 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 84 transitions. Word has length 13 [2022-12-14 11:52:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:09,863 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 84 transitions. [2022-12-14 11:52:09,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-12-14 11:52:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 84 transitions. [2022-12-14 11:52:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:52:09,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:09,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:09,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 11:52:10,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:10,066 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-12-14 11:52:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1343049093, now seen corresponding path program 1 times [2022-12-14 11:52:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:10,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554474155] [2022-12-14 11:52:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:10,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:10,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:10,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:52:10,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 11:52:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:10,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 11:52:10,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:10,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:52:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:10,302 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:10,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554474155] [2022-12-14 11:52:10,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554474155] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:10,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:52:10,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-14 11:52:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088940515] [2022-12-14 11:52:10,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:10,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:10,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:52:10,303 INFO L87 Difference]: Start difference. First operand 39 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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-12-14 11:52:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:10,523 INFO L93 Difference]: Finished difference Result 57 states and 119 transitions. [2022-12-14 11:52:10,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:10,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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-12-14 11:52:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:10,524 INFO L225 Difference]: With dead ends: 57 [2022-12-14 11:52:10,524 INFO L226 Difference]: Without dead ends: 57 [2022-12-14 11:52:10,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:52:10,526 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:10,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:52:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-14 11:52:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2022-12-14 11:52:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 94 transitions. [2022-12-14 11:52:10,530 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 94 transitions. Word has length 14 [2022-12-14 11:52:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:10,530 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 94 transitions. [2022-12-14 11:52:10,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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-12-14 11:52:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 94 transitions. [2022-12-14 11:52:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 11:52:10,531 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:10,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:10,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 11:52:10,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:10,733 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-12-14 11:52:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:10,735 INFO L85 PathProgramCache]: Analyzing trace with hash -961905196, now seen corresponding path program 1 times [2022-12-14 11:52:10,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:10,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044698737] [2022-12-14 11:52:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:10,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:10,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:10,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:52:10,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 11:52:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:10,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 11:52:10,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:52:10,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:10,951 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:10,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044698737] [2022-12-14 11:52:10,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044698737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:10,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:10,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:52:10,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171310788] [2022-12-14 11:52:10,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:10,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:10,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:10,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:52:10,952 INFO L87 Difference]: Start difference. First operand 43 states and 94 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-12-14 11:52:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:11,122 INFO L93 Difference]: Finished difference Result 63 states and 127 transitions. [2022-12-14 11:52:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-12-14 11:52:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:11,124 INFO L225 Difference]: With dead ends: 63 [2022-12-14 11:52:11,124 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 11:52:11,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-12-14 11:52:11,125 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:11,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:52:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 11:52:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-14 11:52:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 95 transitions. [2022-12-14 11:52:11,128 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 95 transitions. Word has length 15 [2022-12-14 11:52:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:11,128 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 95 transitions. [2022-12-14 11:52:11,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-12-14 11:52:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 95 transitions. [2022-12-14 11:52:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:52:11,128 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:11,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:11,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-14 11:52:11,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:11,330 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-12-14 11:52:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1147776987, now seen corresponding path program 1 times [2022-12-14 11:52:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:11,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649440721] [2022-12-14 11:52:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:11,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:52:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:11,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:52:11,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 11:52:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:11,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 11:52:11,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:14,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:52:14,041 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 252 treesize of output 186 [2022-12-14 11:52:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:52:14,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:52:17,219 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:52:17,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 622 treesize of output 355 [2022-12-14 11:52:45,816 WARN L233 SmtUtils]: Spent 13.69s on a formula simplification. DAG size of input: 407 DAG size of output: 14 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:52:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:52:45,886 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:45,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649440721] [2022-12-14 11:52:45,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649440721] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:52:45,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [899574081] [2022-12-14 11:52:45,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:45,887 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:52:45,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:52:45,888 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:52:45,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-12-14 11:52:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:46,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 11:52:46,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:47,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:52:47,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 186 [2022-12-14 11:52:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:52:47,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:52:48,804 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:52:48,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 622 treesize of output 355 [2022-12-14 11:53:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:53:09,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [899574081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:09,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116917593] [2022-12-14 11:53:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:53:09,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:53:09,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:53:09,130 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:53:09,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 11:53:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:53:09,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 11:53:09,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:09,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:09,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 186 [2022-12-14 11:53:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:53:10,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:11,554 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:53:11,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 622 treesize of output 355 [2022-12-14 11:53:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:53:35,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116917593] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:35,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:53:35,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 15 [2022-12-14 11:53:35,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010864038] [2022-12-14 11:53:35,654 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:53:35,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 11:53:35,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:53:35,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 11:53:35,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=183, Unknown=1, NotChecked=0, Total=240 [2022-12-14 11:53:35,656 INFO L87 Difference]: Start difference. First operand 44 states and 95 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:53:37,933 INFO L93 Difference]: Finished difference Result 77 states and 174 transitions. [2022-12-14 11:53:37,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:53:37,934 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:53:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:53:37,935 INFO L225 Difference]: With dead ends: 77 [2022-12-14 11:53:37,935 INFO L226 Difference]: Without dead ends: 72 [2022-12-14 11:53:37,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=96, Invalid=323, Unknown=1, NotChecked=0, Total=420 [2022-12-14 11:53:37,936 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 11:53:37,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 11:53:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-14 11:53:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2022-12-14 11:53:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.2545454545454544) internal successors, (124), 55 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 124 transitions. [2022-12-14 11:53:37,940 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 124 transitions. Word has length 16 [2022-12-14 11:53:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:53:37,941 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 124 transitions. [2022-12-14 11:53:37,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 124 transitions. [2022-12-14 11:53:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:53:37,941 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:53:37,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:53:37,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-12-14 11:53:38,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-14 11:53:38,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-14 11:53:38,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:53:38,545 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-12-14 11:53:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:53:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash -424115277, now seen corresponding path program 2 times [2022-12-14 11:53:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:53:38,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589675531] [2022-12-14 11:53:38,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:53:38,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:53:38,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:53:38,551 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:53:38,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 11:53:38,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:53:38,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:53:38,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 11:53:38,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:41,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:41,471 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 252 treesize of output 186 [2022-12-14 11:53:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:53:41,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:45,719 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:53:45,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 622 treesize of output 355 [2022-12-14 11:54:20,319 WARN L233 SmtUtils]: Spent 11.03s on a formula simplification. DAG size of input: 408 DAG size of output: 14 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:54:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:54:20,397 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:54:20,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589675531] [2022-12-14 11:54:20,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589675531] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:54:20,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1619372562] [2022-12-14 11:54:20,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:54:20,398 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:54:20,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:54:20,399 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:54:20,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-12-14 11:54:20,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:54:20,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:54:20,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 11:54:20,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:54:20,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:20,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:20,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:20,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-12-14 11:54:21,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 6 treesize of output 5 [2022-12-14 11:54:21,431 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-12-14 11:54:22,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 186 [2022-12-14 11:54:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:54:22,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:54:26,692 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (bvmul (_ bv4 32) c_~i~0)) (.cse25 (bvmul (_ bv4 32) c_~j~0)) (.cse6 ((_ sign_extend 32) c_~bag1~0))) (let ((.cse14 (and (not (bvsle c_~bag1~0 (_ bv0 32))) (not (bvsle c_~sum1~0 (bvadd (_ bv2147483647 32) (bvneg c_~bag1~0)))))) (.cse15 (not (bvsge ((_ sign_extend 32) c_~sum1~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse6))))) (.cse1 (bvadd (_ bv3 32) c_~A~0.offset .cse25)) (.cse2 (bvadd (_ bv2 32) c_~A~0.offset .cse25)) (.cse3 (bvadd c_~A~0.offset (_ bv1 32) .cse25)) (.cse4 (bvadd c_~A~0.offset .cse25)) (.cse7 (bvadd .cse24 (_ bv3 32) c_~A~0.offset)) (.cse8 (bvadd .cse24 (_ bv2 32) c_~A~0.offset)) (.cse9 (bvadd .cse24 c_~A~0.offset (_ bv1 32))) (.cse10 (bvadd .cse24 c_~A~0.offset))) (and (or (not (bvsge ((_ sign_extend 32) c_~sum2~0) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) c_~bag2~0))))) (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) c_~A~0.base))) (let ((.cse5 (concat (concat (concat (select .cse0 .cse7) (select .cse0 .cse8)) (select .cse0 .cse9)) (select .cse0 .cse10)))) (or (= (bvadd (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)) c_~bag2~0 c_~sum2~0) (bvadd .cse5 c_~bag1~0 c_~sum1~0)) (not (bvsge .cse6 (bvadd (bvneg ((_ sign_extend 32) .cse5)) (_ bv18446744071562067968 64)))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse5)))))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) c_~A~0.base))) (let ((.cse12 (concat (concat (concat (select .cse11 .cse7) (select .cse11 .cse8)) (select .cse11 .cse9)) (select .cse11 .cse10)))) (or (= (bvadd (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)) c_~bag2~0 c_~sum2~0) (bvadd .cse12 c_~bag1~0 c_~sum1~0)) (not (bvsge .cse6 (bvadd (bvneg ((_ sign_extend 32) .cse12)) (_ bv18446744071562067968 64)))) (not (bvsle .cse12 (_ bv0 32))))))) (or (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) c_~A~0.base))) (= (bvadd (concat (concat (concat (select .cse13 .cse1) (select .cse13 .cse2)) (select .cse13 .cse3)) (select .cse13 .cse4)) c_~bag2~0 c_~sum2~0) (bvadd (concat (concat (concat (select .cse13 .cse7) (select .cse13 .cse8)) (select .cse13 .cse9)) (select .cse13 .cse10)) c_~bag1~0 c_~sum1~0)))) .cse14 .cse15)) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32))))) (or .cse14 .cse15 (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) c_~A~0.base))) (let ((.cse16 (concat (concat (concat (select .cse17 .cse1) (select .cse17 .cse2)) (select .cse17 .cse3)) (select .cse17 .cse4)))) (or (= (bvadd .cse16 c_~bag2~0 c_~sum2~0) (bvadd (concat (concat (concat (select .cse17 .cse7) (select .cse17 .cse8)) (select .cse17 .cse9)) (select .cse17 .cse10)) c_~bag1~0 c_~sum1~0)) (= (_ bv2147483647 32) (bvadd .cse16 c_~bag2~0))))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) c_~A~0.base))) (let ((.cse18 (concat (concat (concat (select .cse20 .cse1) (select .cse20 .cse2)) (select .cse20 .cse3)) (select .cse20 .cse4))) (.cse19 (concat (concat (concat (select .cse20 .cse7) (select .cse20 .cse8)) (select .cse20 .cse9)) (select .cse20 .cse10)))) (or (= (bvadd .cse18 c_~bag2~0 c_~sum2~0) (bvadd .cse19 c_~bag1~0 c_~sum1~0)) (not (bvsge .cse6 (bvadd (bvneg ((_ sign_extend 32) .cse19)) (_ bv18446744071562067968 64)))) (= (_ bv2147483647 32) (bvadd .cse18 c_~bag2~0)) (not (bvsle .cse19 (_ bv0 32))))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_222) c_~A~0.base))) (let ((.cse22 (concat (concat (concat (select .cse23 .cse7) (select .cse23 .cse8)) (select .cse23 .cse9)) (select .cse23 .cse10))) (.cse21 (concat (concat (concat (select .cse23 .cse1) (select .cse23 .cse2)) (select .cse23 .cse3)) (select .cse23 .cse4)))) (or (= (bvadd .cse21 c_~bag2~0 c_~sum2~0) (bvadd .cse22 c_~bag1~0 c_~sum1~0)) (not (bvsge .cse6 (bvadd (bvneg ((_ sign_extend 32) .cse22)) (_ bv18446744071562067968 64)))) (not (bvsle c_~bag1~0 (bvadd (_ bv2147483647 32) (bvneg .cse22)))) (= (_ bv2147483647 32) (bvadd .cse21 c_~bag2~0))))))))) is different from false [2022-12-14 11:54:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:54:27,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1619372562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:54:27,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204171685] [2022-12-14 11:54:27,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:54:27,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:54:27,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:54:27,450 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:54:27,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 11:54:28,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:54:28,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:54:28,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 11:54:28,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:54:29,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:54:29,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 186 [2022-12-14 11:54:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:54:29,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:54:30,800 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:54:30,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 622 treesize of output 355 [2022-12-14 11:54:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:54:52,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204171685] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:54:52,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:54:52,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8, 7, 6, 6] total 21 [2022-12-14 11:54:52,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477439828] [2022-12-14 11:54:52,221 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:54:52,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 11:54:52,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:54:52,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 11:54:52,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=321, Unknown=2, NotChecked=38, Total=462 [2022-12-14 11:54:52,223 INFO L87 Difference]: Start difference. First operand 56 states and 124 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:54:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:54:57,745 INFO L93 Difference]: Finished difference Result 81 states and 193 transitions. [2022-12-14 11:54:57,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 11:54:57,748 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:54:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:54:57,749 INFO L225 Difference]: With dead ends: 81 [2022-12-14 11:54:57,749 INFO L226 Difference]: Without dead ends: 76 [2022-12-14 11:54:57,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=163, Invalid=541, Unknown=2, NotChecked=50, Total=756 [2022-12-14 11:54:57,750 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:54:57,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 27 Unchecked, 3.0s Time] [2022-12-14 11:54:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-14 11:54:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2022-12-14 11:54:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.3333333333333335) internal successors, (133), 57 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:54:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 133 transitions. [2022-12-14 11:54:57,754 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 133 transitions. Word has length 16 [2022-12-14 11:54:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:54:57,754 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 133 transitions. [2022-12-14 11:54:57,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:54:57,755 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 133 transitions. [2022-12-14 11:54:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:54:57,755 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:54:57,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:54:57,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 11:54:57,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-12-14 11:54:58,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-14 11:54:58,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:54:58,358 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-12-14 11:54:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:54:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2143053629, now seen corresponding path program 3 times [2022-12-14 11:54:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:54:58,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091339505] [2022-12-14 11:54:58,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:54:58,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:54:58,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:54:58,362 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:54:58,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 11:54:58,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 11:54:58,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:54:58,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 11:54:58,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:55:01,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:01,235 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 252 treesize of output 186 [2022-12-14 11:55:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:55:01,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:05,695 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:55:05,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 622 treesize of output 355 [2022-12-14 11:55:44,313 WARN L233 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 451 DAG size of output: 14 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:55:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:55:44,397 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:55:44,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091339505] [2022-12-14 11:55:44,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091339505] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:55:44,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1900212550] [2022-12-14 11:55:44,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:55:44,397 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:55:44,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:55:44,398 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:55:44,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-12-14 11:55:44,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 11:55:44,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:55:44,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 11:55:44,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:55:44,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:44,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:44,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:44,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-12-14 11:55:45,140 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-12-14 11:55:45,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 11:55:46,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 186 [2022-12-14 11:55:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:55:46,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:51,159 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (bvmul (_ bv4 32) c_~i~0)) (.cse25 (bvmul (_ bv4 32) c_~j~0)) (.cse14 ((_ sign_extend 32) c_~bag1~0))) (let ((.cse10 (and (not (bvsle c_~bag1~0 (_ bv0 32))) (not (bvsle c_~sum1~0 (bvadd (_ bv2147483647 32) (bvneg c_~bag1~0)))))) (.cse11 (not (bvsge ((_ sign_extend 32) c_~sum1~0) (bvadd (_ bv18446744071562067968 64) (bvneg .cse14))))) (.cse6 (bvadd (_ bv3 32) c_~A~0.offset .cse25)) (.cse7 (bvadd (_ bv2 32) c_~A~0.offset .cse25)) (.cse8 (bvadd c_~A~0.offset (_ bv1 32) .cse25)) (.cse9 (bvadd c_~A~0.offset .cse25)) (.cse2 (bvadd .cse24 (_ bv3 32) c_~A~0.offset)) (.cse3 (bvadd .cse24 (_ bv2 32) c_~A~0.offset)) (.cse4 (bvadd .cse24 c_~A~0.offset (_ bv1 32))) (.cse5 (bvadd .cse24 c_~A~0.offset))) (and (or (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_301) c_~A~0.base))) (let ((.cse0 (concat (concat (concat (select .cse1 .cse6) (select .cse1 .cse7)) (select .cse1 .cse8)) (select .cse1 .cse9)))) (or (= (_ bv2147483647 32) (bvadd .cse0 c_~bag2~0)) (= (bvadd .cse0 c_~bag2~0 c_~sum2~0) (bvadd (concat (concat (concat (select .cse1 .cse2) (select .cse1 .cse3)) (select .cse1 .cse4)) (select .cse1 .cse5)) c_~bag1~0 c_~sum1~0)))))) .cse10 .cse11) (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_301) c_~A~0.base))) (let ((.cse12 (concat (concat (concat (select .cse15 .cse6) (select .cse15 .cse7)) (select .cse15 .cse8)) (select .cse15 .cse9))) (.cse13 (concat (concat (concat (select .cse15 .cse2) (select .cse15 .cse3)) (select .cse15 .cse4)) (select .cse15 .cse5)))) (or (= (_ bv2147483647 32) (bvadd .cse12 c_~bag2~0)) (= (bvadd .cse12 c_~bag2~0 c_~sum2~0) (bvadd .cse13 c_~bag1~0 c_~sum1~0)) (not (bvsle .cse13 (_ bv0 32))) (not (bvsge .cse14 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse13))))))))) (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_301) c_~A~0.base))) (let ((.cse16 (concat (concat (concat (select .cse18 .cse6) (select .cse18 .cse7)) (select .cse18 .cse8)) (select .cse18 .cse9))) (.cse17 (concat (concat (concat (select .cse18 .cse2) (select .cse18 .cse3)) (select .cse18 .cse4)) (select .cse18 .cse5)))) (or (= (_ bv2147483647 32) (bvadd .cse16 c_~bag2~0)) (= (bvadd .cse16 c_~bag2~0 c_~sum2~0) (bvadd .cse17 c_~bag1~0 c_~sum1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse17) (_ bv2147483647 32)))) (not (bvsge .cse14 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse17))))))))) (or (and (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_301) c_~A~0.base))) (let ((.cse20 (concat (concat (concat (select .cse19 .cse2) (select .cse19 .cse3)) (select .cse19 .cse4)) (select .cse19 .cse5)))) (or (= (bvadd (concat (concat (concat (select .cse19 .cse6) (select .cse19 .cse7)) (select .cse19 .cse8)) (select .cse19 .cse9)) c_~bag2~0 c_~sum2~0) (bvadd .cse20 c_~bag1~0 c_~sum1~0)) (not (bvsle c_~bag1~0 (bvadd (bvneg .cse20) (_ bv2147483647 32)))) (not (bvsge .cse14 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse20))))))))) (or .cse10 .cse11 (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_301) c_~A~0.base))) (= (bvadd (concat (concat (concat (select .cse21 .cse6) (select .cse21 .cse7)) (select .cse21 .cse8)) (select .cse21 .cse9)) c_~bag2~0 c_~sum2~0) (bvadd (concat (concat (concat (select .cse21 .cse2) (select .cse21 .cse3)) (select .cse21 .cse4)) (select .cse21 .cse5)) c_~bag1~0 c_~sum1~0))))) (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_301) c_~A~0.base))) (let ((.cse23 (concat (concat (concat (select .cse22 .cse2) (select .cse22 .cse3)) (select .cse22 .cse4)) (select .cse22 .cse5)))) (or (= (bvadd (concat (concat (concat (select .cse22 .cse6) (select .cse22 .cse7)) (select .cse22 .cse8)) (select .cse22 .cse9)) c_~bag2~0 c_~sum2~0) (bvadd .cse23 c_~bag1~0 c_~sum1~0)) (not (bvsle .cse23 (_ bv0 32))) (not (bvsge .cse14 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse23)))))))))) (not (bvsge ((_ sign_extend 32) c_~sum2~0) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) c_~bag2~0))))) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32)))))))) is different from false [2022-12-14 11:55:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:55:51,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1900212550] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:55:51,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540556552] [2022-12-14 11:55:51,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:55:51,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:55:51,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:55:51,941 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:55:51,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 11:55:54,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 11:55:54,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:55:54,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 11:55:54,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:55:55,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:55,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 186 [2022-12-14 11:55:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:55:55,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:56,825 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:55:56,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 622 treesize of output 355 [2022-12-14 11:56:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:56:18,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540556552] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:56:18,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:56:18,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8, 7, 6, 6] total 21 [2022-12-14 11:56:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240927409] [2022-12-14 11:56:18,871 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:56:18,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 11:56:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:56:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 11:56:18,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=315, Unknown=2, NotChecked=38, Total=462 [2022-12-14 11:56:18,872 INFO L87 Difference]: Start difference. First operand 58 states and 133 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:22,902 INFO L93 Difference]: Finished difference Result 77 states and 174 transitions. [2022-12-14 11:56:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:56:22,906 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:56:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:22,907 INFO L225 Difference]: With dead ends: 77 [2022-12-14 11:56:22,907 INFO L226 Difference]: Without dead ends: 72 [2022-12-14 11:56:22,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=161, Invalid=491, Unknown=2, NotChecked=48, Total=702 [2022-12-14 11:56:22,908 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:22,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 30 Unchecked, 2.4s Time] [2022-12-14 11:56:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-14 11:56:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2022-12-14 11:56:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.3333333333333335) internal successors, (133), 57 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 133 transitions. [2022-12-14 11:56:22,911 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 133 transitions. Word has length 16 [2022-12-14 11:56:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:22,912 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 133 transitions. [2022-12-14 11:56:22,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 133 transitions. [2022-12-14 11:56:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:56:22,912 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:22,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:56:22,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 11:56:23,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-12-14 11:56:23,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2022-12-14 11:56:23,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 11:56:23,517 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-12-14 11:56:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:23,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1577476991, now seen corresponding path program 4 times [2022-12-14 11:56:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:56:23,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306707104] [2022-12-14 11:56:23,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:56:23,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:56:23,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:56:23,522 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:56:23,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-14 11:56:23,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:56:23,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:56:23,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 11:56:23,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:56:28,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:56:28,692 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 288 treesize of output 178 [2022-12-14 11:56:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:56:29,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:56:33,165 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:56:33,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 465 treesize of output 338 [2022-12-14 11:57:09,979 WARN L233 SmtUtils]: Spent 12.82s on a formula simplification. DAG size of input: 464 DAG size of output: 14 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:57:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:57:10,082 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:57:10,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306707104] [2022-12-14 11:57:10,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306707104] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:57:10,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1954367053] [2022-12-14 11:57:10,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:57:10,082 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:57:10,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:57:10,083 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:57:10,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-12-14 11:57:10,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:57:10,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:57:10,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 11:57:10,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:57:11,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:57:11,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 178 [2022-12-14 11:57:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:57:11,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:57:13,197 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:57:13,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 465 treesize of output 338 [2022-12-14 11:57:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:57:38,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1954367053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:57:38,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895912281] [2022-12-14 11:57:38,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:57:38,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:57:38,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:57:38,918 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:57:38,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd84dea-0b8f-43de-9b3c-15e69663ce5c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 11:57:41,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:57:41,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:57:41,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 11:57:41,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:57:42,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:57:42,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 178 [2022-12-14 11:57:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:57:42,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:57:43,977 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-12-14 11:57:43,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 465 treesize of output 338